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_init6_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:55:16,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:55:16,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:55:16,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:55:16,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:55:16,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:55:16,942 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:55:16,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:55:16,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:55:16,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:55:16,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:55:16,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:55:16,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:55:16,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:55:16,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:55:16,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:55:16,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:55:16,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:55:16,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:55:16,958 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:55:16,959 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:55:16,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:55:16,963 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:55:16,963 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:55:16,964 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:55:16,965 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:55:16,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:55:16,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:55:16,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:55:16,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:55:16,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:55:16,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:55:16,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:55:16,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:55:16,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:55:16,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:55:16,973 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:55:16,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:55:16,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:55:16,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:55:16,990 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:55:16,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:55:16,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:55:16,991 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:55:16,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:55:16,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:55:16,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:55:16,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:55:16,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:55:16,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:55:16,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:55:16,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:55:16,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:55:16,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:55:16,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:55:16,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:55:16,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:55:16,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:55:16,994 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:55:16,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:55:16,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:16,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:55:16,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:55:16,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:55:16,995 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:55:16,996 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:55:16,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:55:16,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:55:17,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:55:17,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:55:17,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:55:17,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:55:17,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:55:17,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init6_false-unreach-call_ground.i [2018-11-23 11:55:17,171 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ecea9f6/e5ac3bcad9884864a543d27b223c6b89/FLAG3ea56b61c [2018-11-23 11:55:17,669 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:55:17,670 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init6_false-unreach-call_ground.i [2018-11-23 11:55:17,678 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ecea9f6/e5ac3bcad9884864a543d27b223c6b89/FLAG3ea56b61c [2018-11-23 11:55:18,017 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ecea9f6/e5ac3bcad9884864a543d27b223c6b89 [2018-11-23 11:55:18,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:55:18,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:55:18,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:18,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:55:18,034 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:55:18,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6e76f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18, skipping insertion in model container [2018-11-23 11:55:18,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:55:18,076 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:55:18,314 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:18,321 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:55:18,350 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:55:18,386 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:55:18,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18 WrapperNode [2018-11-23 11:55:18,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:55:18,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:18,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:55:18,388 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:55:18,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:55:18,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:55:18,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:55:18,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:55:18,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... [2018-11-23 11:55:18,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:55:18,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:55:18,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:55:18,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:55:18,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:55:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:55:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:55:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:55:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:55:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:55:18,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:55:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:55:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:55:18,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:55:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:55:18,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:55:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:55:19,236 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:55:19,237 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 11:55:19,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:19 BoogieIcfgContainer [2018-11-23 11:55:19,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:55:19,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:55:19,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:55:19,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:55:19,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:55:18" (1/3) ... [2018-11-23 11:55:19,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f811e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:19, skipping insertion in model container [2018-11-23 11:55:19,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:55:18" (2/3) ... [2018-11-23 11:55:19,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f811e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:55:19, skipping insertion in model container [2018-11-23 11:55:19,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:55:19" (3/3) ... [2018-11-23 11:55:19,247 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init6_false-unreach-call_ground.i [2018-11-23 11:55:19,257 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:55:19,265 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:55:19,283 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:55:19,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:55:19,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:55:19,319 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:55:19,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:55:19,320 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:55:19,320 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:55:19,320 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:55:19,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:55:19,321 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:55:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 11:55:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:55:19,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:19,354 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] [2018-11-23 11:55:19,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:19,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1058720290, now seen corresponding path program 1 times [2018-11-23 11:55:19,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:19,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:19,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 11:55:19,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-23 11:55:19,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 11:55:19,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #113#return; {36#true} is VALID [2018-11-23 11:55:19,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret2 := main(); {36#true} is VALID [2018-11-23 11:55:19,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {36#true} is VALID [2018-11-23 11:55:19,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 11:55:19,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 11:55:19,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:55:19,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 11:55:19,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:55:19,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 11:55:19,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:55:19,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 11:55:19,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:55:19,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 11:55:19,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-23 11:55:19,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} havoc ~x~0;~x~0 := 0; {37#false} is VALID [2018-11-23 11:55:19,527 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {37#false} is VALID [2018-11-23 11:55:19,528 INFO L256 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {37#false} is VALID [2018-11-23 11:55:19,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-23 11:55:19,528 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2018-11-23 11:55:19,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 11:55:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:19,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:19,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:55:19,540 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 11:55:19,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:19,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:55:19,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:19,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:55:19,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:55:19,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:19,742 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 11:55:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:19,896 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2018-11-23 11:55:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:55:19,896 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 11:55:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2018-11-23 11:55:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:55:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2018-11-23 11:55:19,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2018-11-23 11:55:20,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:20,365 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:55:20,365 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:55:20,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:55:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:55:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:55:20,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:20,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:55:20,423 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:55:20,424 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:55:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:20,428 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 11:55:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 11:55:20,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:20,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:20,429 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:55:20,430 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:55:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:20,434 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 11:55:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 11:55:20,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:20,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:20,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:20,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:55:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-23 11:55:20,441 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2018-11-23 11:55:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:20,441 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 11:55:20,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:55:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 11:55:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:55:20,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:20,443 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] [2018-11-23 11:55:20,443 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:20,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:20,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1432039210, now seen corresponding path program 1 times [2018-11-23 11:55:20,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:20,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:20,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:20,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:20,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:20,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2018-11-23 11:55:20,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {217#true} is VALID [2018-11-23 11:55:20,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {217#true} assume true; {217#true} is VALID [2018-11-23 11:55:20,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {217#true} {217#true} #113#return; {217#true} is VALID [2018-11-23 11:55:20,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {217#true} call #t~ret2 := main(); {217#true} is VALID [2018-11-23 11:55:20,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {219#(= main_~i~0 0)} is VALID [2018-11-23 11:55:20,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {219#(= main_~i~0 0)} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 11:55:20,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 11:55:20,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 11:55:20,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 11:55:20,525 INFO L273 TraceCheckUtils]: 10: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 11:55:20,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 11:55:20,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 11:55:20,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 11:55:20,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 11:55:20,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {218#false} ~i~0 := 0; {218#false} is VALID [2018-11-23 11:55:20,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {218#false} assume !(~i~0 < 100000); {218#false} is VALID [2018-11-23 11:55:20,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {218#false} havoc ~x~0;~x~0 := 0; {218#false} is VALID [2018-11-23 11:55:20,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {218#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {218#false} is VALID [2018-11-23 11:55:20,528 INFO L256 TraceCheckUtils]: 19: Hoare triple {218#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {218#false} is VALID [2018-11-23 11:55:20,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2018-11-23 11:55:20,529 INFO L273 TraceCheckUtils]: 21: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2018-11-23 11:55:20,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {218#false} assume !false; {218#false} is VALID [2018-11-23 11:55:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:55:20,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:55:20,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:55:20,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:55:20,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:20,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:55:20,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:20,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:55:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:55:20,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:20,589 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 3 states. [2018-11-23 11:55:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:21,183 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 11:55:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:55:21,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:55:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 11:55:21,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:55:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-23 11:55:21,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-23 11:55:21,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:21,357 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:55:21,358 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:55:21,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:55:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:55:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 11:55:21,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:21,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:21,412 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:21,412 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:21,415 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 11:55:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 11:55:21,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:21,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:21,417 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:21,417 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 11:55:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:21,420 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 11:55:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 11:55:21,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:21,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:21,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:21,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:55:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-23 11:55:21,424 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2018-11-23 11:55:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:21,425 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-23 11:55:21,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:55:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 11:55:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:55:21,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:21,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:55:21,427 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:21,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2002754829, now seen corresponding path program 1 times [2018-11-23 11:55:21,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:21,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:21,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:21,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:21,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:21,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2018-11-23 11:55:21,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {425#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {425#true} is VALID [2018-11-23 11:55:21,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2018-11-23 11:55:21,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #113#return; {425#true} is VALID [2018-11-23 11:55:21,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2018-11-23 11:55:21,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {425#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {427#(= main_~i~0 0)} is VALID [2018-11-23 11:55:21,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {427#(= 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; {428#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:21,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {428#(<= main_~i~0 1)} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {426#false} havoc ~x~0;~x~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {426#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {426#false} is VALID [2018-11-23 11:55:21,554 INFO L256 TraceCheckUtils]: 25: Hoare triple {426#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {426#false} is VALID [2018-11-23 11:55:21,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {426#false} ~cond := #in~cond; {426#false} is VALID [2018-11-23 11:55:21,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {426#false} assume 0 == ~cond; {426#false} is VALID [2018-11-23 11:55:21,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {426#false} assume !false; {426#false} is VALID [2018-11-23 11:55:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:55:21,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:21,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:21,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:21,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:21,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2018-11-23 11:55:21,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {425#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {425#true} is VALID [2018-11-23 11:55:21,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2018-11-23 11:55:21,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #113#return; {425#true} is VALID [2018-11-23 11:55:21,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2018-11-23 11:55:21,978 INFO L273 TraceCheckUtils]: 5: Hoare triple {425#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {447#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:21,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {447#(<= 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; {428#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:21,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {428#(<= main_~i~0 1)} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,981 INFO L273 TraceCheckUtils]: 11: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,983 INFO L273 TraceCheckUtils]: 16: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,984 INFO L273 TraceCheckUtils]: 19: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {426#false} ~i~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {426#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {426#false} is VALID [2018-11-23 11:55:21,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {426#false} assume !(~i~0 < 100000); {426#false} is VALID [2018-11-23 11:55:21,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {426#false} havoc ~x~0;~x~0 := 0; {426#false} is VALID [2018-11-23 11:55:21,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {426#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {426#false} is VALID [2018-11-23 11:55:21,985 INFO L256 TraceCheckUtils]: 25: Hoare triple {426#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {426#false} is VALID [2018-11-23 11:55:21,986 INFO L273 TraceCheckUtils]: 26: Hoare triple {426#false} ~cond := #in~cond; {426#false} is VALID [2018-11-23 11:55:21,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {426#false} assume 0 == ~cond; {426#false} is VALID [2018-11-23 11:55:21,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {426#false} assume !false; {426#false} is VALID [2018-11-23 11:55:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:55:22,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:22,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:55:22,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:55:22,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:22,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:55:22,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:22,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:55:22,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:55:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:22,116 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 5 states. [2018-11-23 11:55:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:22,496 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2018-11-23 11:55:22,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:55:22,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-23 11:55:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 11:55:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:55:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-23 11:55:22,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-23 11:55:22,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:22,726 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:55:22,726 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:55:22,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:55:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:55:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:55:22,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:22,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:22,793 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:22,793 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:22,796 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:55:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:55:22,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:22,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:22,798 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:22,798 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:55:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:22,804 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:55:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:55:22,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:22,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:22,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:22,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:55:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 11:55:22,808 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 29 [2018-11-23 11:55:22,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:22,809 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 11:55:22,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:55:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:55:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:55:22,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:22,813 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:22,813 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:22,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1979990410, now seen corresponding path program 2 times [2018-11-23 11:55:22,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:22,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:22,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 11:55:22,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {765#true} is VALID [2018-11-23 11:55:22,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 11:55:22,981 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #113#return; {765#true} is VALID [2018-11-23 11:55:22,981 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 11:55:22,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {767#(= main_~i~0 0)} is VALID [2018-11-23 11:55:22,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {767#(= 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; {768#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:22,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {768#(<= 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; {769#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:22,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {769#(<= main_~i~0 2)} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:55:22,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 11:55:22,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,992 INFO L273 TraceCheckUtils]: 12: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:55:22,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 11:55:22,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:55:22,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 11:55:22,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:55:22,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 11:55:22,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,995 INFO L273 TraceCheckUtils]: 24: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:55:22,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 11:55:22,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,996 INFO L273 TraceCheckUtils]: 27: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:22,996 INFO L273 TraceCheckUtils]: 28: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:55:22,997 INFO L273 TraceCheckUtils]: 29: Hoare triple {766#false} havoc ~x~0;~x~0 := 0; {766#false} is VALID [2018-11-23 11:55:22,997 INFO L273 TraceCheckUtils]: 30: Hoare triple {766#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {766#false} is VALID [2018-11-23 11:55:22,997 INFO L256 TraceCheckUtils]: 31: Hoare triple {766#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {766#false} is VALID [2018-11-23 11:55:22,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 11:55:22,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2018-11-23 11:55:22,998 INFO L273 TraceCheckUtils]: 34: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 11:55:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 11:55:23,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:23,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:23,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:23,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:23,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:23,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:23,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 11:55:23,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {765#true} is VALID [2018-11-23 11:55:23,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 11:55:23,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #113#return; {765#true} is VALID [2018-11-23 11:55:23,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 11:55:23,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {765#true} is VALID [2018-11-23 11:55:23,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 11:55:23,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 11:55:23,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {765#true} assume !(~i~0 < 100000); {765#true} is VALID [2018-11-23 11:55:23,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {765#true} ~i~0 := 0; {765#true} is VALID [2018-11-23 11:55:23,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 11:55:23,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 11:55:23,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {765#true} assume !(~i~0 < 100000); {765#true} is VALID [2018-11-23 11:55:23,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {765#true} ~i~0 := 0; {765#true} is VALID [2018-11-23 11:55:23,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 11:55:23,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {765#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {765#true} is VALID [2018-11-23 11:55:23,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {765#true} assume !(~i~0 < 100000); {765#true} is VALID [2018-11-23 11:55:23,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {765#true} ~i~0 := 0; {824#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:23,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {824#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {768#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:23,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {768#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {769#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:23,246 INFO L273 TraceCheckUtils]: 20: Hoare triple {769#(<= main_~i~0 2)} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:55:23,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 11:55:23,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:23,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:23,247 INFO L273 TraceCheckUtils]: 24: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:55:23,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {766#false} ~i~0 := 0; {766#false} is VALID [2018-11-23 11:55:23,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:23,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {766#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {766#false} is VALID [2018-11-23 11:55:23,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {766#false} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 11:55:23,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {766#false} havoc ~x~0;~x~0 := 0; {766#false} is VALID [2018-11-23 11:55:23,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {766#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {766#false} is VALID [2018-11-23 11:55:23,249 INFO L256 TraceCheckUtils]: 31: Hoare triple {766#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {766#false} is VALID [2018-11-23 11:55:23,249 INFO L273 TraceCheckUtils]: 32: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 11:55:23,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2018-11-23 11:55:23,250 INFO L273 TraceCheckUtils]: 34: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 11:55:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 11:55:23,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:23,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:55:23,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-23 11:55:23,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:23,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:55:23,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:23,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:55:23,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:55:23,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:23,347 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 6 states. [2018-11-23 11:55:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:23,683 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2018-11-23 11:55:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:55:23,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-23 11:55:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 11:55:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:55:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-23 11:55:23,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2018-11-23 11:55:23,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:23,900 INFO L225 Difference]: With dead ends: 77 [2018-11-23 11:55:23,900 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:55:23,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:55:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:55:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 11:55:23,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:23,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:23,949 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:23,949 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:23,953 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 11:55:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 11:55:23,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:23,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:23,953 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:23,954 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 11:55:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:23,956 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 11:55:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 11:55:23,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:23,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:23,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:23,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:55:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 11:55:23,960 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 35 [2018-11-23 11:55:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:23,961 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 11:55:23,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:55:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 11:55:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:55:23,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:23,963 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:23,963 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:23,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash 682352339, now seen corresponding path program 3 times [2018-11-23 11:55:23,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:23,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:23,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:24,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2018-11-23 11:55:24,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1170#true} is VALID [2018-11-23 11:55:24,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-23 11:55:24,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #113#return; {1170#true} is VALID [2018-11-23 11:55:24,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret2 := main(); {1170#true} is VALID [2018-11-23 11:55:24,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {1170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1172#(= main_~i~0 0)} is VALID [2018-11-23 11:55:24,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {1172#(= 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; {1173#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:24,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {1173#(<= 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; {1174#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:24,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {1174#(<= 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; {1175#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:24,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {1175#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 11:55:24,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 11:55:24,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 11:55:24,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 11:55:24,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 11:55:24,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 11:55:24,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 11:55:24,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 11:55:24,131 INFO L273 TraceCheckUtils]: 26: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,132 INFO L273 TraceCheckUtils]: 27: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 11:55:24,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-23 11:55:24,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {1171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1171#false} is VALID [2018-11-23 11:55:24,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {1171#false} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 11:55:24,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {1171#false} havoc ~x~0;~x~0 := 0; {1171#false} is VALID [2018-11-23 11:55:24,134 INFO L273 TraceCheckUtils]: 36: Hoare triple {1171#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1171#false} is VALID [2018-11-23 11:55:24,134 INFO L256 TraceCheckUtils]: 37: Hoare triple {1171#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1171#false} is VALID [2018-11-23 11:55:24,134 INFO L273 TraceCheckUtils]: 38: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2018-11-23 11:55:24,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {1171#false} assume 0 == ~cond; {1171#false} is VALID [2018-11-23 11:55:24,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2018-11-23 11:55:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 11:55:24,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:24,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:24,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:24,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:55:24,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:24,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:24,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2018-11-23 11:55:24,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1170#true} is VALID [2018-11-23 11:55:24,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-23 11:55:24,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #113#return; {1170#true} is VALID [2018-11-23 11:55:24,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret2 := main(); {1170#true} is VALID [2018-11-23 11:55:24,313 INFO L273 TraceCheckUtils]: 5: Hoare triple {1170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1170#true} is VALID [2018-11-23 11:55:24,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,314 INFO L273 TraceCheckUtils]: 7: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 11:55:24,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {1170#true} ~i~0 := 0; {1170#true} is VALID [2018-11-23 11:55:24,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 11:55:24,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {1170#true} ~i~0 := 0; {1170#true} is VALID [2018-11-23 11:55:24,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 11:55:24,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {1170#true} ~i~0 := 0; {1170#true} is VALID [2018-11-23 11:55:24,318 INFO L273 TraceCheckUtils]: 21: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,319 INFO L273 TraceCheckUtils]: 22: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 11:55:24,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {1170#true} ~i~0 := 0; {1170#true} is VALID [2018-11-23 11:55:24,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1170#true} is VALID [2018-11-23 11:55:24,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-23 11:55:24,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {1170#true} ~i~0 := 0; {1269#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:24,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {1269#(<= 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; {1173#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:24,324 INFO L273 TraceCheckUtils]: 32: Hoare triple {1173#(<= 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; {1174#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:24,325 INFO L273 TraceCheckUtils]: 33: Hoare triple {1174#(<= 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; {1175#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:24,326 INFO L273 TraceCheckUtils]: 34: Hoare triple {1175#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-23 11:55:24,326 INFO L273 TraceCheckUtils]: 35: Hoare triple {1171#false} havoc ~x~0;~x~0 := 0; {1171#false} is VALID [2018-11-23 11:55:24,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {1171#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1171#false} is VALID [2018-11-23 11:55:24,326 INFO L256 TraceCheckUtils]: 37: Hoare triple {1171#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1171#false} is VALID [2018-11-23 11:55:24,327 INFO L273 TraceCheckUtils]: 38: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2018-11-23 11:55:24,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {1171#false} assume 0 == ~cond; {1171#false} is VALID [2018-11-23 11:55:24,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2018-11-23 11:55:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 11:55:24,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:24,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:55:24,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 11:55:24,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:24,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:55:24,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:24,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:55:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:55:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:24,460 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 7 states. [2018-11-23 11:55:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:24,836 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2018-11-23 11:55:24,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:55:24,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-23 11:55:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-23 11:55:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:55:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2018-11-23 11:55:24,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2018-11-23 11:55:24,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:24,994 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:55:24,994 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:55:24,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:55:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:55:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 11:55:25,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:25,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:25,188 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:25,188 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,191 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 11:55:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 11:55:25,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,192 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:25,192 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,194 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 11:55:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 11:55:25,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:25,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:25,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:25,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:55:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-23 11:55:25,198 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 41 [2018-11-23 11:55:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:25,199 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-23 11:55:25,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:55:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 11:55:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:55:25,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:25,200 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:25,200 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:25,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash -411261930, now seen corresponding path program 4 times [2018-11-23 11:55:25,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:25,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:25,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:25,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {1640#true} call ULTIMATE.init(); {1640#true} is VALID [2018-11-23 11:55:25,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {1640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1640#true} is VALID [2018-11-23 11:55:25,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {1640#true} assume true; {1640#true} is VALID [2018-11-23 11:55:25,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1640#true} {1640#true} #113#return; {1640#true} is VALID [2018-11-23 11:55:25,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {1640#true} call #t~ret2 := main(); {1640#true} is VALID [2018-11-23 11:55:25,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {1640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1642#(= main_~i~0 0)} is VALID [2018-11-23 11:55:25,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {1642#(= 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; {1643#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:25,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {1643#(<= 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; {1644#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:25,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {1644#(<= 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; {1645#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:25,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {1645#(<= 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; {1646#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:25,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {1646#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,441 INFO L273 TraceCheckUtils]: 31: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,441 INFO L273 TraceCheckUtils]: 32: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,442 INFO L273 TraceCheckUtils]: 37: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,443 INFO L273 TraceCheckUtils]: 41: Hoare triple {1641#false} havoc ~x~0;~x~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {1641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1641#false} is VALID [2018-11-23 11:55:25,444 INFO L256 TraceCheckUtils]: 43: Hoare triple {1641#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1641#false} is VALID [2018-11-23 11:55:25,444 INFO L273 TraceCheckUtils]: 44: Hoare triple {1641#false} ~cond := #in~cond; {1641#false} is VALID [2018-11-23 11:55:25,444 INFO L273 TraceCheckUtils]: 45: Hoare triple {1641#false} assume 0 == ~cond; {1641#false} is VALID [2018-11-23 11:55:25,444 INFO L273 TraceCheckUtils]: 46: Hoare triple {1641#false} assume !false; {1641#false} is VALID [2018-11-23 11:55:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:55:25,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:25,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:25,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:25,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:25,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:25,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:25,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {1640#true} call ULTIMATE.init(); {1640#true} is VALID [2018-11-23 11:55:25,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {1640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1640#true} is VALID [2018-11-23 11:55:25,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {1640#true} assume true; {1640#true} is VALID [2018-11-23 11:55:25,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1640#true} {1640#true} #113#return; {1640#true} is VALID [2018-11-23 11:55:25,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {1640#true} call #t~ret2 := main(); {1640#true} is VALID [2018-11-23 11:55:25,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {1640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1665#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:25,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {1665#(<= 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; {1643#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:25,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {1643#(<= 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; {1644#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:25,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {1644#(<= 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; {1645#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:25,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {1645#(<= 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; {1646#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:25,683 INFO L273 TraceCheckUtils]: 10: Hoare triple {1646#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,688 INFO L273 TraceCheckUtils]: 33: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {1641#false} ~i~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,688 INFO L273 TraceCheckUtils]: 36: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,688 INFO L273 TraceCheckUtils]: 37: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,688 INFO L273 TraceCheckUtils]: 38: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,689 INFO L273 TraceCheckUtils]: 39: Hoare triple {1641#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1641#false} is VALID [2018-11-23 11:55:25,689 INFO L273 TraceCheckUtils]: 40: Hoare triple {1641#false} assume !(~i~0 < 100000); {1641#false} is VALID [2018-11-23 11:55:25,689 INFO L273 TraceCheckUtils]: 41: Hoare triple {1641#false} havoc ~x~0;~x~0 := 0; {1641#false} is VALID [2018-11-23 11:55:25,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {1641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1641#false} is VALID [2018-11-23 11:55:25,689 INFO L256 TraceCheckUtils]: 43: Hoare triple {1641#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1641#false} is VALID [2018-11-23 11:55:25,689 INFO L273 TraceCheckUtils]: 44: Hoare triple {1641#false} ~cond := #in~cond; {1641#false} is VALID [2018-11-23 11:55:25,690 INFO L273 TraceCheckUtils]: 45: Hoare triple {1641#false} assume 0 == ~cond; {1641#false} is VALID [2018-11-23 11:55:25,690 INFO L273 TraceCheckUtils]: 46: Hoare triple {1641#false} assume !false; {1641#false} is VALID [2018-11-23 11:55:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 11:55:25,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:25,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:55:25,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 11:55:25,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:25,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:55:25,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:25,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:55:25,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:55:25,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:25,745 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 8 states. [2018-11-23 11:55:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:26,393 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2018-11-23 11:55:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:55:26,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 11:55:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-23 11:55:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:55:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-23 11:55:26,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2018-11-23 11:55:26,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:26,620 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:55:26,620 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:55:26,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:55:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:55:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 11:55:26,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:26,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:26,690 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:26,690 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:26,693 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 11:55:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 11:55:26,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:26,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:26,694 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:26,694 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 11:55:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:26,697 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 11:55:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 11:55:26,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:26,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:26,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:26,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:55:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-11-23 11:55:26,701 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 47 [2018-11-23 11:55:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:26,701 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-11-23 11:55:26,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:55:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 11:55:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:55:26,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:26,703 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:26,703 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:26,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:26,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1179573581, now seen corresponding path program 5 times [2018-11-23 11:55:26,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:26,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:26,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:26,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:26,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:26,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {2175#true} call ULTIMATE.init(); {2175#true} is VALID [2018-11-23 11:55:26,954 INFO L273 TraceCheckUtils]: 1: Hoare triple {2175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2175#true} is VALID [2018-11-23 11:55:26,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {2175#true} assume true; {2175#true} is VALID [2018-11-23 11:55:26,954 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2175#true} {2175#true} #113#return; {2175#true} is VALID [2018-11-23 11:55:26,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {2175#true} call #t~ret2 := main(); {2175#true} is VALID [2018-11-23 11:55:26,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {2175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2177#(= main_~i~0 0)} is VALID [2018-11-23 11:55:26,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {2177#(= 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; {2178#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:26,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {2178#(<= 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; {2179#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:26,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {2179#(<= 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; {2180#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:26,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {2180#(<= 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; {2181#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:26,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {2181#(<= 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; {2182#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:26,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {2182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 11:55:26,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 11:55:26,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,974 INFO L273 TraceCheckUtils]: 14: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 11:55:26,974 INFO L273 TraceCheckUtils]: 19: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 11:55:26,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,975 INFO L273 TraceCheckUtils]: 21: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,975 INFO L273 TraceCheckUtils]: 22: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,975 INFO L273 TraceCheckUtils]: 23: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 11:55:26,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 11:55:26,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,976 INFO L273 TraceCheckUtils]: 31: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,976 INFO L273 TraceCheckUtils]: 32: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 11:55:26,976 INFO L273 TraceCheckUtils]: 33: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 11:55:26,977 INFO L273 TraceCheckUtils]: 34: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,977 INFO L273 TraceCheckUtils]: 35: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,977 INFO L273 TraceCheckUtils]: 36: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,977 INFO L273 TraceCheckUtils]: 37: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,978 INFO L273 TraceCheckUtils]: 38: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,978 INFO L273 TraceCheckUtils]: 39: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 11:55:26,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 11:55:26,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,979 INFO L273 TraceCheckUtils]: 45: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:26,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 11:55:26,979 INFO L273 TraceCheckUtils]: 47: Hoare triple {2176#false} havoc ~x~0;~x~0 := 0; {2176#false} is VALID [2018-11-23 11:55:26,980 INFO L273 TraceCheckUtils]: 48: Hoare triple {2176#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2176#false} is VALID [2018-11-23 11:55:26,980 INFO L256 TraceCheckUtils]: 49: Hoare triple {2176#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2176#false} is VALID [2018-11-23 11:55:26,980 INFO L273 TraceCheckUtils]: 50: Hoare triple {2176#false} ~cond := #in~cond; {2176#false} is VALID [2018-11-23 11:55:26,980 INFO L273 TraceCheckUtils]: 51: Hoare triple {2176#false} assume 0 == ~cond; {2176#false} is VALID [2018-11-23 11:55:26,980 INFO L273 TraceCheckUtils]: 52: Hoare triple {2176#false} assume !false; {2176#false} is VALID [2018-11-23 11:55:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:55:26,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:26,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:31,159 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 11:55:31,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:31,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:31,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {2175#true} call ULTIMATE.init(); {2175#true} is VALID [2018-11-23 11:55:31,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {2175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2175#true} is VALID [2018-11-23 11:55:31,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {2175#true} assume true; {2175#true} is VALID [2018-11-23 11:55:31,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2175#true} {2175#true} #113#return; {2175#true} is VALID [2018-11-23 11:55:31,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {2175#true} call #t~ret2 := main(); {2175#true} is VALID [2018-11-23 11:55:31,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {2175#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2175#true} is VALID [2018-11-23 11:55:31,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {2175#true} assume !(~i~0 < 100000); {2175#true} is VALID [2018-11-23 11:55:31,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {2175#true} ~i~0 := 0; {2175#true} is VALID [2018-11-23 11:55:31,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {2175#true} assume !(~i~0 < 100000); {2175#true} is VALID [2018-11-23 11:55:31,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {2175#true} ~i~0 := 0; {2175#true} is VALID [2018-11-23 11:55:31,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,500 INFO L273 TraceCheckUtils]: 24: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,500 INFO L273 TraceCheckUtils]: 25: Hoare triple {2175#true} assume !(~i~0 < 100000); {2175#true} is VALID [2018-11-23 11:55:31,500 INFO L273 TraceCheckUtils]: 26: Hoare triple {2175#true} ~i~0 := 0; {2175#true} is VALID [2018-11-23 11:55:31,500 INFO L273 TraceCheckUtils]: 27: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,501 INFO L273 TraceCheckUtils]: 29: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,501 INFO L273 TraceCheckUtils]: 30: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,501 INFO L273 TraceCheckUtils]: 31: Hoare triple {2175#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2175#true} is VALID [2018-11-23 11:55:31,501 INFO L273 TraceCheckUtils]: 32: Hoare triple {2175#true} assume !(~i~0 < 100000); {2175#true} is VALID [2018-11-23 11:55:31,502 INFO L273 TraceCheckUtils]: 33: Hoare triple {2175#true} ~i~0 := 0; {2285#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:31,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {2285#(<= 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; {2178#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:31,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {2178#(<= 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; {2179#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:31,504 INFO L273 TraceCheckUtils]: 36: Hoare triple {2179#(<= 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; {2180#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:31,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {2180#(<= 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; {2181#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:31,505 INFO L273 TraceCheckUtils]: 38: Hoare triple {2181#(<= 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; {2182#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:31,506 INFO L273 TraceCheckUtils]: 39: Hoare triple {2182#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 11:55:31,506 INFO L273 TraceCheckUtils]: 40: Hoare triple {2176#false} ~i~0 := 0; {2176#false} is VALID [2018-11-23 11:55:31,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:31,507 INFO L273 TraceCheckUtils]: 42: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:31,507 INFO L273 TraceCheckUtils]: 43: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:31,507 INFO L273 TraceCheckUtils]: 44: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:31,507 INFO L273 TraceCheckUtils]: 45: Hoare triple {2176#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2176#false} is VALID [2018-11-23 11:55:31,507 INFO L273 TraceCheckUtils]: 46: Hoare triple {2176#false} assume !(~i~0 < 100000); {2176#false} is VALID [2018-11-23 11:55:31,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {2176#false} havoc ~x~0;~x~0 := 0; {2176#false} is VALID [2018-11-23 11:55:31,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {2176#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2176#false} is VALID [2018-11-23 11:55:31,508 INFO L256 TraceCheckUtils]: 49: Hoare triple {2176#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2176#false} is VALID [2018-11-23 11:55:31,508 INFO L273 TraceCheckUtils]: 50: Hoare triple {2176#false} ~cond := #in~cond; {2176#false} is VALID [2018-11-23 11:55:31,509 INFO L273 TraceCheckUtils]: 51: Hoare triple {2176#false} assume 0 == ~cond; {2176#false} is VALID [2018-11-23 11:55:31,509 INFO L273 TraceCheckUtils]: 52: Hoare triple {2176#false} assume !false; {2176#false} is VALID [2018-11-23 11:55:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:55:31,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:31,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:55:31,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-11-23 11:55:31,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:31,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:55:31,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:31,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:55:31,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:55:31,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:31,595 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 9 states. [2018-11-23 11:55:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:31,964 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2018-11-23 11:55:31,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:55:31,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-11-23 11:55:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2018-11-23 11:55:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:55:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2018-11-23 11:55:31,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 102 transitions. [2018-11-23 11:55:32,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:32,097 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:55:32,097 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:55:32,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:55:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:55:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 11:55:32,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:32,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:32,190 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:32,190 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,192 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-23 11:55:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 11:55:32,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:32,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:32,194 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:32,194 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:32,196 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-23 11:55:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 11:55:32,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:32,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:32,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:32,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:55:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-11-23 11:55:32,200 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 53 [2018-11-23 11:55:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:32,200 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-11-23 11:55:32,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:55:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-23 11:55:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:55:32,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:32,202 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:32,202 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:32,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:32,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1766162870, now seen corresponding path program 6 times [2018-11-23 11:55:32,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:32,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:32,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:32,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:32,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:32,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2018-11-23 11:55:32,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {2775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2775#true} is VALID [2018-11-23 11:55:32,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2018-11-23 11:55:32,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #113#return; {2775#true} is VALID [2018-11-23 11:55:32,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret2 := main(); {2775#true} is VALID [2018-11-23 11:55:32,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {2775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2777#(= main_~i~0 0)} is VALID [2018-11-23 11:55:32,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {2777#(= 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; {2778#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:32,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {2778#(<= 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; {2779#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:32,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {2779#(<= 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; {2780#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:32,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {2780#(<= 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; {2781#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:32,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {2781#(<= 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; {2782#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:32,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {2782#(<= 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; {2783#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:32,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {2783#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:32,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:32,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:32,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:32,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:32,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:32,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,537 INFO L273 TraceCheckUtils]: 31: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,537 INFO L273 TraceCheckUtils]: 32: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,537 INFO L273 TraceCheckUtils]: 34: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,537 INFO L273 TraceCheckUtils]: 35: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,538 INFO L273 TraceCheckUtils]: 36: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:32,538 INFO L273 TraceCheckUtils]: 37: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:32,538 INFO L273 TraceCheckUtils]: 38: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,538 INFO L273 TraceCheckUtils]: 39: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,538 INFO L273 TraceCheckUtils]: 40: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,538 INFO L273 TraceCheckUtils]: 41: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,538 INFO L273 TraceCheckUtils]: 42: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,538 INFO L273 TraceCheckUtils]: 43: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,539 INFO L273 TraceCheckUtils]: 44: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:32,539 INFO L273 TraceCheckUtils]: 45: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:32,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,539 INFO L273 TraceCheckUtils]: 47: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,539 INFO L273 TraceCheckUtils]: 49: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,540 INFO L273 TraceCheckUtils]: 50: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,540 INFO L273 TraceCheckUtils]: 51: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:32,540 INFO L273 TraceCheckUtils]: 52: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:32,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {2776#false} havoc ~x~0;~x~0 := 0; {2776#false} is VALID [2018-11-23 11:55:32,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {2776#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2776#false} is VALID [2018-11-23 11:55:32,541 INFO L256 TraceCheckUtils]: 55: Hoare triple {2776#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2776#false} is VALID [2018-11-23 11:55:32,541 INFO L273 TraceCheckUtils]: 56: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2018-11-23 11:55:32,541 INFO L273 TraceCheckUtils]: 57: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2018-11-23 11:55:32,541 INFO L273 TraceCheckUtils]: 58: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2018-11-23 11:55:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 11:55:32,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:32,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:32,561 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:33,769 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 11:55:33,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:33,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:34,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2018-11-23 11:55:34,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {2775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2775#true} is VALID [2018-11-23 11:55:34,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2018-11-23 11:55:34,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #113#return; {2775#true} is VALID [2018-11-23 11:55:34,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret2 := main(); {2775#true} is VALID [2018-11-23 11:55:34,034 INFO L273 TraceCheckUtils]: 5: Hoare triple {2775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2802#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:34,035 INFO L273 TraceCheckUtils]: 6: Hoare triple {2802#(<= 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; {2778#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:34,035 INFO L273 TraceCheckUtils]: 7: Hoare triple {2778#(<= 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; {2779#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:34,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {2779#(<= 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; {2780#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:34,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {2780#(<= 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; {2781#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:34,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {2781#(<= 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; {2782#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:34,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {2782#(<= 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; {2783#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:34,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {2783#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:34,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:34,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,041 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,041 INFO L273 TraceCheckUtils]: 19: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:34,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:34,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,042 INFO L273 TraceCheckUtils]: 24: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:34,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:34,043 INFO L273 TraceCheckUtils]: 30: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,044 INFO L273 TraceCheckUtils]: 31: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,044 INFO L273 TraceCheckUtils]: 32: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,044 INFO L273 TraceCheckUtils]: 33: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,044 INFO L273 TraceCheckUtils]: 34: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:34,045 INFO L273 TraceCheckUtils]: 37: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:34,045 INFO L273 TraceCheckUtils]: 38: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,045 INFO L273 TraceCheckUtils]: 39: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,045 INFO L273 TraceCheckUtils]: 40: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,045 INFO L273 TraceCheckUtils]: 41: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,046 INFO L273 TraceCheckUtils]: 44: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:34,046 INFO L273 TraceCheckUtils]: 45: Hoare triple {2776#false} ~i~0 := 0; {2776#false} is VALID [2018-11-23 11:55:34,046 INFO L273 TraceCheckUtils]: 46: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,046 INFO L273 TraceCheckUtils]: 47: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,047 INFO L273 TraceCheckUtils]: 49: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,047 INFO L273 TraceCheckUtils]: 50: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {2776#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2776#false} is VALID [2018-11-23 11:55:34,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {2776#false} assume !(~i~0 < 100000); {2776#false} is VALID [2018-11-23 11:55:34,047 INFO L273 TraceCheckUtils]: 53: Hoare triple {2776#false} havoc ~x~0;~x~0 := 0; {2776#false} is VALID [2018-11-23 11:55:34,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {2776#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2776#false} is VALID [2018-11-23 11:55:34,048 INFO L256 TraceCheckUtils]: 55: Hoare triple {2776#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2776#false} is VALID [2018-11-23 11:55:34,048 INFO L273 TraceCheckUtils]: 56: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2018-11-23 11:55:34,048 INFO L273 TraceCheckUtils]: 57: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2018-11-23 11:55:34,048 INFO L273 TraceCheckUtils]: 58: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2018-11-23 11:55:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 11:55:34,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:34,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:55:34,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-23 11:55:34,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:34,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:55:34,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:34,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:55:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:55:34,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:34,111 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 10 states. [2018-11-23 11:55:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:34,907 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2018-11-23 11:55:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:55:34,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-23 11:55:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-23 11:55:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-23 11:55:34,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2018-11-23 11:55:35,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:35,115 INFO L225 Difference]: With dead ends: 121 [2018-11-23 11:55:35,115 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 11:55:35,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:35,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 11:55:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-23 11:55:35,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:35,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:35,166 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:35,166 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:35,170 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-23 11:55:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 11:55:35,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:35,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:35,170 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:35,170 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-23 11:55:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:35,172 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-23 11:55:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 11:55:35,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:35,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:35,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:35,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:55:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-11-23 11:55:35,175 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 59 [2018-11-23 11:55:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:35,176 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-11-23 11:55:35,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:55:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-23 11:55:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:55:35,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:35,177 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:35,177 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:35,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:35,177 INFO L82 PathProgramCache]: Analyzing trace with hash 728903315, now seen corresponding path program 7 times [2018-11-23 11:55:35,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:35,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:35,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:35,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:35,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:35,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {3440#true} call ULTIMATE.init(); {3440#true} is VALID [2018-11-23 11:55:35,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {3440#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3440#true} is VALID [2018-11-23 11:55:35,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {3440#true} assume true; {3440#true} is VALID [2018-11-23 11:55:35,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3440#true} {3440#true} #113#return; {3440#true} is VALID [2018-11-23 11:55:35,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {3440#true} call #t~ret2 := main(); {3440#true} is VALID [2018-11-23 11:55:35,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {3440#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3442#(= main_~i~0 0)} is VALID [2018-11-23 11:55:35,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {3442#(= 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; {3443#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:35,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {3443#(<= 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; {3444#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:35,690 INFO L273 TraceCheckUtils]: 8: Hoare triple {3444#(<= 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; {3445#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:35,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {3445#(<= 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; {3446#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:35,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {3446#(<= 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; {3447#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:35,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {3447#(<= 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; {3448#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:35,693 INFO L273 TraceCheckUtils]: 12: Hoare triple {3448#(<= 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; {3449#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:35,694 INFO L273 TraceCheckUtils]: 13: Hoare triple {3449#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:35,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:35,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,696 INFO L273 TraceCheckUtils]: 21: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:35,696 INFO L273 TraceCheckUtils]: 23: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:35,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,697 INFO L273 TraceCheckUtils]: 25: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,697 INFO L273 TraceCheckUtils]: 27: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,697 INFO L273 TraceCheckUtils]: 28: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,698 INFO L273 TraceCheckUtils]: 31: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:35,698 INFO L273 TraceCheckUtils]: 32: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:35,698 INFO L273 TraceCheckUtils]: 33: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,698 INFO L273 TraceCheckUtils]: 34: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,698 INFO L273 TraceCheckUtils]: 35: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,698 INFO L273 TraceCheckUtils]: 36: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,698 INFO L273 TraceCheckUtils]: 37: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,699 INFO L273 TraceCheckUtils]: 38: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,699 INFO L273 TraceCheckUtils]: 39: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,699 INFO L273 TraceCheckUtils]: 40: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:35,699 INFO L273 TraceCheckUtils]: 41: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:35,699 INFO L273 TraceCheckUtils]: 42: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,699 INFO L273 TraceCheckUtils]: 43: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,699 INFO L273 TraceCheckUtils]: 44: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,700 INFO L273 TraceCheckUtils]: 46: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,700 INFO L273 TraceCheckUtils]: 47: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,700 INFO L273 TraceCheckUtils]: 48: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,700 INFO L273 TraceCheckUtils]: 49: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:35,700 INFO L273 TraceCheckUtils]: 50: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:35,700 INFO L273 TraceCheckUtils]: 51: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,700 INFO L273 TraceCheckUtils]: 52: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,700 INFO L273 TraceCheckUtils]: 53: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,701 INFO L273 TraceCheckUtils]: 54: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,701 INFO L273 TraceCheckUtils]: 55: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,701 INFO L273 TraceCheckUtils]: 56: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,701 INFO L273 TraceCheckUtils]: 57: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:35,701 INFO L273 TraceCheckUtils]: 58: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:35,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {3441#false} havoc ~x~0;~x~0 := 0; {3441#false} is VALID [2018-11-23 11:55:35,701 INFO L273 TraceCheckUtils]: 60: Hoare triple {3441#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3441#false} is VALID [2018-11-23 11:55:35,702 INFO L256 TraceCheckUtils]: 61: Hoare triple {3441#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3441#false} is VALID [2018-11-23 11:55:35,702 INFO L273 TraceCheckUtils]: 62: Hoare triple {3441#false} ~cond := #in~cond; {3441#false} is VALID [2018-11-23 11:55:35,702 INFO L273 TraceCheckUtils]: 63: Hoare triple {3441#false} assume 0 == ~cond; {3441#false} is VALID [2018-11-23 11:55:35,702 INFO L273 TraceCheckUtils]: 64: Hoare triple {3441#false} assume !false; {3441#false} is VALID [2018-11-23 11:55:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-23 11:55:35,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:35,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:35,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:35,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:36,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {3440#true} call ULTIMATE.init(); {3440#true} is VALID [2018-11-23 11:55:36,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {3440#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3440#true} is VALID [2018-11-23 11:55:36,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {3440#true} assume true; {3440#true} is VALID [2018-11-23 11:55:36,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3440#true} {3440#true} #113#return; {3440#true} is VALID [2018-11-23 11:55:36,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {3440#true} call #t~ret2 := main(); {3440#true} is VALID [2018-11-23 11:55:36,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {3440#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3468#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:36,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {3468#(<= 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; {3443#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:36,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {3443#(<= 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; {3444#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:36,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {3444#(<= 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; {3445#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:36,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {3445#(<= 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; {3446#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:36,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {3446#(<= 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; {3447#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:36,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {3447#(<= 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; {3448#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:36,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {3448#(<= 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; {3449#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:36,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {3449#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:36,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:36,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:36,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:36,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:36,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:36,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,020 INFO L273 TraceCheckUtils]: 35: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,020 INFO L273 TraceCheckUtils]: 37: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,020 INFO L273 TraceCheckUtils]: 38: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,020 INFO L273 TraceCheckUtils]: 39: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:36,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:36,021 INFO L273 TraceCheckUtils]: 42: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,021 INFO L273 TraceCheckUtils]: 43: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,021 INFO L273 TraceCheckUtils]: 44: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,021 INFO L273 TraceCheckUtils]: 45: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,022 INFO L273 TraceCheckUtils]: 47: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,022 INFO L273 TraceCheckUtils]: 48: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,022 INFO L273 TraceCheckUtils]: 49: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:36,022 INFO L273 TraceCheckUtils]: 50: Hoare triple {3441#false} ~i~0 := 0; {3441#false} is VALID [2018-11-23 11:55:36,022 INFO L273 TraceCheckUtils]: 51: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,023 INFO L273 TraceCheckUtils]: 52: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,023 INFO L273 TraceCheckUtils]: 53: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,023 INFO L273 TraceCheckUtils]: 54: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,023 INFO L273 TraceCheckUtils]: 55: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,023 INFO L273 TraceCheckUtils]: 56: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,023 INFO L273 TraceCheckUtils]: 57: Hoare triple {3441#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3441#false} is VALID [2018-11-23 11:55:36,024 INFO L273 TraceCheckUtils]: 58: Hoare triple {3441#false} assume !(~i~0 < 100000); {3441#false} is VALID [2018-11-23 11:55:36,024 INFO L273 TraceCheckUtils]: 59: Hoare triple {3441#false} havoc ~x~0;~x~0 := 0; {3441#false} is VALID [2018-11-23 11:55:36,024 INFO L273 TraceCheckUtils]: 60: Hoare triple {3441#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3441#false} is VALID [2018-11-23 11:55:36,024 INFO L256 TraceCheckUtils]: 61: Hoare triple {3441#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3441#false} is VALID [2018-11-23 11:55:36,024 INFO L273 TraceCheckUtils]: 62: Hoare triple {3441#false} ~cond := #in~cond; {3441#false} is VALID [2018-11-23 11:55:36,024 INFO L273 TraceCheckUtils]: 63: Hoare triple {3441#false} assume 0 == ~cond; {3441#false} is VALID [2018-11-23 11:55:36,025 INFO L273 TraceCheckUtils]: 64: Hoare triple {3441#false} assume !false; {3441#false} is VALID [2018-11-23 11:55:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-23 11:55:36,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:36,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:55:36,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-23 11:55:36,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:36,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:55:36,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:36,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:36,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:36,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:36,089 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 11 states. [2018-11-23 11:55:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,587 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-11-23 11:55:36,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:55:36,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-23 11:55:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2018-11-23 11:55:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2018-11-23 11:55:36,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 114 transitions. [2018-11-23 11:55:36,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:36,741 INFO L225 Difference]: With dead ends: 132 [2018-11-23 11:55:36,741 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:55:36,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:55:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 11:55:36,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:36,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,792 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,792 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,795 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-23 11:55:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 11:55:36,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,796 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,796 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,798 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-23 11:55:36,798 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 11:55:36,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:36,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:55:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-11-23 11:55:36,802 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 65 [2018-11-23 11:55:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:36,802 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-11-23 11:55:36,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-11-23 11:55:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:55:36,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:36,803 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:36,803 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:36,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash -688629930, now seen corresponding path program 8 times [2018-11-23 11:55:36,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:36,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:36,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:36,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {4170#true} call ULTIMATE.init(); {4170#true} is VALID [2018-11-23 11:55:37,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {4170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4170#true} is VALID [2018-11-23 11:55:37,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {4170#true} assume true; {4170#true} is VALID [2018-11-23 11:55:37,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4170#true} {4170#true} #113#return; {4170#true} is VALID [2018-11-23 11:55:37,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {4170#true} call #t~ret2 := main(); {4170#true} is VALID [2018-11-23 11:55:37,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {4170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4172#(= main_~i~0 0)} is VALID [2018-11-23 11:55:37,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {4172#(= 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; {4173#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:37,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {4173#(<= 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; {4174#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:37,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {4174#(<= 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; {4175#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:37,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {4175#(<= 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; {4176#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:37,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {4176#(<= 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; {4177#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:37,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {4177#(<= 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; {4178#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:37,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {4178#(<= 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; {4179#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:37,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {4179#(<= 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; {4180#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:37,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {4180#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,233 INFO L273 TraceCheckUtils]: 15: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,235 INFO L273 TraceCheckUtils]: 22: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,235 INFO L273 TraceCheckUtils]: 23: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,236 INFO L273 TraceCheckUtils]: 26: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,236 INFO L273 TraceCheckUtils]: 29: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,237 INFO L273 TraceCheckUtils]: 31: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,237 INFO L273 TraceCheckUtils]: 32: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,237 INFO L273 TraceCheckUtils]: 35: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,238 INFO L273 TraceCheckUtils]: 39: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,239 INFO L273 TraceCheckUtils]: 42: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,239 INFO L273 TraceCheckUtils]: 43: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,239 INFO L273 TraceCheckUtils]: 45: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,239 INFO L273 TraceCheckUtils]: 46: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,239 INFO L273 TraceCheckUtils]: 47: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,239 INFO L273 TraceCheckUtils]: 48: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,240 INFO L273 TraceCheckUtils]: 49: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,240 INFO L273 TraceCheckUtils]: 50: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,240 INFO L273 TraceCheckUtils]: 51: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,240 INFO L273 TraceCheckUtils]: 52: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,240 INFO L273 TraceCheckUtils]: 54: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,241 INFO L273 TraceCheckUtils]: 56: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,241 INFO L273 TraceCheckUtils]: 57: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,241 INFO L273 TraceCheckUtils]: 58: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,241 INFO L273 TraceCheckUtils]: 61: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,241 INFO L273 TraceCheckUtils]: 62: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,242 INFO L273 TraceCheckUtils]: 63: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,242 INFO L273 TraceCheckUtils]: 64: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,242 INFO L273 TraceCheckUtils]: 65: Hoare triple {4171#false} havoc ~x~0;~x~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,242 INFO L273 TraceCheckUtils]: 66: Hoare triple {4171#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4171#false} is VALID [2018-11-23 11:55:37,242 INFO L256 TraceCheckUtils]: 67: Hoare triple {4171#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4171#false} is VALID [2018-11-23 11:55:37,242 INFO L273 TraceCheckUtils]: 68: Hoare triple {4171#false} ~cond := #in~cond; {4171#false} is VALID [2018-11-23 11:55:37,242 INFO L273 TraceCheckUtils]: 69: Hoare triple {4171#false} assume 0 == ~cond; {4171#false} is VALID [2018-11-23 11:55:37,242 INFO L273 TraceCheckUtils]: 70: Hoare triple {4171#false} assume !false; {4171#false} is VALID [2018-11-23 11:55:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 11:55:37,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:37,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:37,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:37,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:37,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:37,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {4170#true} call ULTIMATE.init(); {4170#true} is VALID [2018-11-23 11:55:37,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {4170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4170#true} is VALID [2018-11-23 11:55:37,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {4170#true} assume true; {4170#true} is VALID [2018-11-23 11:55:37,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4170#true} {4170#true} #113#return; {4170#true} is VALID [2018-11-23 11:55:37,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {4170#true} call #t~ret2 := main(); {4170#true} is VALID [2018-11-23 11:55:37,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {4170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4199#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:37,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {4199#(<= 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; {4173#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:37,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {4173#(<= 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; {4174#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:37,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {4174#(<= 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; {4175#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:37,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {4175#(<= 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; {4176#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:37,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {4176#(<= 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; {4177#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:37,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {4177#(<= 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; {4178#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:37,551 INFO L273 TraceCheckUtils]: 12: Hoare triple {4178#(<= 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; {4179#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:37,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {4179#(<= 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; {4180#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:37,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {4180#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,554 INFO L273 TraceCheckUtils]: 25: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,554 INFO L273 TraceCheckUtils]: 31: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,555 INFO L273 TraceCheckUtils]: 33: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,555 INFO L273 TraceCheckUtils]: 34: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,555 INFO L273 TraceCheckUtils]: 35: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,555 INFO L273 TraceCheckUtils]: 36: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,555 INFO L273 TraceCheckUtils]: 37: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,555 INFO L273 TraceCheckUtils]: 39: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,555 INFO L273 TraceCheckUtils]: 40: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,556 INFO L273 TraceCheckUtils]: 41: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,556 INFO L273 TraceCheckUtils]: 46: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,556 INFO L273 TraceCheckUtils]: 47: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,556 INFO L273 TraceCheckUtils]: 48: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,556 INFO L273 TraceCheckUtils]: 49: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,557 INFO L273 TraceCheckUtils]: 50: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,557 INFO L273 TraceCheckUtils]: 51: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,557 INFO L273 TraceCheckUtils]: 52: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,557 INFO L273 TraceCheckUtils]: 53: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,557 INFO L273 TraceCheckUtils]: 55: Hoare triple {4171#false} ~i~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,557 INFO L273 TraceCheckUtils]: 57: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,558 INFO L273 TraceCheckUtils]: 58: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,558 INFO L273 TraceCheckUtils]: 59: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,558 INFO L273 TraceCheckUtils]: 60: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,558 INFO L273 TraceCheckUtils]: 61: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,558 INFO L273 TraceCheckUtils]: 62: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,558 INFO L273 TraceCheckUtils]: 63: Hoare triple {4171#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4171#false} is VALID [2018-11-23 11:55:37,558 INFO L273 TraceCheckUtils]: 64: Hoare triple {4171#false} assume !(~i~0 < 100000); {4171#false} is VALID [2018-11-23 11:55:37,558 INFO L273 TraceCheckUtils]: 65: Hoare triple {4171#false} havoc ~x~0;~x~0 := 0; {4171#false} is VALID [2018-11-23 11:55:37,559 INFO L273 TraceCheckUtils]: 66: Hoare triple {4171#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4171#false} is VALID [2018-11-23 11:55:37,559 INFO L256 TraceCheckUtils]: 67: Hoare triple {4171#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4171#false} is VALID [2018-11-23 11:55:37,559 INFO L273 TraceCheckUtils]: 68: Hoare triple {4171#false} ~cond := #in~cond; {4171#false} is VALID [2018-11-23 11:55:37,559 INFO L273 TraceCheckUtils]: 69: Hoare triple {4171#false} assume 0 == ~cond; {4171#false} is VALID [2018-11-23 11:55:37,559 INFO L273 TraceCheckUtils]: 70: Hoare triple {4171#false} assume !false; {4171#false} is VALID [2018-11-23 11:55:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 11:55:37,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:37,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:55:37,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 11:55:37,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:37,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:37,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:37,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:37,621 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 12 states. [2018-11-23 11:55:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,294 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-11-23 11:55:38,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:38,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 11:55:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2018-11-23 11:55:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2018-11-23 11:55:38,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 120 transitions. [2018-11-23 11:55:38,484 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 11:55:38,487 INFO L225 Difference]: With dead ends: 143 [2018-11-23 11:55:38,487 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 11:55:38,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 11:55:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 11:55:38,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:38,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 11:55:38,558 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 11:55:38,558 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 11:55:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,561 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 11:55:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 11:55:38,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:38,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:38,562 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 11:55:38,562 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 11:55:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,564 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-11-23 11:55:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 11:55:38,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:38,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:38,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:38,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:55:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-11-23 11:55:38,567 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 71 [2018-11-23 11:55:38,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:38,567 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-11-23 11:55:38,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-11-23 11:55:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:55:38,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:38,568 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:38,568 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:38,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:38,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1278280307, now seen corresponding path program 9 times [2018-11-23 11:55:38,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:38,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:38,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:38,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {4965#true} call ULTIMATE.init(); {4965#true} is VALID [2018-11-23 11:55:38,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {4965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4965#true} is VALID [2018-11-23 11:55:38,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {4965#true} assume true; {4965#true} is VALID [2018-11-23 11:55:38,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4965#true} {4965#true} #113#return; {4965#true} is VALID [2018-11-23 11:55:38,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {4965#true} call #t~ret2 := main(); {4965#true} is VALID [2018-11-23 11:55:38,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {4965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4967#(= main_~i~0 0)} is VALID [2018-11-23 11:55:38,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {4967#(= 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; {4968#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:38,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {4968#(<= 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; {4969#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:38,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {4969#(<= 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; {4970#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:38,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {4970#(<= 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; {4971#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:38,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {4971#(<= 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; {4972#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:38,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {4972#(<= 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; {4973#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:38,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {4973#(<= 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; {4974#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:38,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {4974#(<= 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; {4975#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:38,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {4975#(<= 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; {4976#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:38,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {4976#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:38,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 11:55:38,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:38,880 INFO L273 TraceCheckUtils]: 27: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 11:55:38,880 INFO L273 TraceCheckUtils]: 28: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 30: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 31: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 39: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 44: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,882 INFO L273 TraceCheckUtils]: 45: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 46: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 48: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 49: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 50: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 51: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 52: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 53: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,883 INFO L273 TraceCheckUtils]: 54: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,884 INFO L273 TraceCheckUtils]: 55: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,884 INFO L273 TraceCheckUtils]: 56: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,884 INFO L273 TraceCheckUtils]: 57: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,884 INFO L273 TraceCheckUtils]: 58: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,884 INFO L273 TraceCheckUtils]: 59: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:38,884 INFO L273 TraceCheckUtils]: 60: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 11:55:38,884 INFO L273 TraceCheckUtils]: 61: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,884 INFO L273 TraceCheckUtils]: 62: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,885 INFO L273 TraceCheckUtils]: 63: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,885 INFO L273 TraceCheckUtils]: 64: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,885 INFO L273 TraceCheckUtils]: 65: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,885 INFO L273 TraceCheckUtils]: 66: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,885 INFO L273 TraceCheckUtils]: 67: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,885 INFO L273 TraceCheckUtils]: 68: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,885 INFO L273 TraceCheckUtils]: 69: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:38,885 INFO L273 TraceCheckUtils]: 70: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:38,886 INFO L273 TraceCheckUtils]: 71: Hoare triple {4966#false} havoc ~x~0;~x~0 := 0; {4966#false} is VALID [2018-11-23 11:55:38,886 INFO L273 TraceCheckUtils]: 72: Hoare triple {4966#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4966#false} is VALID [2018-11-23 11:55:38,886 INFO L256 TraceCheckUtils]: 73: Hoare triple {4966#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4966#false} is VALID [2018-11-23 11:55:38,886 INFO L273 TraceCheckUtils]: 74: Hoare triple {4966#false} ~cond := #in~cond; {4966#false} is VALID [2018-11-23 11:55:38,886 INFO L273 TraceCheckUtils]: 75: Hoare triple {4966#false} assume 0 == ~cond; {4966#false} is VALID [2018-11-23 11:55:38,886 INFO L273 TraceCheckUtils]: 76: Hoare triple {4966#false} assume !false; {4966#false} is VALID [2018-11-23 11:55:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 11:55:38,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:38,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:38,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:50,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:55:50,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:50,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:50,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {4965#true} call ULTIMATE.init(); {4965#true} is VALID [2018-11-23 11:55:50,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {4965#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4965#true} is VALID [2018-11-23 11:55:50,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {4965#true} assume true; {4965#true} is VALID [2018-11-23 11:55:50,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4965#true} {4965#true} #113#return; {4965#true} is VALID [2018-11-23 11:55:50,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {4965#true} call #t~ret2 := main(); {4965#true} is VALID [2018-11-23 11:55:50,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {4965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4965#true} is VALID [2018-11-23 11:55:50,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5022#(<= main_~i~0 100000)} is VALID [2018-11-23 11:55:50,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {5022#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {4965#true} is VALID [2018-11-23 11:55:50,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {4965#true} ~i~0 := 0; {4965#true} is VALID [2018-11-23 11:55:50,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,943 INFO L273 TraceCheckUtils]: 19: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,943 INFO L273 TraceCheckUtils]: 20: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,944 INFO L273 TraceCheckUtils]: 21: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,944 INFO L273 TraceCheckUtils]: 25: Hoare triple {4965#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4965#true} is VALID [2018-11-23 11:55:50,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {4965#true} assume !(~i~0 < 100000); {4965#true} is VALID [2018-11-23 11:55:50,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {4965#true} ~i~0 := 0; {5062#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:50,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {5062#(<= 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; {4968#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:50,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {4968#(<= 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; {4969#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:50,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {4969#(<= 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; {4970#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:50,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {4970#(<= 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; {4971#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:50,949 INFO L273 TraceCheckUtils]: 32: Hoare triple {4971#(<= 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; {4972#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:50,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {4972#(<= 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; {4973#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:50,951 INFO L273 TraceCheckUtils]: 34: Hoare triple {4973#(<= 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; {4974#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:50,952 INFO L273 TraceCheckUtils]: 35: Hoare triple {4974#(<= 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; {4975#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:50,953 INFO L273 TraceCheckUtils]: 36: Hoare triple {4975#(<= 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; {4976#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:50,953 INFO L273 TraceCheckUtils]: 37: Hoare triple {4976#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:50,953 INFO L273 TraceCheckUtils]: 38: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 11:55:50,954 INFO L273 TraceCheckUtils]: 39: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,954 INFO L273 TraceCheckUtils]: 41: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,954 INFO L273 TraceCheckUtils]: 42: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,955 INFO L273 TraceCheckUtils]: 43: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,955 INFO L273 TraceCheckUtils]: 45: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,955 INFO L273 TraceCheckUtils]: 46: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,956 INFO L273 TraceCheckUtils]: 48: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:50,956 INFO L273 TraceCheckUtils]: 49: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 11:55:50,956 INFO L273 TraceCheckUtils]: 50: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,956 INFO L273 TraceCheckUtils]: 51: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,957 INFO L273 TraceCheckUtils]: 52: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,957 INFO L273 TraceCheckUtils]: 54: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,957 INFO L273 TraceCheckUtils]: 55: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,957 INFO L273 TraceCheckUtils]: 56: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,957 INFO L273 TraceCheckUtils]: 57: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,958 INFO L273 TraceCheckUtils]: 58: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,958 INFO L273 TraceCheckUtils]: 59: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:50,958 INFO L273 TraceCheckUtils]: 60: Hoare triple {4966#false} ~i~0 := 0; {4966#false} is VALID [2018-11-23 11:55:50,958 INFO L273 TraceCheckUtils]: 61: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,958 INFO L273 TraceCheckUtils]: 62: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 63: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 64: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 65: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 66: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 67: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 68: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 69: Hoare triple {4966#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4966#false} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 70: Hoare triple {4966#false} assume !(~i~0 < 100000); {4966#false} is VALID [2018-11-23 11:55:50,959 INFO L273 TraceCheckUtils]: 71: Hoare triple {4966#false} havoc ~x~0;~x~0 := 0; {4966#false} is VALID [2018-11-23 11:55:50,960 INFO L273 TraceCheckUtils]: 72: Hoare triple {4966#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4966#false} is VALID [2018-11-23 11:55:50,960 INFO L256 TraceCheckUtils]: 73: Hoare triple {4966#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4966#false} is VALID [2018-11-23 11:55:50,960 INFO L273 TraceCheckUtils]: 74: Hoare triple {4966#false} ~cond := #in~cond; {4966#false} is VALID [2018-11-23 11:55:50,960 INFO L273 TraceCheckUtils]: 75: Hoare triple {4966#false} assume 0 == ~cond; {4966#false} is VALID [2018-11-23 11:55:50,960 INFO L273 TraceCheckUtils]: 76: Hoare triple {4966#false} assume !false; {4966#false} is VALID [2018-11-23 11:55:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-23 11:55:50,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:50,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2018-11-23 11:55:50,990 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-23 11:55:50,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:50,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:51,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:51,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:51,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:51,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:51,042 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 14 states. [2018-11-23 11:55:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:51,649 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2018-11-23 11:55:51,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:55:51,650 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-23 11:55:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2018-11-23 11:55:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 126 transitions. [2018-11-23 11:55:51,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 126 transitions. [2018-11-23 11:55:52,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:52,367 INFO L225 Difference]: With dead ends: 154 [2018-11-23 11:55:52,367 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:55:52,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:55:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 11:55:52,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:52,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:52,431 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:52,431 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:52,433 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 11:55:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 11:55:52,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:52,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:52,433 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:52,433 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 11:55:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:52,435 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 11:55:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 11:55:52,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:52,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:52,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:52,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:55:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-11-23 11:55:52,438 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 77 [2018-11-23 11:55:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:52,438 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-11-23 11:55:52,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 11:55:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:55:52,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:52,439 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:52,439 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:52,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash -106486538, now seen corresponding path program 10 times [2018-11-23 11:55:52,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:52,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:52,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:52,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:52,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {5826#true} call ULTIMATE.init(); {5826#true} is VALID [2018-11-23 11:55:52,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {5826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5826#true} is VALID [2018-11-23 11:55:52,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {5826#true} assume true; {5826#true} is VALID [2018-11-23 11:55:52,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5826#true} {5826#true} #113#return; {5826#true} is VALID [2018-11-23 11:55:52,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {5826#true} call #t~ret2 := main(); {5826#true} is VALID [2018-11-23 11:55:52,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {5826#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5828#(= main_~i~0 0)} is VALID [2018-11-23 11:55:52,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {5828#(= 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; {5829#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:52,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {5829#(<= 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; {5830#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:52,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {5830#(<= 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; {5831#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:52,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {5831#(<= 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; {5832#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:52,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {5832#(<= 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; {5833#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:52,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {5833#(<= 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; {5834#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:52,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {5834#(<= 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; {5835#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:52,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {5835#(<= 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; {5836#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:52,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {5836#(<= 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; {5837#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:52,655 INFO L273 TraceCheckUtils]: 15: Hoare triple {5837#(<= 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; {5838#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:52,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {5838#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,656 INFO L273 TraceCheckUtils]: 18: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,656 INFO L273 TraceCheckUtils]: 20: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,657 INFO L273 TraceCheckUtils]: 21: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,657 INFO L273 TraceCheckUtils]: 23: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,657 INFO L273 TraceCheckUtils]: 24: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,658 INFO L273 TraceCheckUtils]: 28: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,659 INFO L273 TraceCheckUtils]: 31: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,659 INFO L273 TraceCheckUtils]: 33: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,659 INFO L273 TraceCheckUtils]: 34: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,659 INFO L273 TraceCheckUtils]: 35: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,660 INFO L273 TraceCheckUtils]: 36: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,660 INFO L273 TraceCheckUtils]: 37: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,660 INFO L273 TraceCheckUtils]: 39: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,660 INFO L273 TraceCheckUtils]: 40: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,660 INFO L273 TraceCheckUtils]: 42: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,660 INFO L273 TraceCheckUtils]: 43: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,661 INFO L273 TraceCheckUtils]: 44: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,661 INFO L273 TraceCheckUtils]: 45: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,661 INFO L273 TraceCheckUtils]: 46: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,661 INFO L273 TraceCheckUtils]: 47: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,661 INFO L273 TraceCheckUtils]: 48: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,661 INFO L273 TraceCheckUtils]: 50: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,661 INFO L273 TraceCheckUtils]: 51: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,662 INFO L273 TraceCheckUtils]: 52: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,662 INFO L273 TraceCheckUtils]: 53: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,662 INFO L273 TraceCheckUtils]: 54: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,662 INFO L273 TraceCheckUtils]: 55: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,662 INFO L273 TraceCheckUtils]: 56: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,662 INFO L273 TraceCheckUtils]: 57: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,662 INFO L273 TraceCheckUtils]: 58: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,662 INFO L273 TraceCheckUtils]: 59: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,662 INFO L273 TraceCheckUtils]: 60: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,663 INFO L273 TraceCheckUtils]: 61: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,663 INFO L273 TraceCheckUtils]: 62: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,663 INFO L273 TraceCheckUtils]: 63: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,663 INFO L273 TraceCheckUtils]: 64: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,663 INFO L273 TraceCheckUtils]: 66: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,663 INFO L273 TraceCheckUtils]: 67: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,663 INFO L273 TraceCheckUtils]: 68: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,664 INFO L273 TraceCheckUtils]: 69: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,664 INFO L273 TraceCheckUtils]: 70: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,664 INFO L273 TraceCheckUtils]: 71: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,664 INFO L273 TraceCheckUtils]: 72: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,664 INFO L273 TraceCheckUtils]: 73: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,664 INFO L273 TraceCheckUtils]: 74: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,664 INFO L273 TraceCheckUtils]: 75: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,664 INFO L273 TraceCheckUtils]: 76: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,664 INFO L273 TraceCheckUtils]: 77: Hoare triple {5827#false} havoc ~x~0;~x~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,665 INFO L273 TraceCheckUtils]: 78: Hoare triple {5827#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5827#false} is VALID [2018-11-23 11:55:52,665 INFO L256 TraceCheckUtils]: 79: Hoare triple {5827#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {5827#false} is VALID [2018-11-23 11:55:52,665 INFO L273 TraceCheckUtils]: 80: Hoare triple {5827#false} ~cond := #in~cond; {5827#false} is VALID [2018-11-23 11:55:52,665 INFO L273 TraceCheckUtils]: 81: Hoare triple {5827#false} assume 0 == ~cond; {5827#false} is VALID [2018-11-23 11:55:52,665 INFO L273 TraceCheckUtils]: 82: Hoare triple {5827#false} assume !false; {5827#false} is VALID [2018-11-23 11:55:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-23 11:55:52,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:52,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:52,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:52,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:52,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:52,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:52,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {5826#true} call ULTIMATE.init(); {5826#true} is VALID [2018-11-23 11:55:52,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {5826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5826#true} is VALID [2018-11-23 11:55:52,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {5826#true} assume true; {5826#true} is VALID [2018-11-23 11:55:52,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5826#true} {5826#true} #113#return; {5826#true} is VALID [2018-11-23 11:55:52,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {5826#true} call #t~ret2 := main(); {5826#true} is VALID [2018-11-23 11:55:52,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {5826#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5857#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:52,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {5857#(<= 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; {5829#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:52,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {5829#(<= 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; {5830#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:52,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {5830#(<= 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; {5831#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:52,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {5831#(<= 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; {5832#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:52,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {5832#(<= 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; {5833#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:52,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {5833#(<= 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; {5834#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:52,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {5834#(<= 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; {5835#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:52,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {5835#(<= 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; {5836#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:52,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {5836#(<= 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; {5837#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:52,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {5837#(<= 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; {5838#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:52,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {5838#(<= main_~i~0 10)} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,903 INFO L273 TraceCheckUtils]: 17: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,903 INFO L273 TraceCheckUtils]: 20: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,905 INFO L273 TraceCheckUtils]: 26: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,905 INFO L273 TraceCheckUtils]: 29: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,906 INFO L273 TraceCheckUtils]: 35: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,906 INFO L273 TraceCheckUtils]: 37: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,907 INFO L273 TraceCheckUtils]: 39: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,907 INFO L273 TraceCheckUtils]: 41: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,907 INFO L273 TraceCheckUtils]: 42: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,907 INFO L273 TraceCheckUtils]: 43: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,907 INFO L273 TraceCheckUtils]: 44: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,907 INFO L273 TraceCheckUtils]: 45: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,908 INFO L273 TraceCheckUtils]: 46: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,908 INFO L273 TraceCheckUtils]: 47: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,908 INFO L273 TraceCheckUtils]: 48: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,908 INFO L273 TraceCheckUtils]: 49: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,908 INFO L273 TraceCheckUtils]: 50: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,908 INFO L273 TraceCheckUtils]: 51: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,908 INFO L273 TraceCheckUtils]: 52: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,908 INFO L273 TraceCheckUtils]: 53: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,908 INFO L273 TraceCheckUtils]: 54: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,909 INFO L273 TraceCheckUtils]: 55: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,909 INFO L273 TraceCheckUtils]: 56: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,909 INFO L273 TraceCheckUtils]: 57: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,909 INFO L273 TraceCheckUtils]: 58: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,909 INFO L273 TraceCheckUtils]: 59: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,909 INFO L273 TraceCheckUtils]: 60: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,909 INFO L273 TraceCheckUtils]: 61: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,909 INFO L273 TraceCheckUtils]: 62: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,910 INFO L273 TraceCheckUtils]: 63: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,910 INFO L273 TraceCheckUtils]: 64: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,910 INFO L273 TraceCheckUtils]: 65: Hoare triple {5827#false} ~i~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,910 INFO L273 TraceCheckUtils]: 66: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,910 INFO L273 TraceCheckUtils]: 67: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,910 INFO L273 TraceCheckUtils]: 68: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,910 INFO L273 TraceCheckUtils]: 69: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,910 INFO L273 TraceCheckUtils]: 70: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,911 INFO L273 TraceCheckUtils]: 71: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,911 INFO L273 TraceCheckUtils]: 72: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,911 INFO L273 TraceCheckUtils]: 73: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,911 INFO L273 TraceCheckUtils]: 74: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,911 INFO L273 TraceCheckUtils]: 75: Hoare triple {5827#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5827#false} is VALID [2018-11-23 11:55:52,911 INFO L273 TraceCheckUtils]: 76: Hoare triple {5827#false} assume !(~i~0 < 100000); {5827#false} is VALID [2018-11-23 11:55:52,911 INFO L273 TraceCheckUtils]: 77: Hoare triple {5827#false} havoc ~x~0;~x~0 := 0; {5827#false} is VALID [2018-11-23 11:55:52,911 INFO L273 TraceCheckUtils]: 78: Hoare triple {5827#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5827#false} is VALID [2018-11-23 11:55:52,911 INFO L256 TraceCheckUtils]: 79: Hoare triple {5827#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {5827#false} is VALID [2018-11-23 11:55:52,912 INFO L273 TraceCheckUtils]: 80: Hoare triple {5827#false} ~cond := #in~cond; {5827#false} is VALID [2018-11-23 11:55:52,912 INFO L273 TraceCheckUtils]: 81: Hoare triple {5827#false} assume 0 == ~cond; {5827#false} is VALID [2018-11-23 11:55:52,912 INFO L273 TraceCheckUtils]: 82: Hoare triple {5827#false} assume !false; {5827#false} is VALID [2018-11-23 11:55:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-23 11:55:52,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:52,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:55:52,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2018-11-23 11:55:52,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:52,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:52,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:52,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:52,968 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 14 states. [2018-11-23 11:55:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:53,910 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-11-23 11:55:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:55:53,910 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2018-11-23 11:55:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2018-11-23 11:55:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2018-11-23 11:55:53,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 132 transitions. [2018-11-23 11:55:54,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:54,847 INFO L225 Difference]: With dead ends: 165 [2018-11-23 11:55:54,847 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 11:55:54,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 11:55:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-23 11:55:54,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:54,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 94 states. [2018-11-23 11:55:54,999 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2018-11-23 11:55:54,999 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2018-11-23 11:55:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,001 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-11-23 11:55:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-11-23 11:55:55,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,002 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2018-11-23 11:55:55,002 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2018-11-23 11:55:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:55,004 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-11-23 11:55:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-11-23 11:55:55,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:55,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:55,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:55,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 11:55:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-11-23 11:55:55,007 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 83 [2018-11-23 11:55:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:55,007 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-11-23 11:55:55,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-11-23 11:55:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 11:55:55,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:55,009 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:55:55,009 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:55,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash -391143853, now seen corresponding path program 11 times [2018-11-23 11:55:55,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:55,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:55,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {6751#true} call ULTIMATE.init(); {6751#true} is VALID [2018-11-23 11:55:55,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {6751#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6751#true} is VALID [2018-11-23 11:55:55,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {6751#true} assume true; {6751#true} is VALID [2018-11-23 11:55:55,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6751#true} {6751#true} #113#return; {6751#true} is VALID [2018-11-23 11:55:55,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {6751#true} call #t~ret2 := main(); {6751#true} is VALID [2018-11-23 11:55:55,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {6751#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6753#(= main_~i~0 0)} is VALID [2018-11-23 11:55:55,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {6753#(= 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; {6754#(<= main_~i~0 1)} is VALID [2018-11-23 11:55:55,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {6754#(<= 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; {6755#(<= main_~i~0 2)} is VALID [2018-11-23 11:55:55,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {6755#(<= 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; {6756#(<= main_~i~0 3)} is VALID [2018-11-23 11:55:55,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {6756#(<= 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; {6757#(<= main_~i~0 4)} is VALID [2018-11-23 11:55:55,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {6757#(<= 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; {6758#(<= main_~i~0 5)} is VALID [2018-11-23 11:55:55,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {6758#(<= 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; {6759#(<= main_~i~0 6)} is VALID [2018-11-23 11:55:55,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {6759#(<= 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; {6760#(<= main_~i~0 7)} is VALID [2018-11-23 11:55:55,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {6760#(<= 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; {6761#(<= main_~i~0 8)} is VALID [2018-11-23 11:55:55,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {6761#(<= 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; {6762#(<= main_~i~0 9)} is VALID [2018-11-23 11:55:55,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {6762#(<= 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; {6763#(<= main_~i~0 10)} is VALID [2018-11-23 11:55:55,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {6763#(<= 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; {6764#(<= main_~i~0 11)} is VALID [2018-11-23 11:55:55,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {6764#(<= main_~i~0 11)} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:55:55,623 INFO L273 TraceCheckUtils]: 18: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:55:55,623 INFO L273 TraceCheckUtils]: 19: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,624 INFO L273 TraceCheckUtils]: 24: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,625 INFO L273 TraceCheckUtils]: 25: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,625 INFO L273 TraceCheckUtils]: 26: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,625 INFO L273 TraceCheckUtils]: 27: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,625 INFO L273 TraceCheckUtils]: 28: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,625 INFO L273 TraceCheckUtils]: 29: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:55:55,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:55:55,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,626 INFO L273 TraceCheckUtils]: 34: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,627 INFO L273 TraceCheckUtils]: 35: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,627 INFO L273 TraceCheckUtils]: 36: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,627 INFO L273 TraceCheckUtils]: 37: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,627 INFO L273 TraceCheckUtils]: 38: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,627 INFO L273 TraceCheckUtils]: 39: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,628 INFO L273 TraceCheckUtils]: 42: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,628 INFO L273 TraceCheckUtils]: 43: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:55:55,628 INFO L273 TraceCheckUtils]: 44: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:55:55,628 INFO L273 TraceCheckUtils]: 45: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,628 INFO L273 TraceCheckUtils]: 46: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,628 INFO L273 TraceCheckUtils]: 49: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,629 INFO L273 TraceCheckUtils]: 50: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,629 INFO L273 TraceCheckUtils]: 51: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,629 INFO L273 TraceCheckUtils]: 52: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,629 INFO L273 TraceCheckUtils]: 53: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,629 INFO L273 TraceCheckUtils]: 54: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,629 INFO L273 TraceCheckUtils]: 55: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,629 INFO L273 TraceCheckUtils]: 56: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:55:55,629 INFO L273 TraceCheckUtils]: 57: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:55:55,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,630 INFO L273 TraceCheckUtils]: 59: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,630 INFO L273 TraceCheckUtils]: 60: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,630 INFO L273 TraceCheckUtils]: 61: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,630 INFO L273 TraceCheckUtils]: 62: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,630 INFO L273 TraceCheckUtils]: 63: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,630 INFO L273 TraceCheckUtils]: 64: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,630 INFO L273 TraceCheckUtils]: 65: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,630 INFO L273 TraceCheckUtils]: 66: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,631 INFO L273 TraceCheckUtils]: 67: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,631 INFO L273 TraceCheckUtils]: 68: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,631 INFO L273 TraceCheckUtils]: 69: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:55:55,631 INFO L273 TraceCheckUtils]: 70: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:55:55,631 INFO L273 TraceCheckUtils]: 71: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,631 INFO L273 TraceCheckUtils]: 72: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,631 INFO L273 TraceCheckUtils]: 73: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,631 INFO L273 TraceCheckUtils]: 74: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,631 INFO L273 TraceCheckUtils]: 75: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,632 INFO L273 TraceCheckUtils]: 76: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,632 INFO L273 TraceCheckUtils]: 77: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,632 INFO L273 TraceCheckUtils]: 78: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,632 INFO L273 TraceCheckUtils]: 79: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,632 INFO L273 TraceCheckUtils]: 80: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,632 INFO L273 TraceCheckUtils]: 81: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:55:55,632 INFO L273 TraceCheckUtils]: 82: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:55:55,632 INFO L273 TraceCheckUtils]: 83: Hoare triple {6752#false} havoc ~x~0;~x~0 := 0; {6752#false} is VALID [2018-11-23 11:55:55,633 INFO L273 TraceCheckUtils]: 84: Hoare triple {6752#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6752#false} is VALID [2018-11-23 11:55:55,633 INFO L256 TraceCheckUtils]: 85: Hoare triple {6752#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {6752#false} is VALID [2018-11-23 11:55:55,633 INFO L273 TraceCheckUtils]: 86: Hoare triple {6752#false} ~cond := #in~cond; {6752#false} is VALID [2018-11-23 11:55:55,633 INFO L273 TraceCheckUtils]: 87: Hoare triple {6752#false} assume 0 == ~cond; {6752#false} is VALID [2018-11-23 11:55:55,633 INFO L273 TraceCheckUtils]: 88: Hoare triple {6752#false} assume !false; {6752#false} is VALID [2018-11-23 11:55:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 11:55:55,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:55,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:55,645 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:56:25,757 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 11:56:25,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:25,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:25,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {6751#true} call ULTIMATE.init(); {6751#true} is VALID [2018-11-23 11:56:25,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {6751#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6751#true} is VALID [2018-11-23 11:56:25,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {6751#true} assume true; {6751#true} is VALID [2018-11-23 11:56:25,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6751#true} {6751#true} #113#return; {6751#true} is VALID [2018-11-23 11:56:25,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {6751#true} call #t~ret2 := main(); {6751#true} is VALID [2018-11-23 11:56:25,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {6751#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6783#(<= main_~i~0 0)} is VALID [2018-11-23 11:56:25,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {6783#(<= 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; {6754#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:25,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {6754#(<= 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; {6755#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:25,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {6755#(<= 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; {6756#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:25,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {6756#(<= 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; {6757#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:25,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {6757#(<= 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; {6758#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:25,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {6758#(<= 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; {6759#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:25,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {6759#(<= 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; {6760#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:25,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {6760#(<= 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; {6761#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:25,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {6761#(<= 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; {6762#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:25,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {6762#(<= 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; {6763#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:25,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {6763#(<= 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; {6764#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:25,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {6764#(<= main_~i~0 11)} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:56:25,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:56:25,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,951 INFO L273 TraceCheckUtils]: 21: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,952 INFO L273 TraceCheckUtils]: 22: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,952 INFO L273 TraceCheckUtils]: 23: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,952 INFO L273 TraceCheckUtils]: 24: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,952 INFO L273 TraceCheckUtils]: 25: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,953 INFO L273 TraceCheckUtils]: 27: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:56:25,953 INFO L273 TraceCheckUtils]: 31: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:56:25,954 INFO L273 TraceCheckUtils]: 32: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,954 INFO L273 TraceCheckUtils]: 36: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,955 INFO L273 TraceCheckUtils]: 38: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,955 INFO L273 TraceCheckUtils]: 39: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,955 INFO L273 TraceCheckUtils]: 40: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,955 INFO L273 TraceCheckUtils]: 43: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:56:25,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:56:25,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,956 INFO L273 TraceCheckUtils]: 48: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,956 INFO L273 TraceCheckUtils]: 49: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,956 INFO L273 TraceCheckUtils]: 50: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,956 INFO L273 TraceCheckUtils]: 51: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,956 INFO L273 TraceCheckUtils]: 52: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,957 INFO L273 TraceCheckUtils]: 54: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,957 INFO L273 TraceCheckUtils]: 55: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,957 INFO L273 TraceCheckUtils]: 56: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:56:25,957 INFO L273 TraceCheckUtils]: 57: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:56:25,957 INFO L273 TraceCheckUtils]: 58: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,957 INFO L273 TraceCheckUtils]: 59: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,957 INFO L273 TraceCheckUtils]: 60: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,957 INFO L273 TraceCheckUtils]: 61: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,958 INFO L273 TraceCheckUtils]: 62: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,958 INFO L273 TraceCheckUtils]: 63: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,958 INFO L273 TraceCheckUtils]: 64: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,958 INFO L273 TraceCheckUtils]: 65: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,958 INFO L273 TraceCheckUtils]: 66: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,958 INFO L273 TraceCheckUtils]: 67: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,958 INFO L273 TraceCheckUtils]: 68: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,958 INFO L273 TraceCheckUtils]: 69: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:56:25,959 INFO L273 TraceCheckUtils]: 70: Hoare triple {6752#false} ~i~0 := 0; {6752#false} is VALID [2018-11-23 11:56:25,959 INFO L273 TraceCheckUtils]: 71: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,959 INFO L273 TraceCheckUtils]: 72: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,959 INFO L273 TraceCheckUtils]: 73: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,959 INFO L273 TraceCheckUtils]: 74: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,959 INFO L273 TraceCheckUtils]: 75: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,959 INFO L273 TraceCheckUtils]: 76: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,959 INFO L273 TraceCheckUtils]: 77: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,960 INFO L273 TraceCheckUtils]: 78: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,960 INFO L273 TraceCheckUtils]: 79: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,960 INFO L273 TraceCheckUtils]: 80: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,960 INFO L273 TraceCheckUtils]: 81: Hoare triple {6752#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6752#false} is VALID [2018-11-23 11:56:25,960 INFO L273 TraceCheckUtils]: 82: Hoare triple {6752#false} assume !(~i~0 < 100000); {6752#false} is VALID [2018-11-23 11:56:25,960 INFO L273 TraceCheckUtils]: 83: Hoare triple {6752#false} havoc ~x~0;~x~0 := 0; {6752#false} is VALID [2018-11-23 11:56:25,960 INFO L273 TraceCheckUtils]: 84: Hoare triple {6752#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6752#false} is VALID [2018-11-23 11:56:25,960 INFO L256 TraceCheckUtils]: 85: Hoare triple {6752#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {6752#false} is VALID [2018-11-23 11:56:25,960 INFO L273 TraceCheckUtils]: 86: Hoare triple {6752#false} ~cond := #in~cond; {6752#false} is VALID [2018-11-23 11:56:25,961 INFO L273 TraceCheckUtils]: 87: Hoare triple {6752#false} assume 0 == ~cond; {6752#false} is VALID [2018-11-23 11:56:25,961 INFO L273 TraceCheckUtils]: 88: Hoare triple {6752#false} assume !false; {6752#false} is VALID [2018-11-23 11:56:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 11:56:25,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:25,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:56:25,998 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-11-23 11:56:25,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:25,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:56:26,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:26,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:56:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:56:26,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:56:26,036 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 15 states. [2018-11-23 11:56:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:26,776 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2018-11-23 11:56:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:56:26,776 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-11-23 11:56:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:56:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2018-11-23 11:56:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:56:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2018-11-23 11:56:26,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 138 transitions. [2018-11-23 11:56:27,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:27,369 INFO L225 Difference]: With dead ends: 176 [2018-11-23 11:56:27,370 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 11:56:27,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 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 11:56:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 11:56:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-23 11:56:27,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:27,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:27,761 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:27,762 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:27,764 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-11-23 11:56:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-11-23 11:56:27,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:27,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:27,765 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:27,765 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 11:56:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:27,768 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-11-23 11:56:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-11-23 11:56:27,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:27,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:27,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:27,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 11:56:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-11-23 11:56:27,771 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 89 [2018-11-23 11:56:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:27,772 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-11-23 11:56:27,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:56:27,772 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-11-23 11:56:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 11:56:27,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:27,773 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:56:27,773 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:27,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:27,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2080107158, now seen corresponding path program 12 times [2018-11-23 11:56:27,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:27,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:27,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:27,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:27,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:28,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {7741#true} call ULTIMATE.init(); {7741#true} is VALID [2018-11-23 11:56:28,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {7741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7741#true} is VALID [2018-11-23 11:56:28,481 INFO L273 TraceCheckUtils]: 2: Hoare triple {7741#true} assume true; {7741#true} is VALID [2018-11-23 11:56:28,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7741#true} {7741#true} #113#return; {7741#true} is VALID [2018-11-23 11:56:28,482 INFO L256 TraceCheckUtils]: 4: Hoare triple {7741#true} call #t~ret2 := main(); {7741#true} is VALID [2018-11-23 11:56:28,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {7741#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7743#(= main_~i~0 0)} is VALID [2018-11-23 11:56:28,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {7743#(= 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; {7744#(<= main_~i~0 1)} is VALID [2018-11-23 11:56:28,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {7744#(<= 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; {7745#(<= main_~i~0 2)} is VALID [2018-11-23 11:56:28,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {7745#(<= 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; {7746#(<= main_~i~0 3)} is VALID [2018-11-23 11:56:28,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {7746#(<= 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; {7747#(<= main_~i~0 4)} is VALID [2018-11-23 11:56:28,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {7747#(<= 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; {7748#(<= main_~i~0 5)} is VALID [2018-11-23 11:56:28,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {7748#(<= 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; {7749#(<= main_~i~0 6)} is VALID [2018-11-23 11:56:28,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {7749#(<= 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; {7750#(<= main_~i~0 7)} is VALID [2018-11-23 11:56:28,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {7750#(<= 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; {7751#(<= main_~i~0 8)} is VALID [2018-11-23 11:56:28,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {7751#(<= 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; {7752#(<= main_~i~0 9)} is VALID [2018-11-23 11:56:28,492 INFO L273 TraceCheckUtils]: 15: Hoare triple {7752#(<= 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; {7753#(<= main_~i~0 10)} is VALID [2018-11-23 11:56:28,493 INFO L273 TraceCheckUtils]: 16: Hoare triple {7753#(<= 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; {7754#(<= main_~i~0 11)} is VALID [2018-11-23 11:56:28,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {7754#(<= 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; {7755#(<= main_~i~0 12)} is VALID [2018-11-23 11:56:28,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {7755#(<= main_~i~0 12)} assume !(~i~0 < 100000); {7742#false} is VALID [2018-11-23 11:56:28,495 INFO L273 TraceCheckUtils]: 19: Hoare triple {7742#false} ~i~0 := 0; {7742#false} is VALID [2018-11-23 11:56:28,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,496 INFO L273 TraceCheckUtils]: 21: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,497 INFO L273 TraceCheckUtils]: 27: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,498 INFO L273 TraceCheckUtils]: 28: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,498 INFO L273 TraceCheckUtils]: 29: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,498 INFO L273 TraceCheckUtils]: 31: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,498 INFO L273 TraceCheckUtils]: 32: Hoare triple {7742#false} assume !(~i~0 < 100000); {7742#false} is VALID [2018-11-23 11:56:28,498 INFO L273 TraceCheckUtils]: 33: Hoare triple {7742#false} ~i~0 := 0; {7742#false} is VALID [2018-11-23 11:56:28,498 INFO L273 TraceCheckUtils]: 34: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,499 INFO L273 TraceCheckUtils]: 35: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,499 INFO L273 TraceCheckUtils]: 36: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,499 INFO L273 TraceCheckUtils]: 37: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,499 INFO L273 TraceCheckUtils]: 39: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,499 INFO L273 TraceCheckUtils]: 40: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,500 INFO L273 TraceCheckUtils]: 41: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,500 INFO L273 TraceCheckUtils]: 42: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,500 INFO L273 TraceCheckUtils]: 43: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,500 INFO L273 TraceCheckUtils]: 44: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,500 INFO L273 TraceCheckUtils]: 45: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {7742#false} assume !(~i~0 < 100000); {7742#false} is VALID [2018-11-23 11:56:28,500 INFO L273 TraceCheckUtils]: 47: Hoare triple {7742#false} ~i~0 := 0; {7742#false} is VALID [2018-11-23 11:56:28,501 INFO L273 TraceCheckUtils]: 48: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,501 INFO L273 TraceCheckUtils]: 49: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,501 INFO L273 TraceCheckUtils]: 50: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,501 INFO L273 TraceCheckUtils]: 51: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,501 INFO L273 TraceCheckUtils]: 52: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,501 INFO L273 TraceCheckUtils]: 53: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,501 INFO L273 TraceCheckUtils]: 54: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,502 INFO L273 TraceCheckUtils]: 55: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,502 INFO L273 TraceCheckUtils]: 56: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,502 INFO L273 TraceCheckUtils]: 57: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,502 INFO L273 TraceCheckUtils]: 58: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,502 INFO L273 TraceCheckUtils]: 59: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,502 INFO L273 TraceCheckUtils]: 60: Hoare triple {7742#false} assume !(~i~0 < 100000); {7742#false} is VALID [2018-11-23 11:56:28,503 INFO L273 TraceCheckUtils]: 61: Hoare triple {7742#false} ~i~0 := 0; {7742#false} is VALID [2018-11-23 11:56:28,503 INFO L273 TraceCheckUtils]: 62: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,503 INFO L273 TraceCheckUtils]: 63: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,503 INFO L273 TraceCheckUtils]: 64: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,503 INFO L273 TraceCheckUtils]: 65: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,503 INFO L273 TraceCheckUtils]: 66: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,503 INFO L273 TraceCheckUtils]: 67: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,504 INFO L273 TraceCheckUtils]: 68: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,504 INFO L273 TraceCheckUtils]: 69: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,504 INFO L273 TraceCheckUtils]: 70: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,504 INFO L273 TraceCheckUtils]: 71: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,504 INFO L273 TraceCheckUtils]: 72: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,504 INFO L273 TraceCheckUtils]: 73: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,504 INFO L273 TraceCheckUtils]: 74: Hoare triple {7742#false} assume !(~i~0 < 100000); {7742#false} is VALID [2018-11-23 11:56:28,505 INFO L273 TraceCheckUtils]: 75: Hoare triple {7742#false} ~i~0 := 0; {7742#false} is VALID [2018-11-23 11:56:28,505 INFO L273 TraceCheckUtils]: 76: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,505 INFO L273 TraceCheckUtils]: 77: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,505 INFO L273 TraceCheckUtils]: 78: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,505 INFO L273 TraceCheckUtils]: 79: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,505 INFO L273 TraceCheckUtils]: 80: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,506 INFO L273 TraceCheckUtils]: 81: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,506 INFO L273 TraceCheckUtils]: 82: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,506 INFO L273 TraceCheckUtils]: 83: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,506 INFO L273 TraceCheckUtils]: 84: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,506 INFO L273 TraceCheckUtils]: 85: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,506 INFO L273 TraceCheckUtils]: 86: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,506 INFO L273 TraceCheckUtils]: 87: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:56:28,507 INFO L273 TraceCheckUtils]: 88: Hoare triple {7742#false} assume !(~i~0 < 100000); {7742#false} is VALID [2018-11-23 11:56:28,507 INFO L273 TraceCheckUtils]: 89: Hoare triple {7742#false} havoc ~x~0;~x~0 := 0; {7742#false} is VALID [2018-11-23 11:56:28,507 INFO L273 TraceCheckUtils]: 90: Hoare triple {7742#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7742#false} is VALID [2018-11-23 11:56:28,507 INFO L256 TraceCheckUtils]: 91: Hoare triple {7742#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {7742#false} is VALID [2018-11-23 11:56:28,507 INFO L273 TraceCheckUtils]: 92: Hoare triple {7742#false} ~cond := #in~cond; {7742#false} is VALID [2018-11-23 11:56:28,507 INFO L273 TraceCheckUtils]: 93: Hoare triple {7742#false} assume 0 == ~cond; {7742#false} is VALID [2018-11-23 11:56:28,508 INFO L273 TraceCheckUtils]: 94: Hoare triple {7742#false} assume !false; {7742#false} is VALID [2018-11-23 11:56:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2018-11-23 11:56:28,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:28,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:28,526 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:57:05,575 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:57:05,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:05,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:05,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {7741#true} call ULTIMATE.init(); {7741#true} is VALID [2018-11-23 11:57:05,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {7741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7741#true} is VALID [2018-11-23 11:57:05,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {7741#true} assume true; {7741#true} is VALID [2018-11-23 11:57:05,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7741#true} {7741#true} #113#return; {7741#true} is VALID [2018-11-23 11:57:05,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {7741#true} call #t~ret2 := main(); {7741#true} is VALID [2018-11-23 11:57:05,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {7741#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7741#true} is VALID [2018-11-23 11:57:05,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7810#(<= main_~i~0 100000)} is VALID [2018-11-23 11:57:05,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {7741#true} is VALID [2018-11-23 11:57:05,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {7741#true} ~i~0 := 0; {7741#true} is VALID [2018-11-23 11:57:05,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,862 INFO L273 TraceCheckUtils]: 26: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,862 INFO L273 TraceCheckUtils]: 27: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,863 INFO L273 TraceCheckUtils]: 31: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7810#(<= main_~i~0 100000)} is VALID [2018-11-23 11:57:05,864 INFO L273 TraceCheckUtils]: 32: Hoare triple {7810#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {7741#true} is VALID [2018-11-23 11:57:05,864 INFO L273 TraceCheckUtils]: 33: Hoare triple {7741#true} ~i~0 := 0; {7741#true} is VALID [2018-11-23 11:57:05,864 INFO L273 TraceCheckUtils]: 34: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,864 INFO L273 TraceCheckUtils]: 35: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,864 INFO L273 TraceCheckUtils]: 36: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,864 INFO L273 TraceCheckUtils]: 37: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,864 INFO L273 TraceCheckUtils]: 38: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,864 INFO L273 TraceCheckUtils]: 39: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,864 INFO L273 TraceCheckUtils]: 40: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,865 INFO L273 TraceCheckUtils]: 41: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,865 INFO L273 TraceCheckUtils]: 42: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,865 INFO L273 TraceCheckUtils]: 43: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,865 INFO L273 TraceCheckUtils]: 44: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,865 INFO L273 TraceCheckUtils]: 45: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,865 INFO L273 TraceCheckUtils]: 46: Hoare triple {7741#true} assume !(~i~0 < 100000); {7741#true} is VALID [2018-11-23 11:57:05,865 INFO L273 TraceCheckUtils]: 47: Hoare triple {7741#true} ~i~0 := 0; {7741#true} is VALID [2018-11-23 11:57:05,865 INFO L273 TraceCheckUtils]: 48: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,866 INFO L273 TraceCheckUtils]: 49: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,866 INFO L273 TraceCheckUtils]: 50: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,866 INFO L273 TraceCheckUtils]: 51: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,866 INFO L273 TraceCheckUtils]: 52: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,866 INFO L273 TraceCheckUtils]: 53: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,866 INFO L273 TraceCheckUtils]: 54: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,867 INFO L273 TraceCheckUtils]: 55: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,867 INFO L273 TraceCheckUtils]: 56: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,867 INFO L273 TraceCheckUtils]: 57: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,867 INFO L273 TraceCheckUtils]: 58: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,867 INFO L273 TraceCheckUtils]: 59: Hoare triple {7741#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7741#true} is VALID [2018-11-23 11:57:05,868 INFO L273 TraceCheckUtils]: 60: Hoare triple {7741#true} assume !(~i~0 < 100000); {7741#true} is VALID [2018-11-23 11:57:05,868 INFO L273 TraceCheckUtils]: 61: Hoare triple {7741#true} ~i~0 := 0; {7943#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:05,869 INFO L273 TraceCheckUtils]: 62: Hoare triple {7943#(<= 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; {7744#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:05,869 INFO L273 TraceCheckUtils]: 63: Hoare triple {7744#(<= 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; {7745#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:05,870 INFO L273 TraceCheckUtils]: 64: Hoare triple {7745#(<= 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; {7746#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:05,871 INFO L273 TraceCheckUtils]: 65: Hoare triple {7746#(<= 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; {7747#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:05,871 INFO L273 TraceCheckUtils]: 66: Hoare triple {7747#(<= 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; {7748#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:05,872 INFO L273 TraceCheckUtils]: 67: Hoare triple {7748#(<= 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; {7749#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:05,872 INFO L273 TraceCheckUtils]: 68: Hoare triple {7749#(<= 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; {7750#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:05,873 INFO L273 TraceCheckUtils]: 69: Hoare triple {7750#(<= 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; {7751#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:05,874 INFO L273 TraceCheckUtils]: 70: Hoare triple {7751#(<= 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; {7752#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:05,875 INFO L273 TraceCheckUtils]: 71: Hoare triple {7752#(<= 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; {7753#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:05,876 INFO L273 TraceCheckUtils]: 72: Hoare triple {7753#(<= 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; {7754#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:05,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {7754#(<= 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; {7755#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:05,877 INFO L273 TraceCheckUtils]: 74: Hoare triple {7755#(<= main_~i~0 12)} assume !(~i~0 < 100000); {7742#false} is VALID [2018-11-23 11:57:05,878 INFO L273 TraceCheckUtils]: 75: Hoare triple {7742#false} ~i~0 := 0; {7742#false} is VALID [2018-11-23 11:57:05,878 INFO L273 TraceCheckUtils]: 76: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,878 INFO L273 TraceCheckUtils]: 77: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,878 INFO L273 TraceCheckUtils]: 78: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,878 INFO L273 TraceCheckUtils]: 79: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,879 INFO L273 TraceCheckUtils]: 80: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,879 INFO L273 TraceCheckUtils]: 81: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,879 INFO L273 TraceCheckUtils]: 82: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,879 INFO L273 TraceCheckUtils]: 83: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,880 INFO L273 TraceCheckUtils]: 84: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,880 INFO L273 TraceCheckUtils]: 85: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,880 INFO L273 TraceCheckUtils]: 86: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,880 INFO L273 TraceCheckUtils]: 87: Hoare triple {7742#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7742#false} is VALID [2018-11-23 11:57:05,880 INFO L273 TraceCheckUtils]: 88: Hoare triple {7742#false} assume !(~i~0 < 100000); {7742#false} is VALID [2018-11-23 11:57:05,881 INFO L273 TraceCheckUtils]: 89: Hoare triple {7742#false} havoc ~x~0;~x~0 := 0; {7742#false} is VALID [2018-11-23 11:57:05,881 INFO L273 TraceCheckUtils]: 90: Hoare triple {7742#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7742#false} is VALID [2018-11-23 11:57:05,881 INFO L256 TraceCheckUtils]: 91: Hoare triple {7742#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {7742#false} is VALID [2018-11-23 11:57:05,881 INFO L273 TraceCheckUtils]: 92: Hoare triple {7742#false} ~cond := #in~cond; {7742#false} is VALID [2018-11-23 11:57:05,881 INFO L273 TraceCheckUtils]: 93: Hoare triple {7742#false} assume 0 == ~cond; {7742#false} is VALID [2018-11-23 11:57:05,881 INFO L273 TraceCheckUtils]: 94: Hoare triple {7742#false} assume !false; {7742#false} is VALID [2018-11-23 11:57:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-23 11:57:05,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:05,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-23 11:57:05,915 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2018-11-23 11:57:05,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:05,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:57:05,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:05,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:57:05,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:57:05,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:57:05,984 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 17 states. [2018-11-23 11:57:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:07,184 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2018-11-23 11:57:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:57:07,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2018-11-23 11:57:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 144 transitions. [2018-11-23 11:57:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 144 transitions. [2018-11-23 11:57:07,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 144 transitions. [2018-11-23 11:57:07,919 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 11:57:07,921 INFO L225 Difference]: With dead ends: 187 [2018-11-23 11:57:07,921 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 11:57:07,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:57:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 11:57:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 11:57:08,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:08,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:08,006 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:08,006 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:08,009 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-11-23 11:57:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-11-23 11:57:08,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:08,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:08,010 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:08,010 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 11:57:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:08,013 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-11-23 11:57:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-11-23 11:57:08,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:08,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:08,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:08,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 11:57:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-11-23 11:57:08,016 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 95 [2018-11-23 11:57:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:08,016 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-11-23 11:57:08,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:57:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-11-23 11:57:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 11:57:08,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:08,018 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:57:08,018 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:08,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash -332398029, now seen corresponding path program 13 times [2018-11-23 11:57:08,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:08,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:08,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:08,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:09,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {8797#true} call ULTIMATE.init(); {8797#true} is VALID [2018-11-23 11:57:09,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {8797#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8797#true} is VALID [2018-11-23 11:57:09,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {8797#true} assume true; {8797#true} is VALID [2018-11-23 11:57:09,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8797#true} {8797#true} #113#return; {8797#true} is VALID [2018-11-23 11:57:09,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {8797#true} call #t~ret2 := main(); {8797#true} is VALID [2018-11-23 11:57:09,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {8797#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8799#(= main_~i~0 0)} is VALID [2018-11-23 11:57:09,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {8799#(= 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; {8800#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:09,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {8800#(<= 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; {8801#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:09,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {8801#(<= 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; {8802#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:09,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {8802#(<= 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; {8803#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:09,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {8803#(<= 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; {8804#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:09,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {8804#(<= 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; {8805#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:09,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {8805#(<= 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; {8806#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:09,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {8806#(<= 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; {8807#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:09,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {8807#(<= 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; {8808#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:09,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {8808#(<= 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; {8809#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:09,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {8809#(<= 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; {8810#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:09,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {8810#(<= 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; {8811#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:09,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {8811#(<= 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; {8812#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:09,743 INFO L273 TraceCheckUtils]: 19: Hoare triple {8812#(<= main_~i~0 13)} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:09,744 INFO L273 TraceCheckUtils]: 20: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:09,744 INFO L273 TraceCheckUtils]: 21: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,744 INFO L273 TraceCheckUtils]: 22: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,744 INFO L273 TraceCheckUtils]: 23: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,745 INFO L273 TraceCheckUtils]: 25: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,745 INFO L273 TraceCheckUtils]: 26: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,746 INFO L273 TraceCheckUtils]: 31: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,746 INFO L273 TraceCheckUtils]: 32: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,746 INFO L273 TraceCheckUtils]: 34: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:09,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:09,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,747 INFO L273 TraceCheckUtils]: 38: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,747 INFO L273 TraceCheckUtils]: 39: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,747 INFO L273 TraceCheckUtils]: 40: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,747 INFO L273 TraceCheckUtils]: 41: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,747 INFO L273 TraceCheckUtils]: 42: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,748 INFO L273 TraceCheckUtils]: 43: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,748 INFO L273 TraceCheckUtils]: 45: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,748 INFO L273 TraceCheckUtils]: 46: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,748 INFO L273 TraceCheckUtils]: 47: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,748 INFO L273 TraceCheckUtils]: 48: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,748 INFO L273 TraceCheckUtils]: 49: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:09,748 INFO L273 TraceCheckUtils]: 50: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:09,748 INFO L273 TraceCheckUtils]: 51: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,749 INFO L273 TraceCheckUtils]: 52: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,749 INFO L273 TraceCheckUtils]: 53: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,749 INFO L273 TraceCheckUtils]: 54: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,749 INFO L273 TraceCheckUtils]: 55: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,749 INFO L273 TraceCheckUtils]: 56: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,749 INFO L273 TraceCheckUtils]: 57: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,749 INFO L273 TraceCheckUtils]: 58: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,749 INFO L273 TraceCheckUtils]: 59: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,750 INFO L273 TraceCheckUtils]: 60: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,750 INFO L273 TraceCheckUtils]: 61: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,750 INFO L273 TraceCheckUtils]: 62: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,750 INFO L273 TraceCheckUtils]: 63: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:09,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:09,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,750 INFO L273 TraceCheckUtils]: 67: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,750 INFO L273 TraceCheckUtils]: 68: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,751 INFO L273 TraceCheckUtils]: 69: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,751 INFO L273 TraceCheckUtils]: 70: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,751 INFO L273 TraceCheckUtils]: 71: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,751 INFO L273 TraceCheckUtils]: 72: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,751 INFO L273 TraceCheckUtils]: 74: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,751 INFO L273 TraceCheckUtils]: 75: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,752 INFO L273 TraceCheckUtils]: 77: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,752 INFO L273 TraceCheckUtils]: 78: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,752 INFO L273 TraceCheckUtils]: 79: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:09,752 INFO L273 TraceCheckUtils]: 80: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:09,752 INFO L273 TraceCheckUtils]: 81: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,752 INFO L273 TraceCheckUtils]: 82: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,752 INFO L273 TraceCheckUtils]: 83: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,752 INFO L273 TraceCheckUtils]: 84: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,752 INFO L273 TraceCheckUtils]: 85: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,753 INFO L273 TraceCheckUtils]: 86: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,753 INFO L273 TraceCheckUtils]: 87: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,753 INFO L273 TraceCheckUtils]: 88: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,753 INFO L273 TraceCheckUtils]: 89: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,753 INFO L273 TraceCheckUtils]: 90: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,753 INFO L273 TraceCheckUtils]: 91: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,753 INFO L273 TraceCheckUtils]: 92: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,753 INFO L273 TraceCheckUtils]: 93: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:09,754 INFO L273 TraceCheckUtils]: 94: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:09,754 INFO L273 TraceCheckUtils]: 95: Hoare triple {8798#false} havoc ~x~0;~x~0 := 0; {8798#false} is VALID [2018-11-23 11:57:09,754 INFO L273 TraceCheckUtils]: 96: Hoare triple {8798#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8798#false} is VALID [2018-11-23 11:57:09,754 INFO L256 TraceCheckUtils]: 97: Hoare triple {8798#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {8798#false} is VALID [2018-11-23 11:57:09,754 INFO L273 TraceCheckUtils]: 98: Hoare triple {8798#false} ~cond := #in~cond; {8798#false} is VALID [2018-11-23 11:57:09,754 INFO L273 TraceCheckUtils]: 99: Hoare triple {8798#false} assume 0 == ~cond; {8798#false} is VALID [2018-11-23 11:57:09,754 INFO L273 TraceCheckUtils]: 100: Hoare triple {8798#false} assume !false; {8798#false} is VALID [2018-11-23 11:57:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2018-11-23 11:57:09,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:09,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:09,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:09,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:10,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {8797#true} call ULTIMATE.init(); {8797#true} is VALID [2018-11-23 11:57:10,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {8797#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8797#true} is VALID [2018-11-23 11:57:10,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {8797#true} assume true; {8797#true} is VALID [2018-11-23 11:57:10,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8797#true} {8797#true} #113#return; {8797#true} is VALID [2018-11-23 11:57:10,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {8797#true} call #t~ret2 := main(); {8797#true} is VALID [2018-11-23 11:57:10,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {8797#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8831#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:10,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {8831#(<= 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; {8800#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:10,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {8800#(<= 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; {8801#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:10,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {8801#(<= 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; {8802#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:10,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {8802#(<= 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; {8803#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:10,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {8803#(<= 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; {8804#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:10,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {8804#(<= 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; {8805#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:10,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {8805#(<= 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; {8806#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:10,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {8806#(<= 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; {8807#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:10,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {8807#(<= 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; {8808#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:10,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {8808#(<= 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; {8809#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:10,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {8809#(<= 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; {8810#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:10,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {8810#(<= 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; {8811#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:10,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {8811#(<= 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; {8812#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:10,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {8812#(<= main_~i~0 13)} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:10,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:10,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,099 INFO L273 TraceCheckUtils]: 26: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,100 INFO L273 TraceCheckUtils]: 29: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,100 INFO L273 TraceCheckUtils]: 30: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,100 INFO L273 TraceCheckUtils]: 31: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,101 INFO L273 TraceCheckUtils]: 34: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:10,101 INFO L273 TraceCheckUtils]: 35: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:10,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,102 INFO L273 TraceCheckUtils]: 37: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,102 INFO L273 TraceCheckUtils]: 39: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,102 INFO L273 TraceCheckUtils]: 41: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,103 INFO L273 TraceCheckUtils]: 42: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,103 INFO L273 TraceCheckUtils]: 43: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,103 INFO L273 TraceCheckUtils]: 44: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,103 INFO L273 TraceCheckUtils]: 45: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,103 INFO L273 TraceCheckUtils]: 46: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,103 INFO L273 TraceCheckUtils]: 47: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,104 INFO L273 TraceCheckUtils]: 49: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:10,104 INFO L273 TraceCheckUtils]: 50: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:10,104 INFO L273 TraceCheckUtils]: 51: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,104 INFO L273 TraceCheckUtils]: 52: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,104 INFO L273 TraceCheckUtils]: 53: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,104 INFO L273 TraceCheckUtils]: 56: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,104 INFO L273 TraceCheckUtils]: 57: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,105 INFO L273 TraceCheckUtils]: 58: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,105 INFO L273 TraceCheckUtils]: 59: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,105 INFO L273 TraceCheckUtils]: 60: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,105 INFO L273 TraceCheckUtils]: 61: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,105 INFO L273 TraceCheckUtils]: 62: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,105 INFO L273 TraceCheckUtils]: 63: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,105 INFO L273 TraceCheckUtils]: 64: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:10,106 INFO L273 TraceCheckUtils]: 65: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:10,106 INFO L273 TraceCheckUtils]: 66: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,106 INFO L273 TraceCheckUtils]: 67: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,106 INFO L273 TraceCheckUtils]: 68: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,106 INFO L273 TraceCheckUtils]: 69: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,106 INFO L273 TraceCheckUtils]: 70: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,107 INFO L273 TraceCheckUtils]: 71: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,107 INFO L273 TraceCheckUtils]: 72: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,107 INFO L273 TraceCheckUtils]: 73: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,107 INFO L273 TraceCheckUtils]: 74: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,107 INFO L273 TraceCheckUtils]: 75: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,107 INFO L273 TraceCheckUtils]: 76: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,108 INFO L273 TraceCheckUtils]: 77: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,108 INFO L273 TraceCheckUtils]: 78: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,108 INFO L273 TraceCheckUtils]: 79: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:10,108 INFO L273 TraceCheckUtils]: 80: Hoare triple {8798#false} ~i~0 := 0; {8798#false} is VALID [2018-11-23 11:57:10,108 INFO L273 TraceCheckUtils]: 81: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,108 INFO L273 TraceCheckUtils]: 82: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,109 INFO L273 TraceCheckUtils]: 83: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,109 INFO L273 TraceCheckUtils]: 84: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,109 INFO L273 TraceCheckUtils]: 85: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,109 INFO L273 TraceCheckUtils]: 86: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,109 INFO L273 TraceCheckUtils]: 87: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,109 INFO L273 TraceCheckUtils]: 88: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,110 INFO L273 TraceCheckUtils]: 89: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,110 INFO L273 TraceCheckUtils]: 90: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,110 INFO L273 TraceCheckUtils]: 91: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,110 INFO L273 TraceCheckUtils]: 92: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,110 INFO L273 TraceCheckUtils]: 93: Hoare triple {8798#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8798#false} is VALID [2018-11-23 11:57:10,110 INFO L273 TraceCheckUtils]: 94: Hoare triple {8798#false} assume !(~i~0 < 100000); {8798#false} is VALID [2018-11-23 11:57:10,111 INFO L273 TraceCheckUtils]: 95: Hoare triple {8798#false} havoc ~x~0;~x~0 := 0; {8798#false} is VALID [2018-11-23 11:57:10,111 INFO L273 TraceCheckUtils]: 96: Hoare triple {8798#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8798#false} is VALID [2018-11-23 11:57:10,111 INFO L256 TraceCheckUtils]: 97: Hoare triple {8798#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {8798#false} is VALID [2018-11-23 11:57:10,111 INFO L273 TraceCheckUtils]: 98: Hoare triple {8798#false} ~cond := #in~cond; {8798#false} is VALID [2018-11-23 11:57:10,111 INFO L273 TraceCheckUtils]: 99: Hoare triple {8798#false} assume 0 == ~cond; {8798#false} is VALID [2018-11-23 11:57:10,111 INFO L273 TraceCheckUtils]: 100: Hoare triple {8798#false} assume !false; {8798#false} is VALID [2018-11-23 11:57:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2018-11-23 11:57:10,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:10,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:57:10,138 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2018-11-23 11:57:10,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:10,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:57:10,192 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:10,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:57:10,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:57:10,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:57:10,193 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 17 states. [2018-11-23 11:57:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:11,119 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-11-23 11:57:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:57:11,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2018-11-23 11:57:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 150 transitions. [2018-11-23 11:57:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:57:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 150 transitions. [2018-11-23 11:57:11,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 150 transitions. [2018-11-23 11:57:11,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:11,697 INFO L225 Difference]: With dead ends: 198 [2018-11-23 11:57:11,697 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 11:57:11,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:57:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 11:57:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 11:57:11,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:11,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2018-11-23 11:57:11,826 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 11:57:11,826 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 11:57:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:11,829 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-23 11:57:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 11:57:11,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:11,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:11,829 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 11:57:11,830 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 11:57:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:11,832 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-11-23 11:57:11,832 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 11:57:11,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:11,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:11,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:11,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 11:57:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-11-23 11:57:11,836 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 101 [2018-11-23 11:57:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:11,836 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-11-23 11:57:11,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:57:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-11-23 11:57:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 11:57:11,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:11,837 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:57:11,838 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:11,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash -904878026, now seen corresponding path program 14 times [2018-11-23 11:57:11,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:11,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:11,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:11,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:11,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:12,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {9917#true} call ULTIMATE.init(); {9917#true} is VALID [2018-11-23 11:57:12,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {9917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9917#true} is VALID [2018-11-23 11:57:12,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {9917#true} assume true; {9917#true} is VALID [2018-11-23 11:57:12,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9917#true} {9917#true} #113#return; {9917#true} is VALID [2018-11-23 11:57:12,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {9917#true} call #t~ret2 := main(); {9917#true} is VALID [2018-11-23 11:57:12,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {9917#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9919#(= main_~i~0 0)} is VALID [2018-11-23 11:57:12,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {9919#(= 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; {9920#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:12,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {9920#(<= 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; {9921#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:12,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {9921#(<= 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; {9922#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:12,629 INFO L273 TraceCheckUtils]: 9: Hoare triple {9922#(<= 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; {9923#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:12,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {9923#(<= 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; {9924#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:12,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {9924#(<= 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; {9925#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:12,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {9925#(<= 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; {9926#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:12,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {9926#(<= 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; {9927#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:12,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {9927#(<= 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; {9928#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:12,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {9928#(<= 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; {9929#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:12,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {9929#(<= 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; {9930#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:12,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {9930#(<= 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; {9931#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:12,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {9931#(<= 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; {9932#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:12,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {9932#(<= 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; {9933#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:12,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {9933#(<= main_~i~0 14)} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:12,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:12,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,639 INFO L273 TraceCheckUtils]: 23: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,640 INFO L273 TraceCheckUtils]: 24: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,640 INFO L273 TraceCheckUtils]: 27: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,641 INFO L273 TraceCheckUtils]: 32: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,641 INFO L273 TraceCheckUtils]: 33: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,641 INFO L273 TraceCheckUtils]: 34: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:12,642 INFO L273 TraceCheckUtils]: 37: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:12,642 INFO L273 TraceCheckUtils]: 38: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,642 INFO L273 TraceCheckUtils]: 39: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,643 INFO L273 TraceCheckUtils]: 43: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,643 INFO L273 TraceCheckUtils]: 44: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,643 INFO L273 TraceCheckUtils]: 46: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,644 INFO L273 TraceCheckUtils]: 48: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,644 INFO L273 TraceCheckUtils]: 49: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,644 INFO L273 TraceCheckUtils]: 50: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,644 INFO L273 TraceCheckUtils]: 51: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,644 INFO L273 TraceCheckUtils]: 52: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:12,644 INFO L273 TraceCheckUtils]: 53: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:12,644 INFO L273 TraceCheckUtils]: 54: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,644 INFO L273 TraceCheckUtils]: 55: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,645 INFO L273 TraceCheckUtils]: 56: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,645 INFO L273 TraceCheckUtils]: 57: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,645 INFO L273 TraceCheckUtils]: 58: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,645 INFO L273 TraceCheckUtils]: 59: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,645 INFO L273 TraceCheckUtils]: 60: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,645 INFO L273 TraceCheckUtils]: 61: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,645 INFO L273 TraceCheckUtils]: 62: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,645 INFO L273 TraceCheckUtils]: 63: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,646 INFO L273 TraceCheckUtils]: 65: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,646 INFO L273 TraceCheckUtils]: 66: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,646 INFO L273 TraceCheckUtils]: 67: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,646 INFO L273 TraceCheckUtils]: 68: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:12,646 INFO L273 TraceCheckUtils]: 69: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:12,646 INFO L273 TraceCheckUtils]: 70: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,646 INFO L273 TraceCheckUtils]: 71: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,646 INFO L273 TraceCheckUtils]: 72: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,647 INFO L273 TraceCheckUtils]: 73: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,647 INFO L273 TraceCheckUtils]: 74: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,647 INFO L273 TraceCheckUtils]: 75: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,647 INFO L273 TraceCheckUtils]: 76: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,647 INFO L273 TraceCheckUtils]: 77: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,647 INFO L273 TraceCheckUtils]: 78: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,647 INFO L273 TraceCheckUtils]: 79: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,647 INFO L273 TraceCheckUtils]: 80: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,647 INFO L273 TraceCheckUtils]: 81: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,648 INFO L273 TraceCheckUtils]: 82: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,648 INFO L273 TraceCheckUtils]: 83: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,648 INFO L273 TraceCheckUtils]: 84: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:12,648 INFO L273 TraceCheckUtils]: 85: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:12,648 INFO L273 TraceCheckUtils]: 86: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,648 INFO L273 TraceCheckUtils]: 87: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,648 INFO L273 TraceCheckUtils]: 88: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,648 INFO L273 TraceCheckUtils]: 89: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,649 INFO L273 TraceCheckUtils]: 90: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,649 INFO L273 TraceCheckUtils]: 91: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,649 INFO L273 TraceCheckUtils]: 92: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,649 INFO L273 TraceCheckUtils]: 93: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,649 INFO L273 TraceCheckUtils]: 94: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,649 INFO L273 TraceCheckUtils]: 95: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,649 INFO L273 TraceCheckUtils]: 96: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,649 INFO L273 TraceCheckUtils]: 97: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,650 INFO L273 TraceCheckUtils]: 98: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,650 INFO L273 TraceCheckUtils]: 99: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:12,650 INFO L273 TraceCheckUtils]: 100: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:12,650 INFO L273 TraceCheckUtils]: 101: Hoare triple {9918#false} havoc ~x~0;~x~0 := 0; {9918#false} is VALID [2018-11-23 11:57:12,650 INFO L273 TraceCheckUtils]: 102: Hoare triple {9918#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9918#false} is VALID [2018-11-23 11:57:12,650 INFO L256 TraceCheckUtils]: 103: Hoare triple {9918#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {9918#false} is VALID [2018-11-23 11:57:12,650 INFO L273 TraceCheckUtils]: 104: Hoare triple {9918#false} ~cond := #in~cond; {9918#false} is VALID [2018-11-23 11:57:12,650 INFO L273 TraceCheckUtils]: 105: Hoare triple {9918#false} assume 0 == ~cond; {9918#false} is VALID [2018-11-23 11:57:12,650 INFO L273 TraceCheckUtils]: 106: Hoare triple {9918#false} assume !false; {9918#false} is VALID [2018-11-23 11:57:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-11-23 11:57:12,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:12,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:12,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:57:12,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:57:12,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:12,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:12,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {9917#true} call ULTIMATE.init(); {9917#true} is VALID [2018-11-23 11:57:12,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {9917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9917#true} is VALID [2018-11-23 11:57:12,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {9917#true} assume true; {9917#true} is VALID [2018-11-23 11:57:12,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9917#true} {9917#true} #113#return; {9917#true} is VALID [2018-11-23 11:57:12,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {9917#true} call #t~ret2 := main(); {9917#true} is VALID [2018-11-23 11:57:12,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {9917#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9952#(<= main_~i~0 0)} is VALID [2018-11-23 11:57:12,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {9952#(<= 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; {9920#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:12,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {9920#(<= 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; {9921#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:12,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {9921#(<= 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; {9922#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:12,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {9922#(<= 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; {9923#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:12,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {9923#(<= 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; {9924#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:12,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {9924#(<= 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; {9925#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:13,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {9925#(<= 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; {9926#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:13,001 INFO L273 TraceCheckUtils]: 13: Hoare triple {9926#(<= 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; {9927#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:13,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {9927#(<= 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; {9928#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:13,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {9928#(<= 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; {9929#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:13,004 INFO L273 TraceCheckUtils]: 16: Hoare triple {9929#(<= 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; {9930#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:13,005 INFO L273 TraceCheckUtils]: 17: Hoare triple {9930#(<= 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; {9931#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:13,005 INFO L273 TraceCheckUtils]: 18: Hoare triple {9931#(<= 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; {9932#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:13,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {9932#(<= 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; {9933#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:13,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {9933#(<= main_~i~0 14)} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:13,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:13,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,008 INFO L273 TraceCheckUtils]: 23: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,008 INFO L273 TraceCheckUtils]: 26: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,009 INFO L273 TraceCheckUtils]: 31: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,010 INFO L273 TraceCheckUtils]: 35: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,010 INFO L273 TraceCheckUtils]: 36: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:13,010 INFO L273 TraceCheckUtils]: 37: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:13,010 INFO L273 TraceCheckUtils]: 38: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,010 INFO L273 TraceCheckUtils]: 39: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,011 INFO L273 TraceCheckUtils]: 44: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,011 INFO L273 TraceCheckUtils]: 45: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,011 INFO L273 TraceCheckUtils]: 46: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,011 INFO L273 TraceCheckUtils]: 47: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,011 INFO L273 TraceCheckUtils]: 48: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,011 INFO L273 TraceCheckUtils]: 49: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,012 INFO L273 TraceCheckUtils]: 50: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,012 INFO L273 TraceCheckUtils]: 51: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,012 INFO L273 TraceCheckUtils]: 52: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:13,012 INFO L273 TraceCheckUtils]: 53: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:13,012 INFO L273 TraceCheckUtils]: 54: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,012 INFO L273 TraceCheckUtils]: 55: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,012 INFO L273 TraceCheckUtils]: 56: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,012 INFO L273 TraceCheckUtils]: 57: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,013 INFO L273 TraceCheckUtils]: 58: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,013 INFO L273 TraceCheckUtils]: 59: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,013 INFO L273 TraceCheckUtils]: 60: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,013 INFO L273 TraceCheckUtils]: 61: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,013 INFO L273 TraceCheckUtils]: 62: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,013 INFO L273 TraceCheckUtils]: 63: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,013 INFO L273 TraceCheckUtils]: 64: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,013 INFO L273 TraceCheckUtils]: 65: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,013 INFO L273 TraceCheckUtils]: 66: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,014 INFO L273 TraceCheckUtils]: 67: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,014 INFO L273 TraceCheckUtils]: 68: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:13,014 INFO L273 TraceCheckUtils]: 69: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:13,014 INFO L273 TraceCheckUtils]: 70: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,014 INFO L273 TraceCheckUtils]: 71: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,014 INFO L273 TraceCheckUtils]: 72: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,014 INFO L273 TraceCheckUtils]: 73: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,014 INFO L273 TraceCheckUtils]: 74: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,015 INFO L273 TraceCheckUtils]: 75: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,015 INFO L273 TraceCheckUtils]: 76: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,015 INFO L273 TraceCheckUtils]: 77: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,015 INFO L273 TraceCheckUtils]: 78: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,015 INFO L273 TraceCheckUtils]: 79: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,015 INFO L273 TraceCheckUtils]: 80: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,015 INFO L273 TraceCheckUtils]: 81: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,015 INFO L273 TraceCheckUtils]: 82: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,016 INFO L273 TraceCheckUtils]: 83: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,016 INFO L273 TraceCheckUtils]: 84: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:13,016 INFO L273 TraceCheckUtils]: 85: Hoare triple {9918#false} ~i~0 := 0; {9918#false} is VALID [2018-11-23 11:57:13,016 INFO L273 TraceCheckUtils]: 86: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,016 INFO L273 TraceCheckUtils]: 87: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,016 INFO L273 TraceCheckUtils]: 88: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,016 INFO L273 TraceCheckUtils]: 89: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,016 INFO L273 TraceCheckUtils]: 90: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,016 INFO L273 TraceCheckUtils]: 91: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,017 INFO L273 TraceCheckUtils]: 92: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,017 INFO L273 TraceCheckUtils]: 93: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,017 INFO L273 TraceCheckUtils]: 94: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,017 INFO L273 TraceCheckUtils]: 95: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,017 INFO L273 TraceCheckUtils]: 96: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,017 INFO L273 TraceCheckUtils]: 97: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,017 INFO L273 TraceCheckUtils]: 98: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,017 INFO L273 TraceCheckUtils]: 99: Hoare triple {9918#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9918#false} is VALID [2018-11-23 11:57:13,018 INFO L273 TraceCheckUtils]: 100: Hoare triple {9918#false} assume !(~i~0 < 100000); {9918#false} is VALID [2018-11-23 11:57:13,018 INFO L273 TraceCheckUtils]: 101: Hoare triple {9918#false} havoc ~x~0;~x~0 := 0; {9918#false} is VALID [2018-11-23 11:57:13,018 INFO L273 TraceCheckUtils]: 102: Hoare triple {9918#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9918#false} is VALID [2018-11-23 11:57:13,018 INFO L256 TraceCheckUtils]: 103: Hoare triple {9918#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {9918#false} is VALID [2018-11-23 11:57:13,018 INFO L273 TraceCheckUtils]: 104: Hoare triple {9918#false} ~cond := #in~cond; {9918#false} is VALID [2018-11-23 11:57:13,018 INFO L273 TraceCheckUtils]: 105: Hoare triple {9918#false} assume 0 == ~cond; {9918#false} is VALID [2018-11-23 11:57:13,019 INFO L273 TraceCheckUtils]: 106: Hoare triple {9918#false} assume !false; {9918#false} is VALID [2018-11-23 11:57:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-11-23 11:57:13,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:13,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:57:13,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-11-23 11:57:13,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:13,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:57:13,104 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 11:57:13,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:57:13,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:57:13,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:57:13,105 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 18 states. [2018-11-23 11:57:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:13,875 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-11-23 11:57:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:57:13,875 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-11-23 11:57:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:57:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 156 transitions. [2018-11-23 11:57:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:57:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 156 transitions. [2018-11-23 11:57:13,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 156 transitions. [2018-11-23 11:57:14,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:14,140 INFO L225 Difference]: With dead ends: 209 [2018-11-23 11:57:14,141 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 11:57:14,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:57:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 11:57:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-11-23 11:57:14,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:14,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 118 states. [2018-11-23 11:57:14,246 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-23 11:57:14,246 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-23 11:57:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:14,249 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-23 11:57:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 11:57:14,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:14,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:14,250 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 118 states. [2018-11-23 11:57:14,250 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 118 states. [2018-11-23 11:57:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:14,253 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-23 11:57:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 11:57:14,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:14,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:14,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:14,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 11:57:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-11-23 11:57:14,256 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 107 [2018-11-23 11:57:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:14,256 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-11-23 11:57:14,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:57:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 11:57:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 11:57:14,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:14,257 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:57:14,258 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:14,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2139869677, now seen corresponding path program 15 times [2018-11-23 11:57:14,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:14,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:14,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:14,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:14,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:15,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {11102#true} call ULTIMATE.init(); {11102#true} is VALID [2018-11-23 11:57:15,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {11102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11102#true} is VALID [2018-11-23 11:57:15,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {11102#true} assume true; {11102#true} is VALID [2018-11-23 11:57:15,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11102#true} {11102#true} #113#return; {11102#true} is VALID [2018-11-23 11:57:15,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {11102#true} call #t~ret2 := main(); {11102#true} is VALID [2018-11-23 11:57:15,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {11102#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11104#(= main_~i~0 0)} is VALID [2018-11-23 11:57:15,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {11104#(= 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; {11105#(<= main_~i~0 1)} is VALID [2018-11-23 11:57:15,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {11105#(<= 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; {11106#(<= main_~i~0 2)} is VALID [2018-11-23 11:57:15,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {11106#(<= 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; {11107#(<= main_~i~0 3)} is VALID [2018-11-23 11:57:15,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {11107#(<= 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; {11108#(<= main_~i~0 4)} is VALID [2018-11-23 11:57:15,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {11108#(<= 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; {11109#(<= main_~i~0 5)} is VALID [2018-11-23 11:57:15,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {11109#(<= 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; {11110#(<= main_~i~0 6)} is VALID [2018-11-23 11:57:15,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {11110#(<= 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; {11111#(<= main_~i~0 7)} is VALID [2018-11-23 11:57:15,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {11111#(<= 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; {11112#(<= main_~i~0 8)} is VALID [2018-11-23 11:57:15,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {11112#(<= 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; {11113#(<= main_~i~0 9)} is VALID [2018-11-23 11:57:15,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {11113#(<= 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; {11114#(<= main_~i~0 10)} is VALID [2018-11-23 11:57:15,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {11114#(<= 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; {11115#(<= main_~i~0 11)} is VALID [2018-11-23 11:57:15,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {11115#(<= 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; {11116#(<= main_~i~0 12)} is VALID [2018-11-23 11:57:15,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {11116#(<= 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; {11117#(<= main_~i~0 13)} is VALID [2018-11-23 11:57:15,151 INFO L273 TraceCheckUtils]: 19: Hoare triple {11117#(<= 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; {11118#(<= main_~i~0 14)} is VALID [2018-11-23 11:57:15,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {11118#(<= 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; {11119#(<= main_~i~0 15)} is VALID [2018-11-23 11:57:15,152 INFO L273 TraceCheckUtils]: 21: Hoare triple {11119#(<= main_~i~0 15)} assume !(~i~0 < 100000); {11103#false} is VALID [2018-11-23 11:57:15,152 INFO L273 TraceCheckUtils]: 22: Hoare triple {11103#false} ~i~0 := 0; {11103#false} is VALID [2018-11-23 11:57:15,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,153 INFO L273 TraceCheckUtils]: 24: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,153 INFO L273 TraceCheckUtils]: 25: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,153 INFO L273 TraceCheckUtils]: 26: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,154 INFO L273 TraceCheckUtils]: 28: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,154 INFO L273 TraceCheckUtils]: 29: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,154 INFO L273 TraceCheckUtils]: 30: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,154 INFO L273 TraceCheckUtils]: 31: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,154 INFO L273 TraceCheckUtils]: 32: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,155 INFO L273 TraceCheckUtils]: 33: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,155 INFO L273 TraceCheckUtils]: 34: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,155 INFO L273 TraceCheckUtils]: 35: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,155 INFO L273 TraceCheckUtils]: 36: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,155 INFO L273 TraceCheckUtils]: 37: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,155 INFO L273 TraceCheckUtils]: 38: Hoare triple {11103#false} assume !(~i~0 < 100000); {11103#false} is VALID [2018-11-23 11:57:15,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {11103#false} ~i~0 := 0; {11103#false} is VALID [2018-11-23 11:57:15,155 INFO L273 TraceCheckUtils]: 40: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,155 INFO L273 TraceCheckUtils]: 41: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,156 INFO L273 TraceCheckUtils]: 42: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,156 INFO L273 TraceCheckUtils]: 43: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,156 INFO L273 TraceCheckUtils]: 44: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,156 INFO L273 TraceCheckUtils]: 45: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,156 INFO L273 TraceCheckUtils]: 46: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,156 INFO L273 TraceCheckUtils]: 47: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,156 INFO L273 TraceCheckUtils]: 48: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,156 INFO L273 TraceCheckUtils]: 49: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,156 INFO L273 TraceCheckUtils]: 50: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,157 INFO L273 TraceCheckUtils]: 51: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,157 INFO L273 TraceCheckUtils]: 52: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,157 INFO L273 TraceCheckUtils]: 53: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,157 INFO L273 TraceCheckUtils]: 54: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,157 INFO L273 TraceCheckUtils]: 55: Hoare triple {11103#false} assume !(~i~0 < 100000); {11103#false} is VALID [2018-11-23 11:57:15,157 INFO L273 TraceCheckUtils]: 56: Hoare triple {11103#false} ~i~0 := 0; {11103#false} is VALID [2018-11-23 11:57:15,157 INFO L273 TraceCheckUtils]: 57: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,157 INFO L273 TraceCheckUtils]: 58: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,158 INFO L273 TraceCheckUtils]: 59: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,158 INFO L273 TraceCheckUtils]: 60: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,158 INFO L273 TraceCheckUtils]: 61: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,158 INFO L273 TraceCheckUtils]: 62: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,158 INFO L273 TraceCheckUtils]: 63: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,158 INFO L273 TraceCheckUtils]: 64: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,158 INFO L273 TraceCheckUtils]: 65: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,158 INFO L273 TraceCheckUtils]: 66: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,158 INFO L273 TraceCheckUtils]: 67: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,159 INFO L273 TraceCheckUtils]: 68: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,159 INFO L273 TraceCheckUtils]: 69: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,159 INFO L273 TraceCheckUtils]: 70: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,159 INFO L273 TraceCheckUtils]: 71: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,159 INFO L273 TraceCheckUtils]: 72: Hoare triple {11103#false} assume !(~i~0 < 100000); {11103#false} is VALID [2018-11-23 11:57:15,159 INFO L273 TraceCheckUtils]: 73: Hoare triple {11103#false} ~i~0 := 0; {11103#false} is VALID [2018-11-23 11:57:15,159 INFO L273 TraceCheckUtils]: 74: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,159 INFO L273 TraceCheckUtils]: 75: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,159 INFO L273 TraceCheckUtils]: 76: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,160 INFO L273 TraceCheckUtils]: 77: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,160 INFO L273 TraceCheckUtils]: 78: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,160 INFO L273 TraceCheckUtils]: 79: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,160 INFO L273 TraceCheckUtils]: 80: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,160 INFO L273 TraceCheckUtils]: 81: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,160 INFO L273 TraceCheckUtils]: 82: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,160 INFO L273 TraceCheckUtils]: 83: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,160 INFO L273 TraceCheckUtils]: 84: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,160 INFO L273 TraceCheckUtils]: 85: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,161 INFO L273 TraceCheckUtils]: 86: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,161 INFO L273 TraceCheckUtils]: 87: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,161 INFO L273 TraceCheckUtils]: 88: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,161 INFO L273 TraceCheckUtils]: 89: Hoare triple {11103#false} assume !(~i~0 < 100000); {11103#false} is VALID [2018-11-23 11:57:15,161 INFO L273 TraceCheckUtils]: 90: Hoare triple {11103#false} ~i~0 := 0; {11103#false} is VALID [2018-11-23 11:57:15,161 INFO L273 TraceCheckUtils]: 91: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,161 INFO L273 TraceCheckUtils]: 92: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,161 INFO L273 TraceCheckUtils]: 93: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,162 INFO L273 TraceCheckUtils]: 94: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,162 INFO L273 TraceCheckUtils]: 95: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,162 INFO L273 TraceCheckUtils]: 96: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,162 INFO L273 TraceCheckUtils]: 97: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,162 INFO L273 TraceCheckUtils]: 98: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,162 INFO L273 TraceCheckUtils]: 99: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,162 INFO L273 TraceCheckUtils]: 100: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,162 INFO L273 TraceCheckUtils]: 101: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,162 INFO L273 TraceCheckUtils]: 102: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,163 INFO L273 TraceCheckUtils]: 103: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,163 INFO L273 TraceCheckUtils]: 104: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,163 INFO L273 TraceCheckUtils]: 105: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:57:15,163 INFO L273 TraceCheckUtils]: 106: Hoare triple {11103#false} assume !(~i~0 < 100000); {11103#false} is VALID [2018-11-23 11:57:15,163 INFO L273 TraceCheckUtils]: 107: Hoare triple {11103#false} havoc ~x~0;~x~0 := 0; {11103#false} is VALID [2018-11-23 11:57:15,163 INFO L273 TraceCheckUtils]: 108: Hoare triple {11103#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11103#false} is VALID [2018-11-23 11:57:15,163 INFO L256 TraceCheckUtils]: 109: Hoare triple {11103#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {11103#false} is VALID [2018-11-23 11:57:15,163 INFO L273 TraceCheckUtils]: 110: Hoare triple {11103#false} ~cond := #in~cond; {11103#false} is VALID [2018-11-23 11:57:15,163 INFO L273 TraceCheckUtils]: 111: Hoare triple {11103#false} assume 0 == ~cond; {11103#false} is VALID [2018-11-23 11:57:15,164 INFO L273 TraceCheckUtils]: 112: Hoare triple {11103#false} assume !false; {11103#false} is VALID [2018-11-23 11:57:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-11-23 11:57:15,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:15,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:57:15,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:05,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:58:05,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:05,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:05,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {11102#true} call ULTIMATE.init(); {11102#true} is VALID [2018-11-23 11:58:05,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {11102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11102#true} is VALID [2018-11-23 11:58:05,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {11102#true} assume true; {11102#true} is VALID [2018-11-23 11:58:05,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11102#true} {11102#true} #113#return; {11102#true} is VALID [2018-11-23 11:58:05,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {11102#true} call #t~ret2 := main(); {11102#true} is VALID [2018-11-23 11:58:05,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {11102#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11102#true} is VALID [2018-11-23 11:58:05,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,637 INFO L273 TraceCheckUtils]: 12: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,638 INFO L273 TraceCheckUtils]: 18: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {11102#true} 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 100000)} is VALID [2018-11-23 11:58:05,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {11183#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {11102#true} is VALID [2018-11-23 11:58:05,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {11102#true} ~i~0 := 0; {11102#true} is VALID [2018-11-23 11:58:05,639 INFO L273 TraceCheckUtils]: 23: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,639 INFO L273 TraceCheckUtils]: 27: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,640 INFO L273 TraceCheckUtils]: 30: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,640 INFO L273 TraceCheckUtils]: 31: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,640 INFO L273 TraceCheckUtils]: 33: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,640 INFO L273 TraceCheckUtils]: 34: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,640 INFO L273 TraceCheckUtils]: 35: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,640 INFO L273 TraceCheckUtils]: 36: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,641 INFO L273 TraceCheckUtils]: 37: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11183#(<= main_~i~0 100000)} is VALID [2018-11-23 11:58:05,641 INFO L273 TraceCheckUtils]: 38: Hoare triple {11183#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {11102#true} is VALID [2018-11-23 11:58:05,641 INFO L273 TraceCheckUtils]: 39: Hoare triple {11102#true} ~i~0 := 0; {11102#true} is VALID [2018-11-23 11:58:05,641 INFO L273 TraceCheckUtils]: 40: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,641 INFO L273 TraceCheckUtils]: 41: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,642 INFO L273 TraceCheckUtils]: 42: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,642 INFO L273 TraceCheckUtils]: 43: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,642 INFO L273 TraceCheckUtils]: 44: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,642 INFO L273 TraceCheckUtils]: 45: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,642 INFO L273 TraceCheckUtils]: 46: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,642 INFO L273 TraceCheckUtils]: 48: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,642 INFO L273 TraceCheckUtils]: 49: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,642 INFO L273 TraceCheckUtils]: 50: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,643 INFO L273 TraceCheckUtils]: 51: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,643 INFO L273 TraceCheckUtils]: 52: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,643 INFO L273 TraceCheckUtils]: 53: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {11102#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11102#true} is VALID [2018-11-23 11:58:05,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {11102#true} assume !(~i~0 < 100000); {11102#true} is VALID [2018-11-23 11:58:05,643 INFO L273 TraceCheckUtils]: 56: Hoare triple {11102#true} ~i~0 := 0; {11292#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:05,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {11292#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11105#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:05,645 INFO L273 TraceCheckUtils]: 58: Hoare triple {11105#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11106#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:05,646 INFO L273 TraceCheckUtils]: 59: Hoare triple {11106#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11107#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:05,646 INFO L273 TraceCheckUtils]: 60: Hoare triple {11107#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11108#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:05,647 INFO L273 TraceCheckUtils]: 61: Hoare triple {11108#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11109#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:05,648 INFO L273 TraceCheckUtils]: 62: Hoare triple {11109#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11110#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:05,648 INFO L273 TraceCheckUtils]: 63: Hoare triple {11110#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11111#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:05,649 INFO L273 TraceCheckUtils]: 64: Hoare triple {11111#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11112#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:05,650 INFO L273 TraceCheckUtils]: 65: Hoare triple {11112#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11113#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:05,651 INFO L273 TraceCheckUtils]: 66: Hoare triple {11113#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11114#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:05,652 INFO L273 TraceCheckUtils]: 67: Hoare triple {11114#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11115#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:05,653 INFO L273 TraceCheckUtils]: 68: Hoare triple {11115#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11116#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:05,654 INFO L273 TraceCheckUtils]: 69: Hoare triple {11116#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11117#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:05,655 INFO L273 TraceCheckUtils]: 70: Hoare triple {11117#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11118#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:05,656 INFO L273 TraceCheckUtils]: 71: Hoare triple {11118#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11119#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:05,656 INFO L273 TraceCheckUtils]: 72: Hoare triple {11119#(<= main_~i~0 15)} assume !(~i~0 < 100000); {11103#false} is VALID [2018-11-23 11:58:05,657 INFO L273 TraceCheckUtils]: 73: Hoare triple {11103#false} ~i~0 := 0; {11103#false} is VALID [2018-11-23 11:58:05,657 INFO L273 TraceCheckUtils]: 74: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,657 INFO L273 TraceCheckUtils]: 75: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,657 INFO L273 TraceCheckUtils]: 76: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,657 INFO L273 TraceCheckUtils]: 77: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,658 INFO L273 TraceCheckUtils]: 78: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,658 INFO L273 TraceCheckUtils]: 79: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,658 INFO L273 TraceCheckUtils]: 80: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,658 INFO L273 TraceCheckUtils]: 81: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,658 INFO L273 TraceCheckUtils]: 82: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,659 INFO L273 TraceCheckUtils]: 83: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,659 INFO L273 TraceCheckUtils]: 84: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,659 INFO L273 TraceCheckUtils]: 85: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,659 INFO L273 TraceCheckUtils]: 86: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,659 INFO L273 TraceCheckUtils]: 87: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,660 INFO L273 TraceCheckUtils]: 88: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,660 INFO L273 TraceCheckUtils]: 89: Hoare triple {11103#false} assume !(~i~0 < 100000); {11103#false} is VALID [2018-11-23 11:58:05,660 INFO L273 TraceCheckUtils]: 90: Hoare triple {11103#false} ~i~0 := 0; {11103#false} is VALID [2018-11-23 11:58:05,660 INFO L273 TraceCheckUtils]: 91: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,660 INFO L273 TraceCheckUtils]: 92: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,661 INFO L273 TraceCheckUtils]: 93: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,661 INFO L273 TraceCheckUtils]: 94: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,661 INFO L273 TraceCheckUtils]: 95: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,661 INFO L273 TraceCheckUtils]: 96: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,661 INFO L273 TraceCheckUtils]: 97: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,662 INFO L273 TraceCheckUtils]: 98: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,662 INFO L273 TraceCheckUtils]: 99: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,662 INFO L273 TraceCheckUtils]: 100: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,662 INFO L273 TraceCheckUtils]: 101: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,662 INFO L273 TraceCheckUtils]: 102: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,662 INFO L273 TraceCheckUtils]: 103: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,662 INFO L273 TraceCheckUtils]: 104: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,663 INFO L273 TraceCheckUtils]: 105: Hoare triple {11103#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11103#false} is VALID [2018-11-23 11:58:05,663 INFO L273 TraceCheckUtils]: 106: Hoare triple {11103#false} assume !(~i~0 < 100000); {11103#false} is VALID [2018-11-23 11:58:05,663 INFO L273 TraceCheckUtils]: 107: Hoare triple {11103#false} havoc ~x~0;~x~0 := 0; {11103#false} is VALID [2018-11-23 11:58:05,663 INFO L273 TraceCheckUtils]: 108: Hoare triple {11103#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11103#false} is VALID [2018-11-23 11:58:05,663 INFO L256 TraceCheckUtils]: 109: Hoare triple {11103#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {11103#false} is VALID [2018-11-23 11:58:05,663 INFO L273 TraceCheckUtils]: 110: Hoare triple {11103#false} ~cond := #in~cond; {11103#false} is VALID [2018-11-23 11:58:05,663 INFO L273 TraceCheckUtils]: 111: Hoare triple {11103#false} assume 0 == ~cond; {11103#false} is VALID [2018-11-23 11:58:05,663 INFO L273 TraceCheckUtils]: 112: Hoare triple {11103#false} assume !false; {11103#false} is VALID [2018-11-23 11:58:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-23 11:58:05,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:05,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2018-11-23 11:58:05,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2018-11-23 11:58:05,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:05,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:58:05,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:05,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:58:05,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:58:05,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:05,775 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 20 states. [2018-11-23 11:58:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:07,194 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2018-11-23 11:58:07,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:58:07,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2018-11-23 11:58:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 162 transitions. [2018-11-23 11:58:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 162 transitions. [2018-11-23 11:58:07,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 162 transitions. [2018-11-23 11:58:07,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:07,379 INFO L225 Difference]: With dead ends: 220 [2018-11-23 11:58:07,379 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 11:58:07,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 11:58:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-11-23 11:58:07,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:07,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 124 states. [2018-11-23 11:58:07,470 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 124 states. [2018-11-23 11:58:07,470 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 124 states. [2018-11-23 11:58:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:07,473 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-23 11:58:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-11-23 11:58:07,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:07,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:07,473 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 124 states. [2018-11-23 11:58:07,474 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 124 states. [2018-11-23 11:58:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:07,476 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-23 11:58:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-11-23 11:58:07,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:07,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:07,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:07,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 11:58:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-11-23 11:58:07,479 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 113 [2018-11-23 11:58:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:07,480 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-11-23 11:58:07,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:58:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-11-23 11:58:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 11:58:07,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:07,481 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:07,481 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:07,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:07,482 INFO L82 PathProgramCache]: Analyzing trace with hash -243049002, now seen corresponding path program 16 times [2018-11-23 11:58:07,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:07,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:07,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:07,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:07,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:08,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {12353#true} call ULTIMATE.init(); {12353#true} is VALID [2018-11-23 11:58:08,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {12353#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12353#true} is VALID [2018-11-23 11:58:08,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {12353#true} assume true; {12353#true} is VALID [2018-11-23 11:58:08,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12353#true} {12353#true} #113#return; {12353#true} is VALID [2018-11-23 11:58:08,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {12353#true} call #t~ret2 := main(); {12353#true} is VALID [2018-11-23 11:58:08,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {12353#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12355#(= main_~i~0 0)} is VALID [2018-11-23 11:58:08,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {12355#(= 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; {12356#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:08,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {12356#(<= 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; {12357#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:08,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {12357#(<= 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; {12358#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:08,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {12358#(<= 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; {12359#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:08,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {12359#(<= 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; {12360#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:08,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {12360#(<= 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; {12361#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:08,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {12361#(<= 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; {12362#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:08,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {12362#(<= 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; {12363#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:08,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {12363#(<= 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; {12364#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:08,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {12364#(<= 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; {12365#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:08,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {12365#(<= 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; {12366#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:08,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {12366#(<= 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; {12367#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:08,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {12367#(<= 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; {12368#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:08,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {12368#(<= 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; {12369#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:08,437 INFO L273 TraceCheckUtils]: 20: Hoare triple {12369#(<= 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; {12370#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:08,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {12370#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12371#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:08,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {12371#(<= main_~i~0 16)} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,441 INFO L273 TraceCheckUtils]: 31: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,441 INFO L273 TraceCheckUtils]: 32: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,441 INFO L273 TraceCheckUtils]: 34: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,442 INFO L273 TraceCheckUtils]: 37: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,442 INFO L273 TraceCheckUtils]: 38: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,442 INFO L273 TraceCheckUtils]: 39: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,442 INFO L273 TraceCheckUtils]: 40: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,442 INFO L273 TraceCheckUtils]: 41: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,442 INFO L273 TraceCheckUtils]: 42: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,442 INFO L273 TraceCheckUtils]: 43: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,443 INFO L273 TraceCheckUtils]: 44: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,443 INFO L273 TraceCheckUtils]: 47: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,443 INFO L273 TraceCheckUtils]: 48: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,443 INFO L273 TraceCheckUtils]: 49: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,443 INFO L273 TraceCheckUtils]: 50: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,443 INFO L273 TraceCheckUtils]: 51: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,444 INFO L273 TraceCheckUtils]: 52: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,444 INFO L273 TraceCheckUtils]: 53: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,444 INFO L273 TraceCheckUtils]: 54: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,444 INFO L273 TraceCheckUtils]: 55: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,444 INFO L273 TraceCheckUtils]: 56: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,444 INFO L273 TraceCheckUtils]: 57: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,444 INFO L273 TraceCheckUtils]: 58: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,444 INFO L273 TraceCheckUtils]: 59: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,444 INFO L273 TraceCheckUtils]: 60: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,445 INFO L273 TraceCheckUtils]: 61: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,445 INFO L273 TraceCheckUtils]: 62: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,445 INFO L273 TraceCheckUtils]: 63: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,445 INFO L273 TraceCheckUtils]: 64: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,445 INFO L273 TraceCheckUtils]: 65: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,445 INFO L273 TraceCheckUtils]: 66: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,445 INFO L273 TraceCheckUtils]: 67: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,445 INFO L273 TraceCheckUtils]: 68: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,445 INFO L273 TraceCheckUtils]: 69: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,446 INFO L273 TraceCheckUtils]: 70: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,446 INFO L273 TraceCheckUtils]: 71: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,446 INFO L273 TraceCheckUtils]: 72: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,446 INFO L273 TraceCheckUtils]: 73: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,446 INFO L273 TraceCheckUtils]: 74: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,446 INFO L273 TraceCheckUtils]: 75: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,446 INFO L273 TraceCheckUtils]: 76: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,446 INFO L273 TraceCheckUtils]: 77: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,447 INFO L273 TraceCheckUtils]: 78: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,447 INFO L273 TraceCheckUtils]: 79: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,447 INFO L273 TraceCheckUtils]: 80: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,447 INFO L273 TraceCheckUtils]: 81: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,447 INFO L273 TraceCheckUtils]: 82: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,447 INFO L273 TraceCheckUtils]: 83: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,447 INFO L273 TraceCheckUtils]: 84: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,447 INFO L273 TraceCheckUtils]: 85: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,447 INFO L273 TraceCheckUtils]: 86: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,448 INFO L273 TraceCheckUtils]: 87: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,448 INFO L273 TraceCheckUtils]: 88: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,448 INFO L273 TraceCheckUtils]: 89: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,448 INFO L273 TraceCheckUtils]: 90: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,448 INFO L273 TraceCheckUtils]: 91: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,448 INFO L273 TraceCheckUtils]: 92: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,448 INFO L273 TraceCheckUtils]: 93: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,448 INFO L273 TraceCheckUtils]: 94: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,448 INFO L273 TraceCheckUtils]: 95: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,449 INFO L273 TraceCheckUtils]: 96: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,449 INFO L273 TraceCheckUtils]: 97: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,449 INFO L273 TraceCheckUtils]: 98: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,449 INFO L273 TraceCheckUtils]: 99: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,449 INFO L273 TraceCheckUtils]: 100: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,449 INFO L273 TraceCheckUtils]: 101: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,449 INFO L273 TraceCheckUtils]: 102: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,449 INFO L273 TraceCheckUtils]: 103: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,450 INFO L273 TraceCheckUtils]: 104: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,450 INFO L273 TraceCheckUtils]: 105: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,450 INFO L273 TraceCheckUtils]: 106: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,450 INFO L273 TraceCheckUtils]: 107: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,450 INFO L273 TraceCheckUtils]: 108: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,450 INFO L273 TraceCheckUtils]: 109: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,450 INFO L273 TraceCheckUtils]: 110: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,450 INFO L273 TraceCheckUtils]: 111: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,450 INFO L273 TraceCheckUtils]: 112: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,451 INFO L273 TraceCheckUtils]: 113: Hoare triple {12354#false} havoc ~x~0;~x~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,451 INFO L273 TraceCheckUtils]: 114: Hoare triple {12354#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12354#false} is VALID [2018-11-23 11:58:08,451 INFO L256 TraceCheckUtils]: 115: Hoare triple {12354#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {12354#false} is VALID [2018-11-23 11:58:08,451 INFO L273 TraceCheckUtils]: 116: Hoare triple {12354#false} ~cond := #in~cond; {12354#false} is VALID [2018-11-23 11:58:08,451 INFO L273 TraceCheckUtils]: 117: Hoare triple {12354#false} assume 0 == ~cond; {12354#false} is VALID [2018-11-23 11:58:08,451 INFO L273 TraceCheckUtils]: 118: Hoare triple {12354#false} assume !false; {12354#false} is VALID [2018-11-23 11:58:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-11-23 11:58:08,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:08,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:08,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:08,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:08,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:08,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:08,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {12353#true} call ULTIMATE.init(); {12353#true} is VALID [2018-11-23 11:58:08,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {12353#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12353#true} is VALID [2018-11-23 11:58:08,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {12353#true} assume true; {12353#true} is VALID [2018-11-23 11:58:08,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12353#true} {12353#true} #113#return; {12353#true} is VALID [2018-11-23 11:58:08,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {12353#true} call #t~ret2 := main(); {12353#true} is VALID [2018-11-23 11:58:08,754 INFO L273 TraceCheckUtils]: 5: Hoare triple {12353#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12390#(<= main_~i~0 0)} is VALID [2018-11-23 11:58:08,755 INFO L273 TraceCheckUtils]: 6: Hoare triple {12390#(<= 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; {12356#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:08,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {12356#(<= 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; {12357#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:08,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {12357#(<= 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; {12358#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:08,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {12358#(<= 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; {12359#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:08,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {12359#(<= 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; {12360#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:08,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {12360#(<= 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; {12361#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:08,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {12361#(<= 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; {12362#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:08,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {12362#(<= 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; {12363#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:08,761 INFO L273 TraceCheckUtils]: 14: Hoare triple {12363#(<= 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; {12364#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:08,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {12364#(<= 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; {12365#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:08,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {12365#(<= 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; {12366#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:08,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {12366#(<= 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; {12367#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:08,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {12367#(<= 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; {12368#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:08,766 INFO L273 TraceCheckUtils]: 19: Hoare triple {12368#(<= 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; {12369#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:08,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {12369#(<= 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; {12370#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:08,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {12370#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12371#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:08,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {12371#(<= main_~i~0 16)} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,770 INFO L273 TraceCheckUtils]: 27: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,770 INFO L273 TraceCheckUtils]: 31: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,771 INFO L273 TraceCheckUtils]: 33: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,771 INFO L273 TraceCheckUtils]: 35: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,772 INFO L273 TraceCheckUtils]: 37: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,772 INFO L273 TraceCheckUtils]: 39: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,772 INFO L273 TraceCheckUtils]: 40: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,772 INFO L273 TraceCheckUtils]: 41: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,773 INFO L273 TraceCheckUtils]: 42: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,773 INFO L273 TraceCheckUtils]: 43: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,773 INFO L273 TraceCheckUtils]: 44: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,773 INFO L273 TraceCheckUtils]: 45: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,773 INFO L273 TraceCheckUtils]: 46: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,774 INFO L273 TraceCheckUtils]: 50: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,774 INFO L273 TraceCheckUtils]: 51: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,774 INFO L273 TraceCheckUtils]: 52: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,774 INFO L273 TraceCheckUtils]: 53: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,774 INFO L273 TraceCheckUtils]: 54: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,775 INFO L273 TraceCheckUtils]: 55: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,775 INFO L273 TraceCheckUtils]: 56: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,775 INFO L273 TraceCheckUtils]: 57: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,775 INFO L273 TraceCheckUtils]: 58: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,775 INFO L273 TraceCheckUtils]: 59: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,775 INFO L273 TraceCheckUtils]: 60: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,775 INFO L273 TraceCheckUtils]: 61: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,775 INFO L273 TraceCheckUtils]: 62: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,776 INFO L273 TraceCheckUtils]: 63: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,776 INFO L273 TraceCheckUtils]: 64: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,776 INFO L273 TraceCheckUtils]: 65: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,776 INFO L273 TraceCheckUtils]: 66: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,776 INFO L273 TraceCheckUtils]: 67: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,776 INFO L273 TraceCheckUtils]: 68: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,776 INFO L273 TraceCheckUtils]: 69: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,776 INFO L273 TraceCheckUtils]: 70: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,776 INFO L273 TraceCheckUtils]: 71: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,777 INFO L273 TraceCheckUtils]: 72: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,777 INFO L273 TraceCheckUtils]: 73: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,777 INFO L273 TraceCheckUtils]: 74: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,777 INFO L273 TraceCheckUtils]: 75: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,777 INFO L273 TraceCheckUtils]: 76: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,777 INFO L273 TraceCheckUtils]: 77: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,777 INFO L273 TraceCheckUtils]: 78: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,777 INFO L273 TraceCheckUtils]: 79: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,777 INFO L273 TraceCheckUtils]: 80: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,778 INFO L273 TraceCheckUtils]: 81: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,778 INFO L273 TraceCheckUtils]: 82: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,778 INFO L273 TraceCheckUtils]: 83: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,778 INFO L273 TraceCheckUtils]: 84: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,778 INFO L273 TraceCheckUtils]: 85: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,778 INFO L273 TraceCheckUtils]: 86: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,778 INFO L273 TraceCheckUtils]: 87: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,778 INFO L273 TraceCheckUtils]: 88: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,778 INFO L273 TraceCheckUtils]: 89: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,779 INFO L273 TraceCheckUtils]: 90: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,779 INFO L273 TraceCheckUtils]: 91: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,779 INFO L273 TraceCheckUtils]: 92: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,779 INFO L273 TraceCheckUtils]: 93: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,779 INFO L273 TraceCheckUtils]: 94: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,779 INFO L273 TraceCheckUtils]: 95: Hoare triple {12354#false} ~i~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,779 INFO L273 TraceCheckUtils]: 96: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,779 INFO L273 TraceCheckUtils]: 97: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,779 INFO L273 TraceCheckUtils]: 98: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,780 INFO L273 TraceCheckUtils]: 99: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,780 INFO L273 TraceCheckUtils]: 100: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,780 INFO L273 TraceCheckUtils]: 101: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,780 INFO L273 TraceCheckUtils]: 102: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,780 INFO L273 TraceCheckUtils]: 103: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,780 INFO L273 TraceCheckUtils]: 104: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,780 INFO L273 TraceCheckUtils]: 105: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,780 INFO L273 TraceCheckUtils]: 106: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,780 INFO L273 TraceCheckUtils]: 107: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,781 INFO L273 TraceCheckUtils]: 108: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,781 INFO L273 TraceCheckUtils]: 109: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,781 INFO L273 TraceCheckUtils]: 110: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,781 INFO L273 TraceCheckUtils]: 111: Hoare triple {12354#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#false} is VALID [2018-11-23 11:58:08,781 INFO L273 TraceCheckUtils]: 112: Hoare triple {12354#false} assume !(~i~0 < 100000); {12354#false} is VALID [2018-11-23 11:58:08,781 INFO L273 TraceCheckUtils]: 113: Hoare triple {12354#false} havoc ~x~0;~x~0 := 0; {12354#false} is VALID [2018-11-23 11:58:08,781 INFO L273 TraceCheckUtils]: 114: Hoare triple {12354#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12354#false} is VALID [2018-11-23 11:58:08,781 INFO L256 TraceCheckUtils]: 115: Hoare triple {12354#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {12354#false} is VALID [2018-11-23 11:58:08,781 INFO L273 TraceCheckUtils]: 116: Hoare triple {12354#false} ~cond := #in~cond; {12354#false} is VALID [2018-11-23 11:58:08,782 INFO L273 TraceCheckUtils]: 117: Hoare triple {12354#false} assume 0 == ~cond; {12354#false} is VALID [2018-11-23 11:58:08,782 INFO L273 TraceCheckUtils]: 118: Hoare triple {12354#false} assume !false; {12354#false} is VALID [2018-11-23 11:58:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-11-23 11:58:08,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:08,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:58:08,807 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-11-23 11:58:08,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:08,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:58:08,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:08,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:58:08,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:58:08,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:08,932 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 20 states. [2018-11-23 11:58:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:12,111 INFO L93 Difference]: Finished difference Result 231 states and 248 transitions. [2018-11-23 11:58:12,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:58:12,111 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-11-23 11:58:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 168 transitions. [2018-11-23 11:58:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 168 transitions. [2018-11-23 11:58:12,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 168 transitions. [2018-11-23 11:58:12,314 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 11:58:12,317 INFO L225 Difference]: With dead ends: 231 [2018-11-23 11:58:12,317 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 11:58:12,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 11:58:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-23 11:58:12,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:12,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 130 states. [2018-11-23 11:58:12,419 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 130 states. [2018-11-23 11:58:12,419 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 130 states. [2018-11-23 11:58:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:12,421 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-23 11:58:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-23 11:58:12,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:12,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:12,421 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 130 states. [2018-11-23 11:58:12,421 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 130 states. [2018-11-23 11:58:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:12,423 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-23 11:58:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-23 11:58:12,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:12,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:12,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:12,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 11:58:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2018-11-23 11:58:12,426 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 119 [2018-11-23 11:58:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:12,426 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2018-11-23 11:58:12,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:58:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2018-11-23 11:58:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-23 11:58:12,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:12,427 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:12,428 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:12,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:12,428 INFO L82 PathProgramCache]: Analyzing trace with hash 767435251, now seen corresponding path program 17 times [2018-11-23 11:58:12,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:12,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:12,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:12,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:12,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:13,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {13668#true} call ULTIMATE.init(); {13668#true} is VALID [2018-11-23 11:58:13,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {13668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13668#true} is VALID [2018-11-23 11:58:13,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {13668#true} assume true; {13668#true} is VALID [2018-11-23 11:58:13,097 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13668#true} {13668#true} #113#return; {13668#true} is VALID [2018-11-23 11:58:13,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {13668#true} call #t~ret2 := main(); {13668#true} is VALID [2018-11-23 11:58:13,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {13668#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13670#(= main_~i~0 0)} is VALID [2018-11-23 11:58:13,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {13670#(= 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; {13671#(<= main_~i~0 1)} is VALID [2018-11-23 11:58:13,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {13671#(<= 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; {13672#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:13,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {13672#(<= 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; {13673#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:13,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {13673#(<= 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; {13674#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:13,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {13674#(<= 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; {13675#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:13,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {13675#(<= 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; {13676#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:13,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {13676#(<= 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; {13677#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:13,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {13677#(<= 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; {13678#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:13,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {13678#(<= 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; {13679#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:13,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {13679#(<= 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; {13680#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:13,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {13680#(<= 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; {13681#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:13,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {13681#(<= 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; {13682#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:13,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {13682#(<= 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; {13683#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:13,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {13683#(<= 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; {13684#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:13,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {13684#(<= 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; {13685#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:13,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {13685#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13686#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:13,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {13686#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13687#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:13,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {13687#(<= main_~i~0 17)} assume !(~i~0 < 100000); {13669#false} is VALID [2018-11-23 11:58:13,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {13669#false} ~i~0 := 0; {13669#false} is VALID [2018-11-23 11:58:13,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,114 INFO L273 TraceCheckUtils]: 33: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,114 INFO L273 TraceCheckUtils]: 34: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,115 INFO L273 TraceCheckUtils]: 37: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,115 INFO L273 TraceCheckUtils]: 38: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,115 INFO L273 TraceCheckUtils]: 39: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,115 INFO L273 TraceCheckUtils]: 40: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,115 INFO L273 TraceCheckUtils]: 41: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,116 INFO L273 TraceCheckUtils]: 42: Hoare triple {13669#false} assume !(~i~0 < 100000); {13669#false} is VALID [2018-11-23 11:58:13,116 INFO L273 TraceCheckUtils]: 43: Hoare triple {13669#false} ~i~0 := 0; {13669#false} is VALID [2018-11-23 11:58:13,116 INFO L273 TraceCheckUtils]: 44: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,116 INFO L273 TraceCheckUtils]: 45: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,116 INFO L273 TraceCheckUtils]: 46: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,116 INFO L273 TraceCheckUtils]: 47: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,116 INFO L273 TraceCheckUtils]: 48: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,117 INFO L273 TraceCheckUtils]: 49: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,117 INFO L273 TraceCheckUtils]: 50: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,117 INFO L273 TraceCheckUtils]: 51: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,117 INFO L273 TraceCheckUtils]: 52: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,117 INFO L273 TraceCheckUtils]: 53: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,117 INFO L273 TraceCheckUtils]: 54: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,117 INFO L273 TraceCheckUtils]: 55: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,117 INFO L273 TraceCheckUtils]: 56: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,118 INFO L273 TraceCheckUtils]: 57: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,118 INFO L273 TraceCheckUtils]: 59: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,118 INFO L273 TraceCheckUtils]: 60: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,118 INFO L273 TraceCheckUtils]: 61: Hoare triple {13669#false} assume !(~i~0 < 100000); {13669#false} is VALID [2018-11-23 11:58:13,118 INFO L273 TraceCheckUtils]: 62: Hoare triple {13669#false} ~i~0 := 0; {13669#false} is VALID [2018-11-23 11:58:13,118 INFO L273 TraceCheckUtils]: 63: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,118 INFO L273 TraceCheckUtils]: 64: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,118 INFO L273 TraceCheckUtils]: 65: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,119 INFO L273 TraceCheckUtils]: 66: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,119 INFO L273 TraceCheckUtils]: 67: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,119 INFO L273 TraceCheckUtils]: 68: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,119 INFO L273 TraceCheckUtils]: 69: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,119 INFO L273 TraceCheckUtils]: 70: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,119 INFO L273 TraceCheckUtils]: 71: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,119 INFO L273 TraceCheckUtils]: 72: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,119 INFO L273 TraceCheckUtils]: 73: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,119 INFO L273 TraceCheckUtils]: 74: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,120 INFO L273 TraceCheckUtils]: 75: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,120 INFO L273 TraceCheckUtils]: 76: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,120 INFO L273 TraceCheckUtils]: 77: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,120 INFO L273 TraceCheckUtils]: 78: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,120 INFO L273 TraceCheckUtils]: 79: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,120 INFO L273 TraceCheckUtils]: 80: Hoare triple {13669#false} assume !(~i~0 < 100000); {13669#false} is VALID [2018-11-23 11:58:13,120 INFO L273 TraceCheckUtils]: 81: Hoare triple {13669#false} ~i~0 := 0; {13669#false} is VALID [2018-11-23 11:58:13,120 INFO L273 TraceCheckUtils]: 82: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,120 INFO L273 TraceCheckUtils]: 83: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,121 INFO L273 TraceCheckUtils]: 84: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,121 INFO L273 TraceCheckUtils]: 85: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,121 INFO L273 TraceCheckUtils]: 86: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,121 INFO L273 TraceCheckUtils]: 87: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,121 INFO L273 TraceCheckUtils]: 88: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,121 INFO L273 TraceCheckUtils]: 89: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,121 INFO L273 TraceCheckUtils]: 90: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,121 INFO L273 TraceCheckUtils]: 91: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,122 INFO L273 TraceCheckUtils]: 92: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,122 INFO L273 TraceCheckUtils]: 93: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,122 INFO L273 TraceCheckUtils]: 94: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,122 INFO L273 TraceCheckUtils]: 95: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,122 INFO L273 TraceCheckUtils]: 96: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,122 INFO L273 TraceCheckUtils]: 97: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,122 INFO L273 TraceCheckUtils]: 98: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,122 INFO L273 TraceCheckUtils]: 99: Hoare triple {13669#false} assume !(~i~0 < 100000); {13669#false} is VALID [2018-11-23 11:58:13,122 INFO L273 TraceCheckUtils]: 100: Hoare triple {13669#false} ~i~0 := 0; {13669#false} is VALID [2018-11-23 11:58:13,123 INFO L273 TraceCheckUtils]: 101: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,123 INFO L273 TraceCheckUtils]: 102: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,123 INFO L273 TraceCheckUtils]: 103: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,123 INFO L273 TraceCheckUtils]: 104: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,123 INFO L273 TraceCheckUtils]: 105: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,123 INFO L273 TraceCheckUtils]: 106: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,123 INFO L273 TraceCheckUtils]: 107: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,123 INFO L273 TraceCheckUtils]: 108: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,123 INFO L273 TraceCheckUtils]: 109: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,124 INFO L273 TraceCheckUtils]: 110: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,124 INFO L273 TraceCheckUtils]: 111: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,124 INFO L273 TraceCheckUtils]: 112: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,124 INFO L273 TraceCheckUtils]: 113: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,124 INFO L273 TraceCheckUtils]: 114: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,124 INFO L273 TraceCheckUtils]: 115: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,124 INFO L273 TraceCheckUtils]: 116: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,124 INFO L273 TraceCheckUtils]: 117: Hoare triple {13669#false} assume !!(~i~0 < 100000);call write~int(47, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13669#false} is VALID [2018-11-23 11:58:13,124 INFO L273 TraceCheckUtils]: 118: Hoare triple {13669#false} assume !(~i~0 < 100000); {13669#false} is VALID [2018-11-23 11:58:13,125 INFO L273 TraceCheckUtils]: 119: Hoare triple {13669#false} havoc ~x~0;~x~0 := 0; {13669#false} is VALID [2018-11-23 11:58:13,125 INFO L273 TraceCheckUtils]: 120: Hoare triple {13669#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13669#false} is VALID [2018-11-23 11:58:13,125 INFO L256 TraceCheckUtils]: 121: Hoare triple {13669#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {13669#false} is VALID [2018-11-23 11:58:13,125 INFO L273 TraceCheckUtils]: 122: Hoare triple {13669#false} ~cond := #in~cond; {13669#false} is VALID [2018-11-23 11:58:13,125 INFO L273 TraceCheckUtils]: 123: Hoare triple {13669#false} assume 0 == ~cond; {13669#false} is VALID [2018-11-23 11:58:13,125 INFO L273 TraceCheckUtils]: 124: Hoare triple {13669#false} assume !false; {13669#false} is VALID [2018-11-23 11:58:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2018-11-23 11:58:13,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:13,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:58:13,142 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1