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_init4_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:32,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:32,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:32,267 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:32,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:32,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:32,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:32,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:32,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:32,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:32,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:32,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:32,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:32,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:32,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:32,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:32,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:32,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:32,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:32,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:32,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:32,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:32,307 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:32,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:32,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:32,308 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:32,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:32,310 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:32,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:32,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:32,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:32,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:32,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:32,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:32,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:32,315 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:32,315 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:02:32,339 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:32,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:32,340 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:32,341 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:32,341 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:32,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:32,342 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:32,342 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:32,342 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:32,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:32,343 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:32,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:32,343 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:32,343 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:32,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:32,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:32,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:32,345 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:32,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:32,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:32,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:32,347 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:32,347 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:32,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:32,347 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:32,347 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:32,348 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:32,348 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:32,348 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:32,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:32,348 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:32,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:32,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:32,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:32,418 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:32,418 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:32,419 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init4_true-unreach-call_ground.i [2018-11-23 12:02:32,481 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d83bde8e/bfc5073dcf8c474097245a450bde2966/FLAGf8864a14f [2018-11-23 12:02:32,925 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:32,925 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init4_true-unreach-call_ground.i [2018-11-23 12:02:32,931 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d83bde8e/bfc5073dcf8c474097245a450bde2966/FLAGf8864a14f [2018-11-23 12:02:33,309 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d83bde8e/bfc5073dcf8c474097245a450bde2966 [2018-11-23 12:02:33,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:33,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:33,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:33,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:33,325 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:33,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee665d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33, skipping insertion in model container [2018-11-23 12:02:33,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:33,363 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:33,620 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:33,625 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:33,651 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:33,679 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:33,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33 WrapperNode [2018-11-23 12:02:33,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:33,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:33,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:33,681 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:33,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:33,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:33,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:33,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:33,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... [2018-11-23 12:02:33,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:33,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:33,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:33,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:33,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:33,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:33,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:33,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:33,851 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:33,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:33,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:34,410 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:34,410 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 12:02:34,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:34 BoogieIcfgContainer [2018-11-23 12:02:34,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:34,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:34,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:34,416 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:34,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:02:33" (1/3) ... [2018-11-23 12:02:34,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cad227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:34, skipping insertion in model container [2018-11-23 12:02:34,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:33" (2/3) ... [2018-11-23 12:02:34,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cad227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:34, skipping insertion in model container [2018-11-23 12:02:34,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:34" (3/3) ... [2018-11-23 12:02:34,419 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init4_true-unreach-call_ground.i [2018-11-23 12:02:34,428 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:34,434 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:34,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:34,484 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:34,485 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:34,485 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:34,485 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:34,486 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:34,486 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:34,486 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:34,487 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:34,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:02:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:02:34,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:34,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:34,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:34,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1568614638, now seen corresponding path program 1 times [2018-11-23 12:02:34,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:34,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:34,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 12:02:34,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 12:02:34,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 12:02:34,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #87#return; {32#true} is VALID [2018-11-23 12:02:34,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2018-11-23 12:02:34,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {32#true} is VALID [2018-11-23 12:02:34,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 12:02:34,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:02:34,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 12:02:34,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:02:34,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 12:02:34,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:02:34,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 12:02:34,672 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} havoc ~x~0;~x~0 := 0; {33#false} is VALID [2018-11-23 12:02:34,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {33#false} is VALID [2018-11-23 12:02:34,673 INFO L256 TraceCheckUtils]: 15: Hoare triple {33#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {33#false} is VALID [2018-11-23 12:02:34,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 12:02:34,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 12:02:34,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 12:02:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:34,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:34,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:34,686 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 12:02:34,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:34,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:34,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:34,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:34,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:34,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:34,860 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 12:02:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,189 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2018-11-23 12:02:35,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:35,189 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 12:02:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 12:02:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 12:02:35,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-23 12:02:35,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:35,676 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:02:35,677 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:02:35,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:02:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:02:35,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:35,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:35,723 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:35,723 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,727 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:02:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:02:35,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:35,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:35,729 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:35,729 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,733 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:02:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:02:35,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:35,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:35,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:35,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:02:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 12:02:35,739 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2018-11-23 12:02:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:35,740 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 12:02:35,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:02:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:02:35,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:35,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:35,742 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:35,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash -395002610, now seen corresponding path program 1 times [2018-11-23 12:02:35,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:35,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:35,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:35,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {187#true} call ULTIMATE.init(); {187#true} is VALID [2018-11-23 12:02:35,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {187#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {187#true} is VALID [2018-11-23 12:02:35,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {187#true} assume true; {187#true} is VALID [2018-11-23 12:02:35,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {187#true} {187#true} #87#return; {187#true} is VALID [2018-11-23 12:02:35,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {187#true} call #t~ret2 := main(); {187#true} is VALID [2018-11-23 12:02:35,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {187#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {189#(= main_~i~0 0)} is VALID [2018-11-23 12:02:35,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {189#(= main_~i~0 0)} assume !(~i~0 < 100000); {188#false} is VALID [2018-11-23 12:02:35,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {188#false} ~i~0 := 0; {188#false} is VALID [2018-11-23 12:02:35,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {188#false} assume !(~i~0 < 100000); {188#false} is VALID [2018-11-23 12:02:35,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {188#false} ~i~0 := 0; {188#false} is VALID [2018-11-23 12:02:35,839 INFO L273 TraceCheckUtils]: 10: Hoare triple {188#false} assume !(~i~0 < 100000); {188#false} is VALID [2018-11-23 12:02:35,840 INFO L273 TraceCheckUtils]: 11: Hoare triple {188#false} ~i~0 := 0; {188#false} is VALID [2018-11-23 12:02:35,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {188#false} assume !(~i~0 < 100000); {188#false} is VALID [2018-11-23 12:02:35,841 INFO L273 TraceCheckUtils]: 13: Hoare triple {188#false} havoc ~x~0;~x~0 := 0; {188#false} is VALID [2018-11-23 12:02:35,841 INFO L273 TraceCheckUtils]: 14: Hoare triple {188#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {188#false} is VALID [2018-11-23 12:02:35,841 INFO L256 TraceCheckUtils]: 15: Hoare triple {188#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {188#false} is VALID [2018-11-23 12:02:35,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {188#false} ~cond := #in~cond; {188#false} is VALID [2018-11-23 12:02:35,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {188#false} assume 0 == ~cond; {188#false} is VALID [2018-11-23 12:02:35,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {188#false} assume !false; {188#false} is VALID [2018-11-23 12:02:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:35,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:35,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:35,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:02:35,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:35,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:35,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:35,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:35,925 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-23 12:02:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,315 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 12:02:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:36,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:02:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 12:02:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 12:02:36,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-23 12:02:36,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:36,477 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:02:36,477 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:02:36,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:02:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 12:02:36,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:36,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:36,526 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:36,526 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,529 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:02:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:02:36,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,530 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:36,530 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,533 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:02:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:02:36,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:36,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:02:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:02:36,537 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2018-11-23 12:02:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:36,538 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:02:36,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:02:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:02:36,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:36,539 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 12:02:36,540 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:36,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash 47445068, now seen corresponding path program 1 times [2018-11-23 12:02:36,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:36,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:36,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:36,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:36,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 12:02:36,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {357#true} is VALID [2018-11-23 12:02:36,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 12:02:36,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #87#return; {357#true} is VALID [2018-11-23 12:02:36,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret2 := main(); {357#true} is VALID [2018-11-23 12:02:36,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {359#(= main_~i~0 0)} is VALID [2018-11-23 12:02:36,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {359#(= 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; {360#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:36,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {360#(<= main_~i~0 1)} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 12:02:36,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:02:36,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {358#false} is VALID [2018-11-23 12:02:36,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 12:02:36,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:02:36,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {358#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {358#false} is VALID [2018-11-23 12:02:36,660 INFO L273 TraceCheckUtils]: 13: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 12:02:36,661 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:02:36,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {358#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {358#false} is VALID [2018-11-23 12:02:36,662 INFO L273 TraceCheckUtils]: 16: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 12:02:36,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {358#false} havoc ~x~0;~x~0 := 0; {358#false} is VALID [2018-11-23 12:02:36,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {358#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {358#false} is VALID [2018-11-23 12:02:36,663 INFO L256 TraceCheckUtils]: 19: Hoare triple {358#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {358#false} is VALID [2018-11-23 12:02:36,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2018-11-23 12:02:36,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2018-11-23 12:02:36,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 12:02:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:02:36,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:36,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:36,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:36,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:36,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 12:02:36,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {357#true} is VALID [2018-11-23 12:02:36,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 12:02:36,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #87#return; {357#true} is VALID [2018-11-23 12:02:36,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret2 := main(); {357#true} is VALID [2018-11-23 12:02:36,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {357#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {379#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:36,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {379#(<= 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; {360#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:36,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {360#(<= main_~i~0 1)} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 12:02:36,937 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:02:36,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {358#false} is VALID [2018-11-23 12:02:36,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 12:02:36,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:02:36,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {358#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {358#false} is VALID [2018-11-23 12:02:36,938 INFO L273 TraceCheckUtils]: 13: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 12:02:36,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 12:02:36,939 INFO L273 TraceCheckUtils]: 15: Hoare triple {358#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {358#false} is VALID [2018-11-23 12:02:36,939 INFO L273 TraceCheckUtils]: 16: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 12:02:36,940 INFO L273 TraceCheckUtils]: 17: Hoare triple {358#false} havoc ~x~0;~x~0 := 0; {358#false} is VALID [2018-11-23 12:02:36,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {358#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {358#false} is VALID [2018-11-23 12:02:36,941 INFO L256 TraceCheckUtils]: 19: Hoare triple {358#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {358#false} is VALID [2018-11-23 12:02:36,941 INFO L273 TraceCheckUtils]: 20: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2018-11-23 12:02:36,941 INFO L273 TraceCheckUtils]: 21: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2018-11-23 12:02:36,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 12:02:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:02:36,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:36,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:36,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 12:02:36,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:36,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:37,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:37,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:37,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:37,024 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-23 12:02:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,681 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 12:02:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:37,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 12:02:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:02:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:02:37,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 12:02:37,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:37,856 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:02:37,856 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:02:37,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:02:37,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 12:02:37,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:37,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:37,885 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:37,886 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,888 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:02:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:02:37,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,889 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:37,890 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,892 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:02:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:02:37,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:37,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:02:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 12:02:37,901 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2018-11-23 12:02:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:37,902 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 12:02:37,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:02:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:02:37,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:37,903 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:37,903 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:37,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:37,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1810840398, now seen corresponding path program 2 times [2018-11-23 12:02:37,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:37,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:37,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:37,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2018-11-23 12:02:38,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {625#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {625#true} is VALID [2018-11-23 12:02:38,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2018-11-23 12:02:38,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #87#return; {625#true} is VALID [2018-11-23 12:02:38,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret2 := main(); {625#true} is VALID [2018-11-23 12:02:38,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {625#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {627#(= main_~i~0 0)} is VALID [2018-11-23 12:02:38,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {627#(= 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; {628#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:38,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {628#(<= 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; {629#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:38,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 12:02:38,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {626#false} ~i~0 := 0; {626#false} is VALID [2018-11-23 12:02:38,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {626#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {626#false} is VALID [2018-11-23 12:02:38,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {626#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {626#false} is VALID [2018-11-23 12:02:38,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {626#false} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 12:02:38,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {626#false} ~i~0 := 0; {626#false} is VALID [2018-11-23 12:02:38,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {626#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {626#false} is VALID [2018-11-23 12:02:38,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {626#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {626#false} is VALID [2018-11-23 12:02:38,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {626#false} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 12:02:38,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {626#false} ~i~0 := 0; {626#false} is VALID [2018-11-23 12:02:38,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {626#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {626#false} is VALID [2018-11-23 12:02:38,081 INFO L273 TraceCheckUtils]: 19: Hoare triple {626#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {626#false} is VALID [2018-11-23 12:02:38,081 INFO L273 TraceCheckUtils]: 20: Hoare triple {626#false} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 12:02:38,082 INFO L273 TraceCheckUtils]: 21: Hoare triple {626#false} havoc ~x~0;~x~0 := 0; {626#false} is VALID [2018-11-23 12:02:38,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {626#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {626#false} is VALID [2018-11-23 12:02:38,082 INFO L256 TraceCheckUtils]: 23: Hoare triple {626#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {626#false} is VALID [2018-11-23 12:02:38,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {626#false} ~cond := #in~cond; {626#false} is VALID [2018-11-23 12:02:38,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {626#false} assume 0 == ~cond; {626#false} is VALID [2018-11-23 12:02:38,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {626#false} assume !false; {626#false} is VALID [2018-11-23 12:02:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:02:38,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:38,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:38,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:38,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:38,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:38,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2018-11-23 12:02:38,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {625#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {625#true} is VALID [2018-11-23 12:02:38,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2018-11-23 12:02:38,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #87#return; {625#true} is VALID [2018-11-23 12:02:38,286 INFO L256 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret2 := main(); {625#true} is VALID [2018-11-23 12:02:38,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {625#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {625#true} is VALID [2018-11-23 12:02:38,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {625#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {625#true} is VALID [2018-11-23 12:02:38,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {625#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {625#true} is VALID [2018-11-23 12:02:38,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {625#true} assume !(~i~0 < 100000); {625#true} is VALID [2018-11-23 12:02:38,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {625#true} ~i~0 := 0; {625#true} is VALID [2018-11-23 12:02:38,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {625#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {625#true} is VALID [2018-11-23 12:02:38,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {625#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {625#true} is VALID [2018-11-23 12:02:38,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#true} assume !(~i~0 < 100000); {625#true} is VALID [2018-11-23 12:02:38,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#true} ~i~0 := 0; {625#true} is VALID [2018-11-23 12:02:38,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {625#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {625#true} is VALID [2018-11-23 12:02:38,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {625#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {625#true} is VALID [2018-11-23 12:02:38,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {625#true} assume !(~i~0 < 100000); {625#true} is VALID [2018-11-23 12:02:38,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {625#true} ~i~0 := 0; {684#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:38,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {684#(<= 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; {628#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:38,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#(<= 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; {629#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:38,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 12:02:38,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {626#false} havoc ~x~0;~x~0 := 0; {626#false} is VALID [2018-11-23 12:02:38,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {626#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {626#false} is VALID [2018-11-23 12:02:38,310 INFO L256 TraceCheckUtils]: 23: Hoare triple {626#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {626#false} is VALID [2018-11-23 12:02:38,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {626#false} ~cond := #in~cond; {626#false} is VALID [2018-11-23 12:02:38,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {626#false} assume 0 == ~cond; {626#false} is VALID [2018-11-23 12:02:38,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {626#false} assume !false; {626#false} is VALID [2018-11-23 12:02:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:02:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:38,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:38,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 12:02:38,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:38,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:38,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:38,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:38,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:38,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:38,402 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-11-23 12:02:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:38,598 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 12:02:38,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:38,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 12:02:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:02:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:02:38,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 12:02:38,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:38,707 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:02:38,707 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:02:38,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:02:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:02:38,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:38,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:38,736 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:38,736 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:38,739 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 12:02:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:02:38,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:38,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:38,741 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:38,741 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:38,743 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 12:02:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:02:38,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:38,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:38,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:38,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:02:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 12:02:38,746 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 27 [2018-11-23 12:02:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:38,747 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 12:02:38,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 12:02:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:02:38,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:38,748 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:38,749 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:38,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1527698548, now seen corresponding path program 3 times [2018-11-23 12:02:38,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:38,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:38,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:38,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {936#true} call ULTIMATE.init(); {936#true} is VALID [2018-11-23 12:02:38,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {936#true} is VALID [2018-11-23 12:02:38,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {936#true} assume true; {936#true} is VALID [2018-11-23 12:02:38,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {936#true} {936#true} #87#return; {936#true} is VALID [2018-11-23 12:02:38,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {936#true} call #t~ret2 := main(); {936#true} is VALID [2018-11-23 12:02:38,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {936#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {938#(= main_~i~0 0)} is VALID [2018-11-23 12:02:38,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {938#(= 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; {939#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:38,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {939#(<= 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; {940#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:38,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {940#(<= 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; {941#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:38,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {941#(<= main_~i~0 3)} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 12:02:38,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2018-11-23 12:02:38,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:38,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:38,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:38,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {937#false} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 12:02:38,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2018-11-23 12:02:38,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:38,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:38,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:38,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {937#false} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 12:02:38,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2018-11-23 12:02:38,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:38,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:38,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:38,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {937#false} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 12:02:38,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {937#false} havoc ~x~0;~x~0 := 0; {937#false} is VALID [2018-11-23 12:02:38,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {937#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {937#false} is VALID [2018-11-23 12:02:38,888 INFO L256 TraceCheckUtils]: 27: Hoare triple {937#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {937#false} is VALID [2018-11-23 12:02:38,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {937#false} ~cond := #in~cond; {937#false} is VALID [2018-11-23 12:02:38,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {937#false} assume 0 == ~cond; {937#false} is VALID [2018-11-23 12:02:38,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {937#false} assume !false; {937#false} is VALID [2018-11-23 12:02:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:02:38,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:38,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:38,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:38,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:38,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:39,090 INFO L256 TraceCheckUtils]: 0: Hoare triple {936#true} call ULTIMATE.init(); {936#true} is VALID [2018-11-23 12:02:39,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {936#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {936#true} is VALID [2018-11-23 12:02:39,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {936#true} assume true; {936#true} is VALID [2018-11-23 12:02:39,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {936#true} {936#true} #87#return; {936#true} is VALID [2018-11-23 12:02:39,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {936#true} call #t~ret2 := main(); {936#true} is VALID [2018-11-23 12:02:39,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {936#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {936#true} is VALID [2018-11-23 12:02:39,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {936#true} is VALID [2018-11-23 12:02:39,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {936#true} is VALID [2018-11-23 12:02:39,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {936#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {936#true} is VALID [2018-11-23 12:02:39,093 INFO L273 TraceCheckUtils]: 9: Hoare triple {936#true} assume !(~i~0 < 100000); {936#true} is VALID [2018-11-23 12:02:39,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {936#true} ~i~0 := 0; {936#true} is VALID [2018-11-23 12:02:39,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {936#true} is VALID [2018-11-23 12:02:39,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {936#true} is VALID [2018-11-23 12:02:39,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {936#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {936#true} is VALID [2018-11-23 12:02:39,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {936#true} assume !(~i~0 < 100000); {936#true} is VALID [2018-11-23 12:02:39,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {936#true} ~i~0 := 0; {990#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:39,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {990#(<= 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; {939#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:39,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {939#(<= 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; {940#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:39,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {940#(<= 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; {941#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:39,099 INFO L273 TraceCheckUtils]: 19: Hoare triple {941#(<= main_~i~0 3)} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 12:02:39,100 INFO L273 TraceCheckUtils]: 20: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2018-11-23 12:02:39,100 INFO L273 TraceCheckUtils]: 21: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:39,100 INFO L273 TraceCheckUtils]: 22: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:39,100 INFO L273 TraceCheckUtils]: 23: Hoare triple {937#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {937#false} is VALID [2018-11-23 12:02:39,101 INFO L273 TraceCheckUtils]: 24: Hoare triple {937#false} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 12:02:39,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {937#false} havoc ~x~0;~x~0 := 0; {937#false} is VALID [2018-11-23 12:02:39,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {937#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {937#false} is VALID [2018-11-23 12:02:39,101 INFO L256 TraceCheckUtils]: 27: Hoare triple {937#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {937#false} is VALID [2018-11-23 12:02:39,102 INFO L273 TraceCheckUtils]: 28: Hoare triple {937#false} ~cond := #in~cond; {937#false} is VALID [2018-11-23 12:02:39,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {937#false} assume 0 == ~cond; {937#false} is VALID [2018-11-23 12:02:39,102 INFO L273 TraceCheckUtils]: 30: Hoare triple {937#false} assume !false; {937#false} is VALID [2018-11-23 12:02:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:02:39,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:39,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:39,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 12:02:39,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:39,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:39,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:39,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:39,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:39,173 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 7 states. [2018-11-23 12:02:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,412 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-23 12:02:39,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:39,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 12:02:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 12:02:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 12:02:39,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2018-11-23 12:02:39,521 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 12:02:39,523 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:02:39,523 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:02:39,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:02:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:02:39,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:39,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:39,623 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:39,623 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:39,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,626 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:02:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:02:39,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,627 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:39,627 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,629 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:02:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:02:39,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:39,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:02:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 12:02:39,632 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2018-11-23 12:02:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:39,633 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 12:02:39,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:02:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:02:39,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:39,634 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:39,634 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:39,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:39,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1451349618, now seen corresponding path program 4 times [2018-11-23 12:02:39,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:39,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:39,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:39,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {1290#true} call ULTIMATE.init(); {1290#true} is VALID [2018-11-23 12:02:39,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {1290#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1290#true} is VALID [2018-11-23 12:02:39,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {1290#true} assume true; {1290#true} is VALID [2018-11-23 12:02:39,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1290#true} {1290#true} #87#return; {1290#true} is VALID [2018-11-23 12:02:39,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {1290#true} call #t~ret2 := main(); {1290#true} is VALID [2018-11-23 12:02:39,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {1290#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1292#(= main_~i~0 0)} is VALID [2018-11-23 12:02:39,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {1292#(= 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; {1293#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:39,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {1293#(<= 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; {1294#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:39,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {1294#(<= 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; {1295#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:39,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {1295#(<= 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; {1296#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:39,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {1296#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 12:02:39,922 INFO L273 TraceCheckUtils]: 11: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 12:02:39,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 12:02:39,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 12:02:39,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 12:02:39,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 12:02:39,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:39,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 12:02:39,927 INFO L273 TraceCheckUtils]: 29: Hoare triple {1291#false} havoc ~x~0;~x~0 := 0; {1291#false} is VALID [2018-11-23 12:02:39,927 INFO L273 TraceCheckUtils]: 30: Hoare triple {1291#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1291#false} is VALID [2018-11-23 12:02:39,927 INFO L256 TraceCheckUtils]: 31: Hoare triple {1291#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1291#false} is VALID [2018-11-23 12:02:39,928 INFO L273 TraceCheckUtils]: 32: Hoare triple {1291#false} ~cond := #in~cond; {1291#false} is VALID [2018-11-23 12:02:39,928 INFO L273 TraceCheckUtils]: 33: Hoare triple {1291#false} assume 0 == ~cond; {1291#false} is VALID [2018-11-23 12:02:39,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {1291#false} assume !false; {1291#false} is VALID [2018-11-23 12:02:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:02:39,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:39,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:39,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:39,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:39,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:40,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:40,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {1290#true} call ULTIMATE.init(); {1290#true} is VALID [2018-11-23 12:02:40,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {1290#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1290#true} is VALID [2018-11-23 12:02:40,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {1290#true} assume true; {1290#true} is VALID [2018-11-23 12:02:40,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1290#true} {1290#true} #87#return; {1290#true} is VALID [2018-11-23 12:02:40,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {1290#true} call #t~ret2 := main(); {1290#true} is VALID [2018-11-23 12:02:40,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {1290#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1315#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:40,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {1315#(<= 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; {1293#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:40,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {1293#(<= 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; {1294#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:40,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {1294#(<= 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; {1295#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:40,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {1295#(<= 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; {1296#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:40,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {1296#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 12:02:40,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 12:02:40,189 INFO L273 TraceCheckUtils]: 12: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,190 INFO L273 TraceCheckUtils]: 13: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 12:02:40,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 12:02:40,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,192 INFO L273 TraceCheckUtils]: 19: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,192 INFO L273 TraceCheckUtils]: 20: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,193 INFO L273 TraceCheckUtils]: 22: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 12:02:40,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 12:02:40,194 INFO L273 TraceCheckUtils]: 24: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {1291#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1291#false} is VALID [2018-11-23 12:02:40,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 12:02:40,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {1291#false} havoc ~x~0;~x~0 := 0; {1291#false} is VALID [2018-11-23 12:02:40,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {1291#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1291#false} is VALID [2018-11-23 12:02:40,195 INFO L256 TraceCheckUtils]: 31: Hoare triple {1291#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1291#false} is VALID [2018-11-23 12:02:40,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {1291#false} ~cond := #in~cond; {1291#false} is VALID [2018-11-23 12:02:40,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {1291#false} assume 0 == ~cond; {1291#false} is VALID [2018-11-23 12:02:40,196 INFO L273 TraceCheckUtils]: 34: Hoare triple {1291#false} assume !false; {1291#false} is VALID [2018-11-23 12:02:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:02:40,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:40,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:40,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-23 12:02:40,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:40,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:40,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:40,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:40,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:40,285 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 8 states. [2018-11-23 12:02:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,490 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-23 12:02:40,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:40,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-23 12:02:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 12:02:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 12:02:40,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-23 12:02:40,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,588 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:02:40,588 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:02:40,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:02:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 12:02:40,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:40,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,642 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,642 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,644 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 12:02:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 12:02:40,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,645 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,646 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,648 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 12:02:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 12:02:40,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:40,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:02:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 12:02:40,651 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 35 [2018-11-23 12:02:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:40,652 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 12:02:40,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 12:02:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:02:40,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:40,653 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:40,653 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:40,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2058629836, now seen corresponding path program 5 times [2018-11-23 12:02:40,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:40,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:40,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 12:02:40,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1687#true} is VALID [2018-11-23 12:02:40,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 12:02:40,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #87#return; {1687#true} is VALID [2018-11-23 12:02:40,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret2 := main(); {1687#true} is VALID [2018-11-23 12:02:40,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1689#(= main_~i~0 0)} is VALID [2018-11-23 12:02:40,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {1689#(= 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; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:40,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {1690#(<= 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; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:40,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {1691#(<= 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; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:40,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {1692#(<= 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; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:40,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {1693#(<= 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; {1694#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:40,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:40,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 12:02:40,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:40,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 12:02:40,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,908 INFO L273 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:40,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 12:02:40,909 INFO L273 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,909 INFO L273 TraceCheckUtils]: 28: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,909 INFO L273 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,909 INFO L273 TraceCheckUtils]: 30: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:40,910 INFO L273 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:40,910 INFO L273 TraceCheckUtils]: 33: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 12:02:40,910 INFO L273 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1688#false} is VALID [2018-11-23 12:02:40,910 INFO L256 TraceCheckUtils]: 35: Hoare triple {1688#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1688#false} is VALID [2018-11-23 12:02:40,910 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 12:02:40,911 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 12:02:40,911 INFO L273 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 12:02:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:02:40,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:40,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:40,929 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:41,280 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:02:41,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:41,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:41,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 12:02:41,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1687#true} is VALID [2018-11-23 12:02:41,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 12:02:41,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #87#return; {1687#true} is VALID [2018-11-23 12:02:41,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret2 := main(); {1687#true} is VALID [2018-11-23 12:02:41,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1687#true} is VALID [2018-11-23 12:02:41,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 12:02:41,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {1687#true} ~i~0 := 0; {1687#true} is VALID [2018-11-23 12:02:41,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1687#true} is VALID [2018-11-23 12:02:41,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 12:02:41,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {1687#true} ~i~0 := 0; {1755#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:41,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {1755#(<= 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; {1690#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:41,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {1690#(<= 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; {1691#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:41,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {1691#(<= 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; {1692#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:41,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {1692#(<= 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; {1693#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:41,411 INFO L273 TraceCheckUtils]: 24: Hoare triple {1693#(<= 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; {1694#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:41,412 INFO L273 TraceCheckUtils]: 25: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:41,413 INFO L273 TraceCheckUtils]: 26: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 12:02:41,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:41,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:41,413 INFO L273 TraceCheckUtils]: 29: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:41,414 INFO L273 TraceCheckUtils]: 30: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:41,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1688#false} is VALID [2018-11-23 12:02:41,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 12:02:41,415 INFO L273 TraceCheckUtils]: 33: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 12:02:41,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {1688#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1688#false} is VALID [2018-11-23 12:02:41,415 INFO L256 TraceCheckUtils]: 35: Hoare triple {1688#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {1688#false} is VALID [2018-11-23 12:02:41,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 12:02:41,416 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 12:02:41,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 12:02:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:02:41,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:41,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:02:41,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 12:02:41,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:41,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:02:41,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:02:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:02:41,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:41,483 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 9 states. [2018-11-23 12:02:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,856 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-11-23 12:02:41,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:02:41,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 12:02:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 12:02:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 12:02:41,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2018-11-23 12:02:41,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,994 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:02:41,994 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:02:41,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 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 12:02:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:02:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:02:42,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:42,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:42,032 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:42,032 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,034 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 12:02:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 12:02:42,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,035 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:42,035 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:02:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:42,038 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 12:02:42,038 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 12:02:42,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:42,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:42,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:42,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:02:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-23 12:02:42,059 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 39 [2018-11-23 12:02:42,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:42,059 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-23 12:02:42,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:02:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 12:02:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:02:42,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:42,061 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:42,061 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:42,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1129940942, now seen corresponding path program 6 times [2018-11-23 12:02:42,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:42,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {2127#true} call ULTIMATE.init(); {2127#true} is VALID [2018-11-23 12:02:42,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {2127#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2127#true} is VALID [2018-11-23 12:02:42,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {2127#true} assume true; {2127#true} is VALID [2018-11-23 12:02:42,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2127#true} {2127#true} #87#return; {2127#true} is VALID [2018-11-23 12:02:42,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {2127#true} call #t~ret2 := main(); {2127#true} is VALID [2018-11-23 12:02:42,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {2127#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2129#(= main_~i~0 0)} is VALID [2018-11-23 12:02:42,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {2129#(= 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; {2130#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:42,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {2130#(<= 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; {2131#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:42,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {2131#(<= 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; {2132#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:42,336 INFO L273 TraceCheckUtils]: 9: Hoare triple {2132#(<= 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; {2133#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:42,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {2133#(<= 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; {2134#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:42,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {2134#(<= 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; {2135#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:42,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {2135#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 12:02:42,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 12:02:42,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,338 INFO L273 TraceCheckUtils]: 15: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,339 INFO L273 TraceCheckUtils]: 20: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 12:02:42,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 12:02:42,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,340 INFO L273 TraceCheckUtils]: 24: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,340 INFO L273 TraceCheckUtils]: 27: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,341 INFO L273 TraceCheckUtils]: 28: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 12:02:42,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 12:02:42,341 INFO L273 TraceCheckUtils]: 30: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,341 INFO L273 TraceCheckUtils]: 31: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,341 INFO L273 TraceCheckUtils]: 32: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,342 INFO L273 TraceCheckUtils]: 34: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,342 INFO L273 TraceCheckUtils]: 35: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:42,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 12:02:42,342 INFO L273 TraceCheckUtils]: 37: Hoare triple {2128#false} havoc ~x~0;~x~0 := 0; {2128#false} is VALID [2018-11-23 12:02:42,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {2128#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2128#false} is VALID [2018-11-23 12:02:42,343 INFO L256 TraceCheckUtils]: 39: Hoare triple {2128#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2128#false} is VALID [2018-11-23 12:02:42,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {2128#false} ~cond := #in~cond; {2128#false} is VALID [2018-11-23 12:02:42,343 INFO L273 TraceCheckUtils]: 41: Hoare triple {2128#false} assume 0 == ~cond; {2128#false} is VALID [2018-11-23 12:02:42,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {2128#false} assume !false; {2128#false} is VALID [2018-11-23 12:02:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 12:02:42,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:42,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:42,355 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:42,782 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:02:42,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:43,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {2127#true} call ULTIMATE.init(); {2127#true} is VALID [2018-11-23 12:02:43,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {2127#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2127#true} is VALID [2018-11-23 12:02:43,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {2127#true} assume true; {2127#true} is VALID [2018-11-23 12:02:43,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2127#true} {2127#true} #87#return; {2127#true} is VALID [2018-11-23 12:02:43,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {2127#true} call #t~ret2 := main(); {2127#true} is VALID [2018-11-23 12:02:43,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {2127#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2154#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:43,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {2154#(<= 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; {2130#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {2130#(<= 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; {2131#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:43,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {2131#(<= 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; {2132#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:43,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {2132#(<= 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; {2133#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:43,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {2133#(<= 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; {2134#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:43,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {2134#(<= 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; {2135#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:43,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {2135#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 12:02:43,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 12:02:43,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 12:02:43,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 12:02:43,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 12:02:43,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 12:02:43,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,375 INFO L273 TraceCheckUtils]: 32: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,375 INFO L273 TraceCheckUtils]: 33: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,375 INFO L273 TraceCheckUtils]: 34: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,375 INFO L273 TraceCheckUtils]: 35: Hoare triple {2128#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2128#false} is VALID [2018-11-23 12:02:43,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 12:02:43,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {2128#false} havoc ~x~0;~x~0 := 0; {2128#false} is VALID [2018-11-23 12:02:43,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {2128#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2128#false} is VALID [2018-11-23 12:02:43,376 INFO L256 TraceCheckUtils]: 39: Hoare triple {2128#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2128#false} is VALID [2018-11-23 12:02:43,376 INFO L273 TraceCheckUtils]: 40: Hoare triple {2128#false} ~cond := #in~cond; {2128#false} is VALID [2018-11-23 12:02:43,376 INFO L273 TraceCheckUtils]: 41: Hoare triple {2128#false} assume 0 == ~cond; {2128#false} is VALID [2018-11-23 12:02:43,376 INFO L273 TraceCheckUtils]: 42: Hoare triple {2128#false} assume !false; {2128#false} is VALID [2018-11-23 12:02:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 12:02:43,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:43,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:02:43,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-23 12:02:43,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:43,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:02:43,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:43,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:02:43,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:02:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:43,440 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2018-11-23 12:02:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:43,868 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-23 12:02:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:02:43,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-23 12:02:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 12:02:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 12:02:43,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 80 transitions. [2018-11-23 12:02:44,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:44,009 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:02:44,009 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:02:44,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:02:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 12:02:44,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:44,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:44,067 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:44,067 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,069 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:02:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:02:44,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,070 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:44,070 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:02:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,072 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:02:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:02:44,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:44,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:02:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-23 12:02:44,075 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 43 [2018-11-23 12:02:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:44,075 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 12:02:44,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:02:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:02:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:02:44,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:44,076 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:44,076 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:44,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:44,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2092627444, now seen corresponding path program 7 times [2018-11-23 12:02:44,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:44,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {2610#true} call ULTIMATE.init(); {2610#true} is VALID [2018-11-23 12:02:44,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {2610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2610#true} is VALID [2018-11-23 12:02:44,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {2610#true} assume true; {2610#true} is VALID [2018-11-23 12:02:44,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2610#true} {2610#true} #87#return; {2610#true} is VALID [2018-11-23 12:02:44,420 INFO L256 TraceCheckUtils]: 4: Hoare triple {2610#true} call #t~ret2 := main(); {2610#true} is VALID [2018-11-23 12:02:44,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {2610#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2612#(= main_~i~0 0)} is VALID [2018-11-23 12:02:44,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {2612#(= 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; {2613#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {2613#(<= 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; {2614#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,426 INFO L273 TraceCheckUtils]: 8: Hoare triple {2614#(<= 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; {2615#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:44,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {2615#(<= 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; {2616#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:44,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {2616#(<= 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; {2617#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:44,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {2617#(<= 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; {2618#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:44,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {2618#(<= 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; {2619#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:44,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {2619#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 12:02:44,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 12:02:44,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,445 INFO L273 TraceCheckUtils]: 21: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,445 INFO L273 TraceCheckUtils]: 22: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 12:02:44,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 12:02:44,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 12:02:44,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 12:02:44,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,447 INFO L273 TraceCheckUtils]: 34: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,447 INFO L273 TraceCheckUtils]: 35: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,448 INFO L273 TraceCheckUtils]: 38: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,448 INFO L273 TraceCheckUtils]: 39: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,448 INFO L273 TraceCheckUtils]: 40: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 12:02:44,448 INFO L273 TraceCheckUtils]: 41: Hoare triple {2611#false} havoc ~x~0;~x~0 := 0; {2611#false} is VALID [2018-11-23 12:02:44,449 INFO L273 TraceCheckUtils]: 42: Hoare triple {2611#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2611#false} is VALID [2018-11-23 12:02:44,449 INFO L256 TraceCheckUtils]: 43: Hoare triple {2611#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2611#false} is VALID [2018-11-23 12:02:44,449 INFO L273 TraceCheckUtils]: 44: Hoare triple {2611#false} ~cond := #in~cond; {2611#false} is VALID [2018-11-23 12:02:44,449 INFO L273 TraceCheckUtils]: 45: Hoare triple {2611#false} assume 0 == ~cond; {2611#false} is VALID [2018-11-23 12:02:44,449 INFO L273 TraceCheckUtils]: 46: Hoare triple {2611#false} assume !false; {2611#false} is VALID [2018-11-23 12:02:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 12:02:44,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:44,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:44,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:44,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {2610#true} call ULTIMATE.init(); {2610#true} is VALID [2018-11-23 12:02:44,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {2610#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2610#true} is VALID [2018-11-23 12:02:44,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {2610#true} assume true; {2610#true} is VALID [2018-11-23 12:02:44,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2610#true} {2610#true} #87#return; {2610#true} is VALID [2018-11-23 12:02:44,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {2610#true} call #t~ret2 := main(); {2610#true} is VALID [2018-11-23 12:02:44,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {2610#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2638#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:44,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {2638#(<= 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; {2613#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:44,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {2613#(<= 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; {2614#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:44,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {2614#(<= 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; {2615#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:44,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {2615#(<= 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; {2616#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:44,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {2616#(<= 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; {2617#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:44,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {2617#(<= 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; {2618#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:44,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {2618#(<= 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; {2619#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:44,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {2619#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 12:02:44,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 12:02:44,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 12:02:44,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 12:02:44,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 12:02:44,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 12:02:44,632 INFO L273 TraceCheckUtils]: 33: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,632 INFO L273 TraceCheckUtils]: 34: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,632 INFO L273 TraceCheckUtils]: 35: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,633 INFO L273 TraceCheckUtils]: 36: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,633 INFO L273 TraceCheckUtils]: 37: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,633 INFO L273 TraceCheckUtils]: 39: Hoare triple {2611#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2611#false} is VALID [2018-11-23 12:02:44,633 INFO L273 TraceCheckUtils]: 40: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 12:02:44,634 INFO L273 TraceCheckUtils]: 41: Hoare triple {2611#false} havoc ~x~0;~x~0 := 0; {2611#false} is VALID [2018-11-23 12:02:44,634 INFO L273 TraceCheckUtils]: 42: Hoare triple {2611#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2611#false} is VALID [2018-11-23 12:02:44,634 INFO L256 TraceCheckUtils]: 43: Hoare triple {2611#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {2611#false} is VALID [2018-11-23 12:02:44,634 INFO L273 TraceCheckUtils]: 44: Hoare triple {2611#false} ~cond := #in~cond; {2611#false} is VALID [2018-11-23 12:02:44,634 INFO L273 TraceCheckUtils]: 45: Hoare triple {2611#false} assume 0 == ~cond; {2611#false} is VALID [2018-11-23 12:02:44,635 INFO L273 TraceCheckUtils]: 46: Hoare triple {2611#false} assume !false; {2611#false} is VALID [2018-11-23 12:02:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 12:02:44,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:44,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:02:44,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-23 12:02:44,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:44,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:02:44,679 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 12:02:44,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:02:44,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:02:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:44,680 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 11 states. [2018-11-23 12:02:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,315 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-11-23 12:02:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:02:45,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-23 12:02:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-23 12:02:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-23 12:02:45,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 84 transitions. [2018-11-23 12:02:45,411 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 12:02:45,413 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:02:45,413 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:02:45,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:02:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 12:02:45,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:45,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,512 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,512 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,515 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-23 12:02:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 12:02:45,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,517 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,517 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:02:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,518 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-23 12:02:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 12:02:45,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:45,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:45,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:45,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:02:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-23 12:02:45,521 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 47 [2018-11-23 12:02:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:45,521 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-23 12:02:45,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:02:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 12:02:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:02:45,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:45,522 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:45,522 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:45,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:45,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2092520974, now seen corresponding path program 8 times [2018-11-23 12:02:45,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:45,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:45,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {3136#true} call ULTIMATE.init(); {3136#true} is VALID [2018-11-23 12:02:45,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {3136#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3136#true} is VALID [2018-11-23 12:02:45,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {3136#true} assume true; {3136#true} is VALID [2018-11-23 12:02:45,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3136#true} {3136#true} #87#return; {3136#true} is VALID [2018-11-23 12:02:45,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {3136#true} call #t~ret2 := main(); {3136#true} is VALID [2018-11-23 12:02:45,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {3136#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3138#(= main_~i~0 0)} is VALID [2018-11-23 12:02:45,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {3138#(= 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; {3139#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:45,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {3139#(<= 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; {3140#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:45,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {3140#(<= 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; {3141#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:45,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {3141#(<= 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; {3142#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:45,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {3142#(<= 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; {3143#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:45,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {3143#(<= 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; {3144#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:45,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {3144#(<= 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; {3145#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:45,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {3145#(<= 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; {3146#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:45,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {3146#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 12:02:45,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 12:02:45,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 12:02:45,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 12:02:45,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,771 INFO L273 TraceCheckUtils]: 27: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,771 INFO L273 TraceCheckUtils]: 28: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,771 INFO L273 TraceCheckUtils]: 29: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,772 INFO L273 TraceCheckUtils]: 30: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,772 INFO L273 TraceCheckUtils]: 31: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,772 INFO L273 TraceCheckUtils]: 33: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,772 INFO L273 TraceCheckUtils]: 34: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 12:02:45,772 INFO L273 TraceCheckUtils]: 35: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 12:02:45,773 INFO L273 TraceCheckUtils]: 36: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,773 INFO L273 TraceCheckUtils]: 37: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,773 INFO L273 TraceCheckUtils]: 38: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,773 INFO L273 TraceCheckUtils]: 39: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,773 INFO L273 TraceCheckUtils]: 41: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,774 INFO L273 TraceCheckUtils]: 42: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,774 INFO L273 TraceCheckUtils]: 43: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 12:02:45,774 INFO L273 TraceCheckUtils]: 45: Hoare triple {3137#false} havoc ~x~0;~x~0 := 0; {3137#false} is VALID [2018-11-23 12:02:45,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {3137#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3137#false} is VALID [2018-11-23 12:02:45,775 INFO L256 TraceCheckUtils]: 47: Hoare triple {3137#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3137#false} is VALID [2018-11-23 12:02:45,775 INFO L273 TraceCheckUtils]: 48: Hoare triple {3137#false} ~cond := #in~cond; {3137#false} is VALID [2018-11-23 12:02:45,775 INFO L273 TraceCheckUtils]: 49: Hoare triple {3137#false} assume 0 == ~cond; {3137#false} is VALID [2018-11-23 12:02:45,775 INFO L273 TraceCheckUtils]: 50: Hoare triple {3137#false} assume !false; {3137#false} is VALID [2018-11-23 12:02:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 12:02:45,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:45,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:45,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:45,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:45,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:45,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {3136#true} call ULTIMATE.init(); {3136#true} is VALID [2018-11-23 12:02:45,954 INFO L273 TraceCheckUtils]: 1: Hoare triple {3136#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3136#true} is VALID [2018-11-23 12:02:45,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {3136#true} assume true; {3136#true} is VALID [2018-11-23 12:02:45,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3136#true} {3136#true} #87#return; {3136#true} is VALID [2018-11-23 12:02:45,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {3136#true} call #t~ret2 := main(); {3136#true} is VALID [2018-11-23 12:02:45,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {3136#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3165#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:45,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {3165#(<= 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; {3139#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:45,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {3139#(<= 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; {3140#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:45,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {3140#(<= 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; {3141#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:45,958 INFO L273 TraceCheckUtils]: 9: Hoare triple {3141#(<= 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; {3142#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:45,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {3142#(<= 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; {3143#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:45,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {3143#(<= 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; {3144#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:45,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {3144#(<= 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; {3145#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:45,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {3145#(<= 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; {3146#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:45,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {3146#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 12:02:45,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 12:02:45,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,963 INFO L273 TraceCheckUtils]: 23: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 12:02:45,964 INFO L273 TraceCheckUtils]: 25: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 12:02:45,964 INFO L273 TraceCheckUtils]: 26: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,964 INFO L273 TraceCheckUtils]: 27: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,965 INFO L273 TraceCheckUtils]: 33: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 12:02:45,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 12:02:45,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,965 INFO L273 TraceCheckUtils]: 37: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,965 INFO L273 TraceCheckUtils]: 39: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,966 INFO L273 TraceCheckUtils]: 40: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,966 INFO L273 TraceCheckUtils]: 41: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,966 INFO L273 TraceCheckUtils]: 43: Hoare triple {3137#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3137#false} is VALID [2018-11-23 12:02:45,966 INFO L273 TraceCheckUtils]: 44: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 12:02:45,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {3137#false} havoc ~x~0;~x~0 := 0; {3137#false} is VALID [2018-11-23 12:02:45,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {3137#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3137#false} is VALID [2018-11-23 12:02:45,966 INFO L256 TraceCheckUtils]: 47: Hoare triple {3137#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3137#false} is VALID [2018-11-23 12:02:45,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {3137#false} ~cond := #in~cond; {3137#false} is VALID [2018-11-23 12:02:45,967 INFO L273 TraceCheckUtils]: 49: Hoare triple {3137#false} assume 0 == ~cond; {3137#false} is VALID [2018-11-23 12:02:45,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {3137#false} assume !false; {3137#false} is VALID [2018-11-23 12:02:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 12:02:45,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:45,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:02:45,997 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-23 12:02:45,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:45,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:02:46,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:46,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:02:46,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:02:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:46,033 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 12 states. [2018-11-23 12:02:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,379 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-11-23 12:02:46,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:02:46,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-23 12:02:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-23 12:02:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-23 12:02:46,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-23 12:02:46,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:46,472 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:02:46,473 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:02:46,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:02:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 12:02:46,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:46,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 12:02:46,515 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 12:02:46,516 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 12:02:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,517 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-23 12:02:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 12:02:46,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:46,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:46,518 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 12:02:46,518 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 12:02:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,519 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-23 12:02:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 12:02:46,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:46,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:46,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:46,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:02:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-23 12:02:46,520 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 51 [2018-11-23 12:02:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:46,521 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-23 12:02:46,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:02:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 12:02:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:02:46,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:46,521 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:46,522 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:46,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1825288524, now seen corresponding path program 9 times [2018-11-23 12:02:46,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:46,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:46,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:46,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:46,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:46,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {3705#true} call ULTIMATE.init(); {3705#true} is VALID [2018-11-23 12:02:46,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {3705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3705#true} is VALID [2018-11-23 12:02:46,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {3705#true} assume true; {3705#true} is VALID [2018-11-23 12:02:46,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3705#true} {3705#true} #87#return; {3705#true} is VALID [2018-11-23 12:02:46,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {3705#true} call #t~ret2 := main(); {3705#true} is VALID [2018-11-23 12:02:46,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {3705#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3707#(= main_~i~0 0)} is VALID [2018-11-23 12:02:46,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {3707#(= 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; {3708#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:46,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {3708#(<= 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; {3709#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:46,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {3709#(<= 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; {3710#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:46,769 INFO L273 TraceCheckUtils]: 9: Hoare triple {3710#(<= 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; {3711#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:46,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {3711#(<= 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; {3712#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:46,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {3712#(<= 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; {3713#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:46,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {3713#(<= 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; {3714#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:46,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {3714#(<= 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; {3715#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:46,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {3715#(<= 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; {3716#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:46,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 12:02:46,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {3706#false} ~i~0 := 0; {3706#false} is VALID [2018-11-23 12:02:46,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,787 INFO L273 TraceCheckUtils]: 20: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,787 INFO L273 TraceCheckUtils]: 21: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,788 INFO L273 TraceCheckUtils]: 25: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {3706#false} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 12:02:46,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {3706#false} ~i~0 := 0; {3706#false} is VALID [2018-11-23 12:02:46,788 INFO L273 TraceCheckUtils]: 28: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,788 INFO L273 TraceCheckUtils]: 29: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,788 INFO L273 TraceCheckUtils]: 30: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,788 INFO L273 TraceCheckUtils]: 31: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,788 INFO L273 TraceCheckUtils]: 32: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,789 INFO L273 TraceCheckUtils]: 33: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,789 INFO L273 TraceCheckUtils]: 34: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,789 INFO L273 TraceCheckUtils]: 35: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,789 INFO L273 TraceCheckUtils]: 36: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {3706#false} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 12:02:46,790 INFO L273 TraceCheckUtils]: 38: Hoare triple {3706#false} ~i~0 := 0; {3706#false} is VALID [2018-11-23 12:02:46,790 INFO L273 TraceCheckUtils]: 39: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,790 INFO L273 TraceCheckUtils]: 40: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,790 INFO L273 TraceCheckUtils]: 41: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,790 INFO L273 TraceCheckUtils]: 42: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,790 INFO L273 TraceCheckUtils]: 43: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,791 INFO L273 TraceCheckUtils]: 45: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,791 INFO L273 TraceCheckUtils]: 46: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,791 INFO L273 TraceCheckUtils]: 47: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:46,791 INFO L273 TraceCheckUtils]: 48: Hoare triple {3706#false} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 12:02:46,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {3706#false} havoc ~x~0;~x~0 := 0; {3706#false} is VALID [2018-11-23 12:02:46,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {3706#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3706#false} is VALID [2018-11-23 12:02:46,792 INFO L256 TraceCheckUtils]: 51: Hoare triple {3706#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3706#false} is VALID [2018-11-23 12:02:46,792 INFO L273 TraceCheckUtils]: 52: Hoare triple {3706#false} ~cond := #in~cond; {3706#false} is VALID [2018-11-23 12:02:46,792 INFO L273 TraceCheckUtils]: 53: Hoare triple {3706#false} assume 0 == ~cond; {3706#false} is VALID [2018-11-23 12:02:46,792 INFO L273 TraceCheckUtils]: 54: Hoare triple {3706#false} assume !false; {3706#false} is VALID [2018-11-23 12:02:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 12:02:46,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:46,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:46,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:48,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:02:48,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:48,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:48,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {3705#true} call ULTIMATE.init(); {3705#true} is VALID [2018-11-23 12:02:48,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {3705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3705#true} is VALID [2018-11-23 12:02:48,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {3705#true} assume true; {3705#true} is VALID [2018-11-23 12:02:48,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3705#true} {3705#true} #87#return; {3705#true} is VALID [2018-11-23 12:02:48,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {3705#true} call #t~ret2 := main(); {3705#true} is VALID [2018-11-23 12:02:48,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {3705#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3705#true} is VALID [2018-11-23 12:02:48,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 12: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {3705#true} assume !(~i~0 < 100000); {3705#true} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {3705#true} ~i~0 := 0; {3705#true} is VALID [2018-11-23 12:02:48,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 22: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 24: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {3705#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3705#true} is VALID [2018-11-23 12:02:48,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {3705#true} assume !(~i~0 < 100000); {3705#true} is VALID [2018-11-23 12:02:48,895 INFO L273 TraceCheckUtils]: 27: Hoare triple {3705#true} ~i~0 := 0; {3801#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:48,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {3801#(<= 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; {3708#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:48,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {3708#(<= 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; {3709#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:48,897 INFO L273 TraceCheckUtils]: 30: Hoare triple {3709#(<= 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; {3710#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:48,897 INFO L273 TraceCheckUtils]: 31: Hoare triple {3710#(<= 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; {3711#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:48,898 INFO L273 TraceCheckUtils]: 32: Hoare triple {3711#(<= 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; {3712#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:48,899 INFO L273 TraceCheckUtils]: 33: Hoare triple {3712#(<= 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; {3713#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:48,899 INFO L273 TraceCheckUtils]: 34: Hoare triple {3713#(<= 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; {3714#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:48,900 INFO L273 TraceCheckUtils]: 35: Hoare triple {3714#(<= 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; {3715#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:48,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {3715#(<= 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; {3716#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:48,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {3716#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 12:02:48,902 INFO L273 TraceCheckUtils]: 38: Hoare triple {3706#false} ~i~0 := 0; {3706#false} is VALID [2018-11-23 12:02:48,902 INFO L273 TraceCheckUtils]: 39: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:48,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 41: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 42: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 43: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 44: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:48,903 INFO L273 TraceCheckUtils]: 45: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 46: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 47: Hoare triple {3706#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3706#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 48: Hoare triple {3706#false} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 49: Hoare triple {3706#false} havoc ~x~0;~x~0 := 0; {3706#false} is VALID [2018-11-23 12:02:48,904 INFO L273 TraceCheckUtils]: 50: Hoare triple {3706#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3706#false} is VALID [2018-11-23 12:02:48,905 INFO L256 TraceCheckUtils]: 51: Hoare triple {3706#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {3706#false} is VALID [2018-11-23 12:02:48,905 INFO L273 TraceCheckUtils]: 52: Hoare triple {3706#false} ~cond := #in~cond; {3706#false} is VALID [2018-11-23 12:02:48,905 INFO L273 TraceCheckUtils]: 53: Hoare triple {3706#false} assume 0 == ~cond; {3706#false} is VALID [2018-11-23 12:02:48,905 INFO L273 TraceCheckUtils]: 54: Hoare triple {3706#false} assume !false; {3706#false} is VALID [2018-11-23 12:02:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 12:02:48,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:48,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:02:48,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-23 12:02:48,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:48,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:02:48,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:48,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:02:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:02:48,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:02:48,995 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 13 states. [2018-11-23 12:02:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,311 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-11-23 12:02:49,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:02:49,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-23 12:02:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 92 transitions. [2018-11-23 12:02:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 92 transitions. [2018-11-23 12:02:49,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 92 transitions. [2018-11-23 12:02:49,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:49,439 INFO L225 Difference]: With dead ends: 108 [2018-11-23 12:02:49,439 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:02:49,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:02:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:02:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 12:02:49,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:49,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:49,478 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:49,478 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,480 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 12:02:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 12:02:49,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,481 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:49,481 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 12:02:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,482 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 12:02:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 12:02:49,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:49,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:02:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-23 12:02:49,484 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 55 [2018-11-23 12:02:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:49,485 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-23 12:02:49,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:02:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 12:02:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:02:49,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:49,486 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:49,486 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:49,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1177185202, now seen corresponding path program 10 times [2018-11-23 12:02:49,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:49,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:49,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:50,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {4317#true} call ULTIMATE.init(); {4317#true} is VALID [2018-11-23 12:02:50,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {4317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4317#true} is VALID [2018-11-23 12:02:50,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {4317#true} assume true; {4317#true} is VALID [2018-11-23 12:02:50,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4317#true} {4317#true} #87#return; {4317#true} is VALID [2018-11-23 12:02:50,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {4317#true} call #t~ret2 := main(); {4317#true} is VALID [2018-11-23 12:02:50,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {4317#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4319#(= main_~i~0 0)} is VALID [2018-11-23 12:02:50,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {4319#(= 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; {4320#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:50,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {4320#(<= 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; {4321#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:50,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {4321#(<= 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; {4322#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:50,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {4322#(<= 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; {4323#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:50,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {4323#(<= 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; {4324#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:50,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {4324#(<= 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; {4325#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:50,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {4325#(<= 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; {4326#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:50,344 INFO L273 TraceCheckUtils]: 13: Hoare triple {4326#(<= 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; {4327#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:50,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {4327#(<= 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; {4328#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:50,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {4328#(<= 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; {4329#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:50,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {4329#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 12:02:50,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 12:02:50,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,349 INFO L273 TraceCheckUtils]: 26: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,349 INFO L273 TraceCheckUtils]: 27: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 12:02:50,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 12:02:50,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,350 INFO L273 TraceCheckUtils]: 33: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,351 INFO L273 TraceCheckUtils]: 34: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,351 INFO L273 TraceCheckUtils]: 35: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,351 INFO L273 TraceCheckUtils]: 36: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,351 INFO L273 TraceCheckUtils]: 37: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,351 INFO L273 TraceCheckUtils]: 38: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,351 INFO L273 TraceCheckUtils]: 39: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,352 INFO L273 TraceCheckUtils]: 40: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 12:02:50,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 12:02:50,352 INFO L273 TraceCheckUtils]: 42: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,352 INFO L273 TraceCheckUtils]: 43: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,353 INFO L273 TraceCheckUtils]: 44: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,353 INFO L273 TraceCheckUtils]: 45: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,353 INFO L273 TraceCheckUtils]: 46: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,353 INFO L273 TraceCheckUtils]: 47: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,354 INFO L273 TraceCheckUtils]: 49: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,354 INFO L273 TraceCheckUtils]: 50: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,354 INFO L273 TraceCheckUtils]: 51: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,354 INFO L273 TraceCheckUtils]: 52: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 12:02:50,355 INFO L273 TraceCheckUtils]: 53: Hoare triple {4318#false} havoc ~x~0;~x~0 := 0; {4318#false} is VALID [2018-11-23 12:02:50,355 INFO L273 TraceCheckUtils]: 54: Hoare triple {4318#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4318#false} is VALID [2018-11-23 12:02:50,355 INFO L256 TraceCheckUtils]: 55: Hoare triple {4318#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {4318#false} is VALID [2018-11-23 12:02:50,355 INFO L273 TraceCheckUtils]: 56: Hoare triple {4318#false} ~cond := #in~cond; {4318#false} is VALID [2018-11-23 12:02:50,356 INFO L273 TraceCheckUtils]: 57: Hoare triple {4318#false} assume 0 == ~cond; {4318#false} is VALID [2018-11-23 12:02:50,356 INFO L273 TraceCheckUtils]: 58: Hoare triple {4318#false} assume !false; {4318#false} is VALID [2018-11-23 12:02:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 12:02:50,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:50,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:50,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:50,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:50,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:50,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {4317#true} call ULTIMATE.init(); {4317#true} is VALID [2018-11-23 12:02:50,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {4317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4317#true} is VALID [2018-11-23 12:02:50,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {4317#true} assume true; {4317#true} is VALID [2018-11-23 12:02:50,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4317#true} {4317#true} #87#return; {4317#true} is VALID [2018-11-23 12:02:50,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {4317#true} call #t~ret2 := main(); {4317#true} is VALID [2018-11-23 12:02:50,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {4317#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4348#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:50,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {4348#(<= 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; {4320#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:50,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {4320#(<= 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; {4321#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:50,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {4321#(<= 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; {4322#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:50,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {4322#(<= 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; {4323#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:50,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {4323#(<= 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; {4324#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:50,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {4324#(<= 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; {4325#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:50,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {4325#(<= 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; {4326#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:50,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {4326#(<= 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; {4327#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:50,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {4327#(<= 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; {4328#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:50,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {4328#(<= 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; {4329#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:50,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {4329#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 12:02:50,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 12:02:50,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,662 INFO L273 TraceCheckUtils]: 20: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,663 INFO L273 TraceCheckUtils]: 27: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,664 INFO L273 TraceCheckUtils]: 28: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 12:02:50,664 INFO L273 TraceCheckUtils]: 29: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 12:02:50,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,665 INFO L273 TraceCheckUtils]: 33: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,665 INFO L273 TraceCheckUtils]: 34: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,665 INFO L273 TraceCheckUtils]: 35: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 37: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 39: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 40: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 41: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 12:02:50,666 INFO L273 TraceCheckUtils]: 42: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 43: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 47: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,667 INFO L273 TraceCheckUtils]: 48: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,668 INFO L273 TraceCheckUtils]: 49: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,668 INFO L273 TraceCheckUtils]: 50: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,668 INFO L273 TraceCheckUtils]: 51: Hoare triple {4318#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4318#false} is VALID [2018-11-23 12:02:50,668 INFO L273 TraceCheckUtils]: 52: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 12:02:50,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {4318#false} havoc ~x~0;~x~0 := 0; {4318#false} is VALID [2018-11-23 12:02:50,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {4318#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4318#false} is VALID [2018-11-23 12:02:50,668 INFO L256 TraceCheckUtils]: 55: Hoare triple {4318#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {4318#false} is VALID [2018-11-23 12:02:50,669 INFO L273 TraceCheckUtils]: 56: Hoare triple {4318#false} ~cond := #in~cond; {4318#false} is VALID [2018-11-23 12:02:50,669 INFO L273 TraceCheckUtils]: 57: Hoare triple {4318#false} assume 0 == ~cond; {4318#false} is VALID [2018-11-23 12:02:50,669 INFO L273 TraceCheckUtils]: 58: Hoare triple {4318#false} assume !false; {4318#false} is VALID [2018-11-23 12:02:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 12:02:50,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:50,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:02:50,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-11-23 12:02:50,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:50,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:02:50,724 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 12:02:50,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:02:50,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:02:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:50,725 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 14 states. [2018-11-23 12:02:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:51,173 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-23 12:02:51,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:02:51,173 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-11-23 12:02:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-23 12:02:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-23 12:02:51,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 96 transitions. [2018-11-23 12:02:51,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:51,348 INFO L225 Difference]: With dead ends: 115 [2018-11-23 12:02:51,348 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 12:02:51,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 12:02:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 12:02:51,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:51,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-23 12:02:51,391 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 12:02:51,391 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 12:02:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:51,393 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 12:02:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 12:02:51,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:51,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:51,393 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 12:02:51,393 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 12:02:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:51,395 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 12:02:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 12:02:51,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:51,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:51,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:51,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:02:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-23 12:02:51,397 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 59 [2018-11-23 12:02:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:51,397 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-23 12:02:51,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:02:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 12:02:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:02:51,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:51,399 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:51,399 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:51,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash 342894732, now seen corresponding path program 11 times [2018-11-23 12:02:51,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:51,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:51,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:52,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2018-11-23 12:02:52,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {4972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4972#true} is VALID [2018-11-23 12:02:52,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2018-11-23 12:02:52,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #87#return; {4972#true} is VALID [2018-11-23 12:02:52,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret2 := main(); {4972#true} is VALID [2018-11-23 12:02:52,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {4972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4974#(= main_~i~0 0)} is VALID [2018-11-23 12:02:52,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {4974#(= 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; {4975#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:52,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {4975#(<= 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; {4976#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:52,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {4976#(<= 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; {4977#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:52,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {4977#(<= 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; {4978#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:52,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {4978#(<= 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; {4979#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:52,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {4979#(<= 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; {4980#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:52,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {4980#(<= 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; {4981#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:52,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {4981#(<= 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; {4982#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:52,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {4982#(<= 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; {4983#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:52,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {4983#(<= 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; {4984#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:52,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {4984#(<= 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; {4985#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:52,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {4985#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 12:02:52,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 12:02:52,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,402 INFO L273 TraceCheckUtils]: 27: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 12:02:52,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 12:02:52,403 INFO L273 TraceCheckUtils]: 32: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,403 INFO L273 TraceCheckUtils]: 33: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,403 INFO L273 TraceCheckUtils]: 36: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,404 INFO L273 TraceCheckUtils]: 41: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,404 INFO L273 TraceCheckUtils]: 42: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,404 INFO L273 TraceCheckUtils]: 43: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 12:02:52,404 INFO L273 TraceCheckUtils]: 44: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 12:02:52,404 INFO L273 TraceCheckUtils]: 45: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,404 INFO L273 TraceCheckUtils]: 46: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,404 INFO L273 TraceCheckUtils]: 47: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,405 INFO L273 TraceCheckUtils]: 49: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,405 INFO L273 TraceCheckUtils]: 50: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,405 INFO L273 TraceCheckUtils]: 51: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,405 INFO L273 TraceCheckUtils]: 52: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,405 INFO L273 TraceCheckUtils]: 53: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,405 INFO L273 TraceCheckUtils]: 54: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,405 INFO L273 TraceCheckUtils]: 55: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:02:52,405 INFO L273 TraceCheckUtils]: 56: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 12:02:52,406 INFO L273 TraceCheckUtils]: 57: Hoare triple {4973#false} havoc ~x~0;~x~0 := 0; {4973#false} is VALID [2018-11-23 12:02:52,406 INFO L273 TraceCheckUtils]: 58: Hoare triple {4973#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4973#false} is VALID [2018-11-23 12:02:52,406 INFO L256 TraceCheckUtils]: 59: Hoare triple {4973#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {4973#false} is VALID [2018-11-23 12:02:52,406 INFO L273 TraceCheckUtils]: 60: Hoare triple {4973#false} ~cond := #in~cond; {4973#false} is VALID [2018-11-23 12:02:52,406 INFO L273 TraceCheckUtils]: 61: Hoare triple {4973#false} assume 0 == ~cond; {4973#false} is VALID [2018-11-23 12:02:52,406 INFO L273 TraceCheckUtils]: 62: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2018-11-23 12:02:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-23 12:02:52,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:52,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:52,418 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:05,270 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:03:05,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:05,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:05,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2018-11-23 12:03:05,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {4972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4972#true} is VALID [2018-11-23 12:03:05,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2018-11-23 12:03:05,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #87#return; {4972#true} is VALID [2018-11-23 12:03:05,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret2 := main(); {4972#true} is VALID [2018-11-23 12:03:05,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {4972#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5004#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:05,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {5004#(<= 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; {4975#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:05,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {4975#(<= 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; {4976#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:05,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {4976#(<= 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; {4977#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:05,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {4977#(<= 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; {4978#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:05,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {4978#(<= 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; {4979#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:05,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {4979#(<= 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; {4980#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:05,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {4980#(<= 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; {4981#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:05,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {4981#(<= 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; {4982#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:05,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {4982#(<= 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; {4983#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:05,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {4983#(<= 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; {4984#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:05,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {4984#(<= 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; {4985#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:05,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {4985#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 12:03:05,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 12:03:05,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,508 INFO L273 TraceCheckUtils]: 27: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,508 INFO L273 TraceCheckUtils]: 28: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 12:03:05,508 INFO L273 TraceCheckUtils]: 31: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 12:03:05,509 INFO L273 TraceCheckUtils]: 32: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,509 INFO L273 TraceCheckUtils]: 33: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,510 INFO L273 TraceCheckUtils]: 39: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,510 INFO L273 TraceCheckUtils]: 40: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,510 INFO L273 TraceCheckUtils]: 41: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,510 INFO L273 TraceCheckUtils]: 42: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,511 INFO L273 TraceCheckUtils]: 43: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 12:03:05,511 INFO L273 TraceCheckUtils]: 44: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 12:03:05,511 INFO L273 TraceCheckUtils]: 45: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,511 INFO L273 TraceCheckUtils]: 46: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,511 INFO L273 TraceCheckUtils]: 47: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,511 INFO L273 TraceCheckUtils]: 48: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,511 INFO L273 TraceCheckUtils]: 49: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,511 INFO L273 TraceCheckUtils]: 50: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,511 INFO L273 TraceCheckUtils]: 51: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,512 INFO L273 TraceCheckUtils]: 52: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,512 INFO L273 TraceCheckUtils]: 53: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,512 INFO L273 TraceCheckUtils]: 54: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,512 INFO L273 TraceCheckUtils]: 55: Hoare triple {4973#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4973#false} is VALID [2018-11-23 12:03:05,512 INFO L273 TraceCheckUtils]: 56: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 12:03:05,512 INFO L273 TraceCheckUtils]: 57: Hoare triple {4973#false} havoc ~x~0;~x~0 := 0; {4973#false} is VALID [2018-11-23 12:03:05,512 INFO L273 TraceCheckUtils]: 58: Hoare triple {4973#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4973#false} is VALID [2018-11-23 12:03:05,512 INFO L256 TraceCheckUtils]: 59: Hoare triple {4973#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {4973#false} is VALID [2018-11-23 12:03:05,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {4973#false} ~cond := #in~cond; {4973#false} is VALID [2018-11-23 12:03:05,513 INFO L273 TraceCheckUtils]: 61: Hoare triple {4973#false} assume 0 == ~cond; {4973#false} is VALID [2018-11-23 12:03:05,513 INFO L273 TraceCheckUtils]: 62: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2018-11-23 12:03:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-23 12:03:05,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:05,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:03:05,540 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-11-23 12:03:05,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:05,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:03:05,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:05,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:03:05,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:03:05,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:03:05,567 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 15 states. [2018-11-23 12:03:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,097 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-11-23 12:03:06,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:03:06,097 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-11-23 12:03:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:03:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2018-11-23 12:03:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:03:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2018-11-23 12:03:06,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 100 transitions. [2018-11-23 12:03:07,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:07,051 INFO L225 Difference]: With dead ends: 122 [2018-11-23 12:03:07,051 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:03:07,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:03:07,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:03:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 12:03:07,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:07,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:07,530 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:07,530 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:07,532 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:03:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:03:07,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:07,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:07,532 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:07,532 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 12:03:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:07,534 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:03:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:03:07,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:07,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:07,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:07,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:03:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-11-23 12:03:07,536 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 63 [2018-11-23 12:03:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:07,536 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-11-23 12:03:07,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:03:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:03:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:03:07,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:07,537 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:07,537 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:07,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1686898, now seen corresponding path program 12 times [2018-11-23 12:03:07,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:07,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:07,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:07,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:07,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:08,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {5670#true} call ULTIMATE.init(); {5670#true} is VALID [2018-11-23 12:03:08,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {5670#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5670#true} is VALID [2018-11-23 12:03:08,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {5670#true} assume true; {5670#true} is VALID [2018-11-23 12:03:08,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5670#true} {5670#true} #87#return; {5670#true} is VALID [2018-11-23 12:03:08,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {5670#true} call #t~ret2 := main(); {5670#true} is VALID [2018-11-23 12:03:08,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {5670#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5672#(= main_~i~0 0)} is VALID [2018-11-23 12:03:08,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {5672#(= 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; {5673#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:08,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {5673#(<= 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; {5674#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:08,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {5674#(<= 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; {5675#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:08,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {5675#(<= 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; {5676#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:08,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {5676#(<= 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; {5677#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:08,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {5677#(<= 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; {5678#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:08,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {5678#(<= 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; {5679#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:08,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {5679#(<= 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; {5680#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:08,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {5680#(<= 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; {5681#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:08,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {5681#(<= 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; {5682#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:08,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {5682#(<= 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; {5683#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:08,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {5683#(<= 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; {5684#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:08,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {5684#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 12:03:08,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {5671#false} ~i~0 := 0; {5671#false} is VALID [2018-11-23 12:03:08,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,118 INFO L273 TraceCheckUtils]: 22: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,119 INFO L273 TraceCheckUtils]: 24: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,119 INFO L273 TraceCheckUtils]: 28: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,120 INFO L273 TraceCheckUtils]: 30: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,120 INFO L273 TraceCheckUtils]: 31: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {5671#false} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 12:03:08,120 INFO L273 TraceCheckUtils]: 33: Hoare triple {5671#false} ~i~0 := 0; {5671#false} is VALID [2018-11-23 12:03:08,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,121 INFO L273 TraceCheckUtils]: 35: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,121 INFO L273 TraceCheckUtils]: 36: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,121 INFO L273 TraceCheckUtils]: 37: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,121 INFO L273 TraceCheckUtils]: 38: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,121 INFO L273 TraceCheckUtils]: 39: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,122 INFO L273 TraceCheckUtils]: 40: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,122 INFO L273 TraceCheckUtils]: 41: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,122 INFO L273 TraceCheckUtils]: 42: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,122 INFO L273 TraceCheckUtils]: 44: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,123 INFO L273 TraceCheckUtils]: 45: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {5671#false} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 12:03:08,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {5671#false} ~i~0 := 0; {5671#false} is VALID [2018-11-23 12:03:08,123 INFO L273 TraceCheckUtils]: 48: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,123 INFO L273 TraceCheckUtils]: 49: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,123 INFO L273 TraceCheckUtils]: 51: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,123 INFO L273 TraceCheckUtils]: 52: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,124 INFO L273 TraceCheckUtils]: 53: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,124 INFO L273 TraceCheckUtils]: 54: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,124 INFO L273 TraceCheckUtils]: 55: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,124 INFO L273 TraceCheckUtils]: 57: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,124 INFO L273 TraceCheckUtils]: 58: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {5671#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5671#false} is VALID [2018-11-23 12:03:08,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {5671#false} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 12:03:08,124 INFO L273 TraceCheckUtils]: 61: Hoare triple {5671#false} havoc ~x~0;~x~0 := 0; {5671#false} is VALID [2018-11-23 12:03:08,125 INFO L273 TraceCheckUtils]: 62: Hoare triple {5671#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5671#false} is VALID [2018-11-23 12:03:08,125 INFO L256 TraceCheckUtils]: 63: Hoare triple {5671#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {5671#false} is VALID [2018-11-23 12:03:08,125 INFO L273 TraceCheckUtils]: 64: Hoare triple {5671#false} ~cond := #in~cond; {5671#false} is VALID [2018-11-23 12:03:08,125 INFO L273 TraceCheckUtils]: 65: Hoare triple {5671#false} assume 0 == ~cond; {5671#false} is VALID [2018-11-23 12:03:08,125 INFO L273 TraceCheckUtils]: 66: Hoare triple {5671#false} assume !false; {5671#false} is VALID [2018-11-23 12:03:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-23 12:03:08,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:08,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:08,136 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:14,087 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:03:14,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:14,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:14,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {5670#true} call ULTIMATE.init(); {5670#true} is VALID [2018-11-23 12:03:14,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {5670#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5670#true} is VALID [2018-11-23 12:03:14,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {5670#true} assume true; {5670#true} is VALID [2018-11-23 12:03:14,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5670#true} {5670#true} #87#return; {5670#true} is VALID [2018-11-23 12:03:14,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {5670#true} call #t~ret2 := main(); {5670#true} is VALID [2018-11-23 12:03:14,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {5670#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5670#true} is VALID [2018-11-23 12:03:14,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5739#(<= main_~i~0 100000)} is VALID [2018-11-23 12:03:14,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {5739#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5670#true} is VALID [2018-11-23 12:03:14,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {5670#true} ~i~0 := 0; {5670#true} is VALID [2018-11-23 12:03:14,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,318 INFO L273 TraceCheckUtils]: 21: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,318 INFO L273 TraceCheckUtils]: 22: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,318 INFO L273 TraceCheckUtils]: 23: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,319 INFO L273 TraceCheckUtils]: 30: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,319 INFO L273 TraceCheckUtils]: 31: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,319 INFO L273 TraceCheckUtils]: 32: Hoare triple {5670#true} assume !(~i~0 < 100000); {5670#true} is VALID [2018-11-23 12:03:14,319 INFO L273 TraceCheckUtils]: 33: Hoare triple {5670#true} ~i~0 := 0; {5670#true} is VALID [2018-11-23 12:03:14,319 INFO L273 TraceCheckUtils]: 34: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,320 INFO L273 TraceCheckUtils]: 35: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,320 INFO L273 TraceCheckUtils]: 36: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,320 INFO L273 TraceCheckUtils]: 37: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,320 INFO L273 TraceCheckUtils]: 39: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,320 INFO L273 TraceCheckUtils]: 40: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,320 INFO L273 TraceCheckUtils]: 42: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,321 INFO L273 TraceCheckUtils]: 43: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,321 INFO L273 TraceCheckUtils]: 44: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5670#true} is VALID [2018-11-23 12:03:14,321 INFO L273 TraceCheckUtils]: 45: Hoare triple {5670#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5739#(<= main_~i~0 100000)} is VALID [2018-11-23 12:03:14,321 INFO L273 TraceCheckUtils]: 46: Hoare triple {5739#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5670#true} is VALID [2018-11-23 12:03:14,322 INFO L273 TraceCheckUtils]: 47: Hoare triple {5670#true} ~i~0 := 0; {5830#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:14,322 INFO L273 TraceCheckUtils]: 48: Hoare triple {5830#(<= 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; {5673#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:14,323 INFO L273 TraceCheckUtils]: 49: Hoare triple {5673#(<= 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; {5674#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:14,323 INFO L273 TraceCheckUtils]: 50: Hoare triple {5674#(<= 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; {5675#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:14,324 INFO L273 TraceCheckUtils]: 51: Hoare triple {5675#(<= 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; {5676#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:14,325 INFO L273 TraceCheckUtils]: 52: Hoare triple {5676#(<= 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; {5677#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:14,325 INFO L273 TraceCheckUtils]: 53: Hoare triple {5677#(<= 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; {5678#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:14,326 INFO L273 TraceCheckUtils]: 54: Hoare triple {5678#(<= 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; {5679#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:14,327 INFO L273 TraceCheckUtils]: 55: Hoare triple {5679#(<= 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; {5680#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:14,328 INFO L273 TraceCheckUtils]: 56: Hoare triple {5680#(<= 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; {5681#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:14,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {5681#(<= 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; {5682#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:14,340 INFO L273 TraceCheckUtils]: 58: Hoare triple {5682#(<= 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; {5683#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:14,340 INFO L273 TraceCheckUtils]: 59: Hoare triple {5683#(<= 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; {5684#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:14,341 INFO L273 TraceCheckUtils]: 60: Hoare triple {5684#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 12:03:14,341 INFO L273 TraceCheckUtils]: 61: Hoare triple {5671#false} havoc ~x~0;~x~0 := 0; {5671#false} is VALID [2018-11-23 12:03:14,341 INFO L273 TraceCheckUtils]: 62: Hoare triple {5671#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5671#false} is VALID [2018-11-23 12:03:14,341 INFO L256 TraceCheckUtils]: 63: Hoare triple {5671#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {5671#false} is VALID [2018-11-23 12:03:14,341 INFO L273 TraceCheckUtils]: 64: Hoare triple {5671#false} ~cond := #in~cond; {5671#false} is VALID [2018-11-23 12:03:14,341 INFO L273 TraceCheckUtils]: 65: Hoare triple {5671#false} assume 0 == ~cond; {5671#false} is VALID [2018-11-23 12:03:14,342 INFO L273 TraceCheckUtils]: 66: Hoare triple {5671#false} assume !false; {5671#false} is VALID [2018-11-23 12:03:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 12:03:14,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:14,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-23 12:03:14,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-23 12:03:14,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:14,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:03:14,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:14,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:03:14,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:03:14,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:03:14,422 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 17 states. [2018-11-23 12:03:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,233 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-11-23 12:03:15,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:03:15,234 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-23 12:03:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:03:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2018-11-23 12:03:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:03:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2018-11-23 12:03:15,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 104 transitions. [2018-11-23 12:03:15,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:15,344 INFO L225 Difference]: With dead ends: 129 [2018-11-23 12:03:15,344 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:03:15,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:03:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:03:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 12:03:15,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:15,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:15,497 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:15,497 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,499 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 12:03:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 12:03:15,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:15,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:15,500 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:15,500 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 12:03:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:15,502 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 12:03:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 12:03:15,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:15,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:15,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:15,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:03:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-11-23 12:03:15,504 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 67 [2018-11-23 12:03:15,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:15,504 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-23 12:03:15,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:03:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 12:03:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:03:15,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:15,506 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:15,506 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:15,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:15,506 INFO L82 PathProgramCache]: Analyzing trace with hash 106590156, now seen corresponding path program 13 times [2018-11-23 12:03:15,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:15,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:15,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:15,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:15,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:16,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {6412#true} call ULTIMATE.init(); {6412#true} is VALID [2018-11-23 12:03:16,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {6412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6412#true} is VALID [2018-11-23 12:03:16,026 INFO L273 TraceCheckUtils]: 2: Hoare triple {6412#true} assume true; {6412#true} is VALID [2018-11-23 12:03:16,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6412#true} {6412#true} #87#return; {6412#true} is VALID [2018-11-23 12:03:16,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {6412#true} call #t~ret2 := main(); {6412#true} is VALID [2018-11-23 12:03:16,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {6412#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6414#(= main_~i~0 0)} is VALID [2018-11-23 12:03:16,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {6414#(= 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; {6415#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:16,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {6415#(<= 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; {6416#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:16,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {6416#(<= 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; {6417#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:16,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {6417#(<= 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; {6418#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:16,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {6418#(<= 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; {6419#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:16,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {6419#(<= 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; {6420#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:16,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {6420#(<= 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; {6421#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:16,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {6421#(<= 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; {6422#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:16,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {6422#(<= 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; {6423#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:16,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {6423#(<= 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; {6424#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:16,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {6424#(<= 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; {6425#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:16,037 INFO L273 TraceCheckUtils]: 17: Hoare triple {6425#(<= 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; {6426#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:16,038 INFO L273 TraceCheckUtils]: 18: Hoare triple {6426#(<= 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; {6427#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:16,039 INFO L273 TraceCheckUtils]: 19: Hoare triple {6427#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 12:03:16,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 12:03:16,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,039 INFO L273 TraceCheckUtils]: 22: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,040 INFO L273 TraceCheckUtils]: 26: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,040 INFO L273 TraceCheckUtils]: 27: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,041 INFO L273 TraceCheckUtils]: 29: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 12:03:16,042 INFO L273 TraceCheckUtils]: 35: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 12:03:16,042 INFO L273 TraceCheckUtils]: 36: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,042 INFO L273 TraceCheckUtils]: 37: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,042 INFO L273 TraceCheckUtils]: 38: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 43: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 47: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 49: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 50: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 51: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 54: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 55: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 56: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 57: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 58: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,045 INFO L273 TraceCheckUtils]: 59: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,045 INFO L273 TraceCheckUtils]: 60: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,045 INFO L273 TraceCheckUtils]: 62: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,045 INFO L273 TraceCheckUtils]: 63: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,045 INFO L273 TraceCheckUtils]: 64: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 12:03:16,045 INFO L273 TraceCheckUtils]: 65: Hoare triple {6413#false} havoc ~x~0;~x~0 := 0; {6413#false} is VALID [2018-11-23 12:03:16,045 INFO L273 TraceCheckUtils]: 66: Hoare triple {6413#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6413#false} is VALID [2018-11-23 12:03:16,046 INFO L256 TraceCheckUtils]: 67: Hoare triple {6413#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {6413#false} is VALID [2018-11-23 12:03:16,046 INFO L273 TraceCheckUtils]: 68: Hoare triple {6413#false} ~cond := #in~cond; {6413#false} is VALID [2018-11-23 12:03:16,046 INFO L273 TraceCheckUtils]: 69: Hoare triple {6413#false} assume 0 == ~cond; {6413#false} is VALID [2018-11-23 12:03:16,046 INFO L273 TraceCheckUtils]: 70: Hoare triple {6413#false} assume !false; {6413#false} is VALID [2018-11-23 12:03:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-23 12:03:16,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:16,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:16,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:16,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:16,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {6412#true} call ULTIMATE.init(); {6412#true} is VALID [2018-11-23 12:03:16,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {6412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6412#true} is VALID [2018-11-23 12:03:16,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {6412#true} assume true; {6412#true} is VALID [2018-11-23 12:03:16,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6412#true} {6412#true} #87#return; {6412#true} is VALID [2018-11-23 12:03:16,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {6412#true} call #t~ret2 := main(); {6412#true} is VALID [2018-11-23 12:03:16,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {6412#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6446#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:16,502 INFO L273 TraceCheckUtils]: 6: Hoare triple {6446#(<= 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; {6415#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:16,503 INFO L273 TraceCheckUtils]: 7: Hoare triple {6415#(<= 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; {6416#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:16,503 INFO L273 TraceCheckUtils]: 8: Hoare triple {6416#(<= 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; {6417#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:16,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {6417#(<= 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; {6418#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:16,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {6418#(<= 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; {6419#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:16,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {6419#(<= 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; {6420#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:16,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {6420#(<= 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; {6421#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:16,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {6421#(<= 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; {6422#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:16,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {6422#(<= 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; {6423#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:16,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {6423#(<= 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; {6424#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:16,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {6424#(<= 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; {6425#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:16,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {6425#(<= 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; {6426#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:16,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {6426#(<= 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; {6427#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:16,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {6427#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 12:03:16,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 12:03:16,512 INFO L273 TraceCheckUtils]: 21: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,513 INFO L273 TraceCheckUtils]: 28: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,513 INFO L273 TraceCheckUtils]: 30: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,514 INFO L273 TraceCheckUtils]: 31: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,514 INFO L273 TraceCheckUtils]: 33: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,514 INFO L273 TraceCheckUtils]: 34: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 12:03:16,514 INFO L273 TraceCheckUtils]: 35: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 12:03:16,514 INFO L273 TraceCheckUtils]: 36: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,515 INFO L273 TraceCheckUtils]: 37: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,515 INFO L273 TraceCheckUtils]: 38: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,515 INFO L273 TraceCheckUtils]: 39: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,515 INFO L273 TraceCheckUtils]: 40: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,515 INFO L273 TraceCheckUtils]: 41: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,515 INFO L273 TraceCheckUtils]: 42: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,515 INFO L273 TraceCheckUtils]: 43: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,516 INFO L273 TraceCheckUtils]: 45: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,516 INFO L273 TraceCheckUtils]: 46: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,516 INFO L273 TraceCheckUtils]: 47: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,516 INFO L273 TraceCheckUtils]: 48: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,516 INFO L273 TraceCheckUtils]: 49: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 12:03:16,516 INFO L273 TraceCheckUtils]: 50: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 12:03:16,516 INFO L273 TraceCheckUtils]: 51: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,516 INFO L273 TraceCheckUtils]: 52: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,516 INFO L273 TraceCheckUtils]: 53: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,517 INFO L273 TraceCheckUtils]: 54: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,517 INFO L273 TraceCheckUtils]: 55: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,517 INFO L273 TraceCheckUtils]: 56: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,517 INFO L273 TraceCheckUtils]: 57: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,517 INFO L273 TraceCheckUtils]: 58: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,517 INFO L273 TraceCheckUtils]: 59: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,517 INFO L273 TraceCheckUtils]: 60: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,517 INFO L273 TraceCheckUtils]: 61: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,518 INFO L273 TraceCheckUtils]: 62: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,518 INFO L273 TraceCheckUtils]: 63: Hoare triple {6413#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6413#false} is VALID [2018-11-23 12:03:16,518 INFO L273 TraceCheckUtils]: 64: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 12:03:16,518 INFO L273 TraceCheckUtils]: 65: Hoare triple {6413#false} havoc ~x~0;~x~0 := 0; {6413#false} is VALID [2018-11-23 12:03:16,518 INFO L273 TraceCheckUtils]: 66: Hoare triple {6413#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6413#false} is VALID [2018-11-23 12:03:16,518 INFO L256 TraceCheckUtils]: 67: Hoare triple {6413#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {6413#false} is VALID [2018-11-23 12:03:16,518 INFO L273 TraceCheckUtils]: 68: Hoare triple {6413#false} ~cond := #in~cond; {6413#false} is VALID [2018-11-23 12:03:16,518 INFO L273 TraceCheckUtils]: 69: Hoare triple {6413#false} assume 0 == ~cond; {6413#false} is VALID [2018-11-23 12:03:16,518 INFO L273 TraceCheckUtils]: 70: Hoare triple {6413#false} assume !false; {6413#false} is VALID [2018-11-23 12:03:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-23 12:03:16,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:16,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:03:16,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-11-23 12:03:16,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:16,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:03:16,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:16,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:03:16,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:03:16,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:03:16,570 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 17 states. [2018-11-23 12:03:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:17,133 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-11-23 12:03:17,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:03:17,133 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-11-23 12:03:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:03:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2018-11-23 12:03:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:03:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2018-11-23 12:03:17,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 108 transitions. [2018-11-23 12:03:17,635 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 12:03:17,637 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:03:17,637 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:03:17,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:03:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:03:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-23 12:03:17,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:17,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:17,697 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:17,698 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:17,700 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 12:03:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:03:17,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:17,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:17,701 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:17,701 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 12:03:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:17,702 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 12:03:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:03:17,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:17,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:17,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:17,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:03:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-23 12:03:17,704 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 71 [2018-11-23 12:03:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:17,705 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-23 12:03:17,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:03:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:03:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:03:17,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:17,706 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:17,706 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:17,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:17,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1965252814, now seen corresponding path program 14 times [2018-11-23 12:03:17,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:17,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:17,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:17,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:17,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:18,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {7196#true} call ULTIMATE.init(); {7196#true} is VALID [2018-11-23 12:03:18,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {7196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7196#true} is VALID [2018-11-23 12:03:18,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {7196#true} assume true; {7196#true} is VALID [2018-11-23 12:03:18,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7196#true} {7196#true} #87#return; {7196#true} is VALID [2018-11-23 12:03:18,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {7196#true} call #t~ret2 := main(); {7196#true} is VALID [2018-11-23 12:03:18,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {7196#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7198#(= main_~i~0 0)} is VALID [2018-11-23 12:03:18,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {7198#(= 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; {7199#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:18,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {7199#(<= 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; {7200#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:18,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {7200#(<= 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; {7201#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:18,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {7201#(<= 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; {7202#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:18,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {7202#(<= 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; {7203#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:18,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {7203#(<= 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; {7204#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:18,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {7204#(<= 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; {7205#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:18,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {7205#(<= 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; {7206#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:18,112 INFO L273 TraceCheckUtils]: 14: Hoare triple {7206#(<= 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; {7207#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:18,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {7207#(<= 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; {7208#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:18,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {7208#(<= 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; {7209#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:18,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {7209#(<= 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; {7210#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:18,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {7210#(<= 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; {7211#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:18,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {7211#(<= 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; {7212#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {7212#(<= main_~i~0 14)} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 12:03:18,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 23: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 24: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 26: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 27: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 28: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,120 INFO L273 TraceCheckUtils]: 30: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 35: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,121 INFO L273 TraceCheckUtils]: 36: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 37: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 38: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 39: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 40: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 41: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 42: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 44: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 45: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 48: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,123 INFO L273 TraceCheckUtils]: 49: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 50: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 51: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 52: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 53: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 54: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 55: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,125 INFO L273 TraceCheckUtils]: 57: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,125 INFO L273 TraceCheckUtils]: 58: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,125 INFO L273 TraceCheckUtils]: 59: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,125 INFO L273 TraceCheckUtils]: 60: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,125 INFO L273 TraceCheckUtils]: 61: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,125 INFO L273 TraceCheckUtils]: 62: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,126 INFO L273 TraceCheckUtils]: 63: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,126 INFO L273 TraceCheckUtils]: 64: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,126 INFO L273 TraceCheckUtils]: 65: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,126 INFO L273 TraceCheckUtils]: 66: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,126 INFO L273 TraceCheckUtils]: 67: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,126 INFO L273 TraceCheckUtils]: 68: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 12:03:18,126 INFO L273 TraceCheckUtils]: 69: Hoare triple {7197#false} havoc ~x~0;~x~0 := 0; {7197#false} is VALID [2018-11-23 12:03:18,127 INFO L273 TraceCheckUtils]: 70: Hoare triple {7197#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7197#false} is VALID [2018-11-23 12:03:18,127 INFO L256 TraceCheckUtils]: 71: Hoare triple {7197#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {7197#false} is VALID [2018-11-23 12:03:18,127 INFO L273 TraceCheckUtils]: 72: Hoare triple {7197#false} ~cond := #in~cond; {7197#false} is VALID [2018-11-23 12:03:18,127 INFO L273 TraceCheckUtils]: 73: Hoare triple {7197#false} assume 0 == ~cond; {7197#false} is VALID [2018-11-23 12:03:18,127 INFO L273 TraceCheckUtils]: 74: Hoare triple {7197#false} assume !false; {7197#false} is VALID [2018-11-23 12:03:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-23 12:03:18,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:18,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:18,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:18,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:18,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:18,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:18,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {7196#true} call ULTIMATE.init(); {7196#true} is VALID [2018-11-23 12:03:18,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {7196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7196#true} is VALID [2018-11-23 12:03:18,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {7196#true} assume true; {7196#true} is VALID [2018-11-23 12:03:18,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7196#true} {7196#true} #87#return; {7196#true} is VALID [2018-11-23 12:03:18,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {7196#true} call #t~ret2 := main(); {7196#true} is VALID [2018-11-23 12:03:18,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {7196#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7231#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:18,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {7231#(<= 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; {7199#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:18,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {7199#(<= 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; {7200#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:18,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {7200#(<= 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; {7201#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:18,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {7201#(<= 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; {7202#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:18,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {7202#(<= 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; {7203#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:18,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {7203#(<= 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; {7204#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:18,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {7204#(<= 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; {7205#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:18,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {7205#(<= 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; {7206#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:18,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {7206#(<= 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; {7207#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:18,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {7207#(<= 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; {7208#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:18,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {7208#(<= 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; {7209#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:18,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {7209#(<= 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; {7210#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:18,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {7210#(<= 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; {7211#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:18,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {7211#(<= 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; {7212#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:18,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {7212#(<= main_~i~0 14)} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 12:03:18,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 12:03:18,452 INFO L273 TraceCheckUtils]: 22: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,453 INFO L273 TraceCheckUtils]: 24: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,453 INFO L273 TraceCheckUtils]: 25: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,453 INFO L273 TraceCheckUtils]: 27: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,454 INFO L273 TraceCheckUtils]: 30: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 12:03:18,455 INFO L273 TraceCheckUtils]: 37: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 12:03:18,455 INFO L273 TraceCheckUtils]: 38: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,456 INFO L273 TraceCheckUtils]: 39: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,456 INFO L273 TraceCheckUtils]: 40: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,456 INFO L273 TraceCheckUtils]: 43: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,456 INFO L273 TraceCheckUtils]: 44: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,456 INFO L273 TraceCheckUtils]: 45: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,457 INFO L273 TraceCheckUtils]: 46: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,457 INFO L273 TraceCheckUtils]: 47: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,457 INFO L273 TraceCheckUtils]: 48: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,457 INFO L273 TraceCheckUtils]: 49: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,457 INFO L273 TraceCheckUtils]: 50: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,457 INFO L273 TraceCheckUtils]: 51: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,457 INFO L273 TraceCheckUtils]: 52: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 12:03:18,457 INFO L273 TraceCheckUtils]: 53: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 12:03:18,458 INFO L273 TraceCheckUtils]: 54: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,458 INFO L273 TraceCheckUtils]: 55: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,458 INFO L273 TraceCheckUtils]: 56: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,458 INFO L273 TraceCheckUtils]: 57: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,458 INFO L273 TraceCheckUtils]: 58: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,458 INFO L273 TraceCheckUtils]: 59: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,458 INFO L273 TraceCheckUtils]: 60: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,458 INFO L273 TraceCheckUtils]: 61: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,458 INFO L273 TraceCheckUtils]: 62: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,459 INFO L273 TraceCheckUtils]: 63: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,459 INFO L273 TraceCheckUtils]: 64: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,459 INFO L273 TraceCheckUtils]: 65: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,459 INFO L273 TraceCheckUtils]: 66: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,459 INFO L273 TraceCheckUtils]: 67: Hoare triple {7197#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7197#false} is VALID [2018-11-23 12:03:18,459 INFO L273 TraceCheckUtils]: 68: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 12:03:18,459 INFO L273 TraceCheckUtils]: 69: Hoare triple {7197#false} havoc ~x~0;~x~0 := 0; {7197#false} is VALID [2018-11-23 12:03:18,459 INFO L273 TraceCheckUtils]: 70: Hoare triple {7197#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7197#false} is VALID [2018-11-23 12:03:18,460 INFO L256 TraceCheckUtils]: 71: Hoare triple {7197#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {7197#false} is VALID [2018-11-23 12:03:18,460 INFO L273 TraceCheckUtils]: 72: Hoare triple {7197#false} ~cond := #in~cond; {7197#false} is VALID [2018-11-23 12:03:18,460 INFO L273 TraceCheckUtils]: 73: Hoare triple {7197#false} assume 0 == ~cond; {7197#false} is VALID [2018-11-23 12:03:18,460 INFO L273 TraceCheckUtils]: 74: Hoare triple {7197#false} assume !false; {7197#false} is VALID [2018-11-23 12:03:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-23 12:03:18,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:18,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:03:18,483 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-11-23 12:03:18,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:18,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:03:18,511 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 12:03:18,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:03:18,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:03:18,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:03:18,512 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 18 states. [2018-11-23 12:03:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:19,222 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-11-23 12:03:19,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:03:19,222 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-11-23 12:03:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:03:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-23 12:03:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:03:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-23 12:03:19,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 112 transitions. [2018-11-23 12:03:19,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:19,403 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:03:19,404 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:03:19,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:03:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:03:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-23 12:03:19,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:19,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2018-11-23 12:03:19,477 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 12:03:19,478 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 12:03:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:19,480 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 12:03:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 12:03:19,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:19,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:19,480 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 12:03:19,481 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 12:03:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:19,482 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 12:03:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 12:03:19,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:19,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:19,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:19,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 12:03:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-11-23 12:03:19,485 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 75 [2018-11-23 12:03:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:19,485 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-11-23 12:03:19,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:03:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 12:03:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:03:19,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:19,486 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:19,487 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:19,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:19,487 INFO L82 PathProgramCache]: Analyzing trace with hash -38631668, now seen corresponding path program 15 times [2018-11-23 12:03:19,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:19,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:19,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:19,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {8023#true} call ULTIMATE.init(); {8023#true} is VALID [2018-11-23 12:03:19,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {8023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8023#true} is VALID [2018-11-23 12:03:19,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {8023#true} assume true; {8023#true} is VALID [2018-11-23 12:03:19,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8023#true} {8023#true} #87#return; {8023#true} is VALID [2018-11-23 12:03:19,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {8023#true} call #t~ret2 := main(); {8023#true} is VALID [2018-11-23 12:03:19,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {8023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8025#(= main_~i~0 0)} is VALID [2018-11-23 12:03:19,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {8025#(= 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; {8026#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:19,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {8026#(<= 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; {8027#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:19,741 INFO L273 TraceCheckUtils]: 8: Hoare triple {8027#(<= 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; {8028#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:19,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {8028#(<= 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; {8029#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:19,742 INFO L273 TraceCheckUtils]: 10: Hoare triple {8029#(<= 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; {8030#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:19,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {8030#(<= 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; {8031#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:19,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {8031#(<= 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; {8032#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:19,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {8032#(<= 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; {8033#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:19,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {8033#(<= 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; {8034#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:19,746 INFO L273 TraceCheckUtils]: 15: Hoare triple {8034#(<= 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; {8035#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:19,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {8035#(<= 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; {8036#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:19,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {8036#(<= 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; {8037#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:19,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {8037#(<= 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; {8038#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:19,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {8038#(<= 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; {8039#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:19,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {8039#(<= 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; {8040#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:19,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {8040#(<= main_~i~0 15)} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 12:03:19,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {8024#false} ~i~0 := 0; {8024#false} is VALID [2018-11-23 12:03:19,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,774 INFO L273 TraceCheckUtils]: 33: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,774 INFO L273 TraceCheckUtils]: 36: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,775 INFO L273 TraceCheckUtils]: 37: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {8024#false} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 12:03:19,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {8024#false} ~i~0 := 0; {8024#false} is VALID [2018-11-23 12:03:19,775 INFO L273 TraceCheckUtils]: 40: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,775 INFO L273 TraceCheckUtils]: 41: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,775 INFO L273 TraceCheckUtils]: 42: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,775 INFO L273 TraceCheckUtils]: 43: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,776 INFO L273 TraceCheckUtils]: 44: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,776 INFO L273 TraceCheckUtils]: 45: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,776 INFO L273 TraceCheckUtils]: 46: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,776 INFO L273 TraceCheckUtils]: 47: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,776 INFO L273 TraceCheckUtils]: 48: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,776 INFO L273 TraceCheckUtils]: 49: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,777 INFO L273 TraceCheckUtils]: 50: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,777 INFO L273 TraceCheckUtils]: 51: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,777 INFO L273 TraceCheckUtils]: 52: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,777 INFO L273 TraceCheckUtils]: 53: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,777 INFO L273 TraceCheckUtils]: 54: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,777 INFO L273 TraceCheckUtils]: 55: Hoare triple {8024#false} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 12:03:19,778 INFO L273 TraceCheckUtils]: 56: Hoare triple {8024#false} ~i~0 := 0; {8024#false} is VALID [2018-11-23 12:03:19,778 INFO L273 TraceCheckUtils]: 57: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,778 INFO L273 TraceCheckUtils]: 58: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,778 INFO L273 TraceCheckUtils]: 59: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,778 INFO L273 TraceCheckUtils]: 60: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,778 INFO L273 TraceCheckUtils]: 61: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,779 INFO L273 TraceCheckUtils]: 62: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,779 INFO L273 TraceCheckUtils]: 63: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,779 INFO L273 TraceCheckUtils]: 64: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,779 INFO L273 TraceCheckUtils]: 65: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,779 INFO L273 TraceCheckUtils]: 66: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,779 INFO L273 TraceCheckUtils]: 67: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,780 INFO L273 TraceCheckUtils]: 68: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,780 INFO L273 TraceCheckUtils]: 69: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,780 INFO L273 TraceCheckUtils]: 70: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,780 INFO L273 TraceCheckUtils]: 71: Hoare triple {8024#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8024#false} is VALID [2018-11-23 12:03:19,780 INFO L273 TraceCheckUtils]: 72: Hoare triple {8024#false} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 12:03:19,780 INFO L273 TraceCheckUtils]: 73: Hoare triple {8024#false} havoc ~x~0;~x~0 := 0; {8024#false} is VALID [2018-11-23 12:03:19,781 INFO L273 TraceCheckUtils]: 74: Hoare triple {8024#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8024#false} is VALID [2018-11-23 12:03:19,781 INFO L256 TraceCheckUtils]: 75: Hoare triple {8024#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {8024#false} is VALID [2018-11-23 12:03:19,781 INFO L273 TraceCheckUtils]: 76: Hoare triple {8024#false} ~cond := #in~cond; {8024#false} is VALID [2018-11-23 12:03:19,781 INFO L273 TraceCheckUtils]: 77: Hoare triple {8024#false} assume 0 == ~cond; {8024#false} is VALID [2018-11-23 12:03:19,781 INFO L273 TraceCheckUtils]: 78: Hoare triple {8024#false} assume !false; {8024#false} is VALID [2018-11-23 12:03:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-23 12:03:19,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:19,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:19,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:30,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:03:30,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:30,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:30,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {8023#true} call ULTIMATE.init(); {8023#true} is VALID [2018-11-23 12:03:30,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {8023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8023#true} is VALID [2018-11-23 12:03:30,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {8023#true} assume true; {8023#true} is VALID [2018-11-23 12:03:30,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8023#true} {8023#true} #87#return; {8023#true} is VALID [2018-11-23 12:03:30,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {8023#true} call #t~ret2 := main(); {8023#true} is VALID [2018-11-23 12:03:30,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {8023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8023#true} is VALID [2018-11-23 12:03:30,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,781 INFO L273 TraceCheckUtils]: 19: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,782 INFO L273 TraceCheckUtils]: 20: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,782 INFO L273 TraceCheckUtils]: 21: Hoare triple {8023#true} assume !(~i~0 < 100000); {8023#true} is VALID [2018-11-23 12:03:30,782 INFO L273 TraceCheckUtils]: 22: Hoare triple {8023#true} ~i~0 := 0; {8023#true} is VALID [2018-11-23 12:03:30,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,782 INFO L273 TraceCheckUtils]: 28: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,783 INFO L273 TraceCheckUtils]: 30: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,783 INFO L273 TraceCheckUtils]: 31: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,783 INFO L273 TraceCheckUtils]: 32: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,783 INFO L273 TraceCheckUtils]: 33: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,783 INFO L273 TraceCheckUtils]: 34: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8155#(<= main_~i~0 100000)} is VALID [2018-11-23 12:03:30,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {8155#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {8023#true} is VALID [2018-11-23 12:03:30,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {8023#true} ~i~0 := 0; {8023#true} is VALID [2018-11-23 12:03:30,784 INFO L273 TraceCheckUtils]: 40: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,785 INFO L273 TraceCheckUtils]: 41: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,785 INFO L273 TraceCheckUtils]: 42: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,785 INFO L273 TraceCheckUtils]: 43: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,785 INFO L273 TraceCheckUtils]: 44: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,785 INFO L273 TraceCheckUtils]: 45: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,785 INFO L273 TraceCheckUtils]: 46: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,785 INFO L273 TraceCheckUtils]: 47: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,785 INFO L273 TraceCheckUtils]: 48: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,786 INFO L273 TraceCheckUtils]: 49: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,786 INFO L273 TraceCheckUtils]: 50: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,786 INFO L273 TraceCheckUtils]: 51: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,786 INFO L273 TraceCheckUtils]: 52: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,786 INFO L273 TraceCheckUtils]: 53: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,786 INFO L273 TraceCheckUtils]: 54: Hoare triple {8023#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8023#true} is VALID [2018-11-23 12:03:30,786 INFO L273 TraceCheckUtils]: 55: Hoare triple {8023#true} assume !(~i~0 < 100000); {8023#true} is VALID [2018-11-23 12:03:30,787 INFO L273 TraceCheckUtils]: 56: Hoare triple {8023#true} ~i~0 := 0; {8213#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:30,787 INFO L273 TraceCheckUtils]: 57: Hoare triple {8213#(<= 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; {8026#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:30,788 INFO L273 TraceCheckUtils]: 58: Hoare triple {8026#(<= 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; {8027#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:30,788 INFO L273 TraceCheckUtils]: 59: Hoare triple {8027#(<= 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; {8028#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:30,789 INFO L273 TraceCheckUtils]: 60: Hoare triple {8028#(<= 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; {8029#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:30,789 INFO L273 TraceCheckUtils]: 61: Hoare triple {8029#(<= 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; {8030#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:30,790 INFO L273 TraceCheckUtils]: 62: Hoare triple {8030#(<= 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; {8031#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:30,791 INFO L273 TraceCheckUtils]: 63: Hoare triple {8031#(<= 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; {8032#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:30,792 INFO L273 TraceCheckUtils]: 64: Hoare triple {8032#(<= 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; {8033#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:30,792 INFO L273 TraceCheckUtils]: 65: Hoare triple {8033#(<= 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; {8034#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:30,793 INFO L273 TraceCheckUtils]: 66: Hoare triple {8034#(<= 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; {8035#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:30,794 INFO L273 TraceCheckUtils]: 67: Hoare triple {8035#(<= 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; {8036#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:30,795 INFO L273 TraceCheckUtils]: 68: Hoare triple {8036#(<= 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; {8037#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:30,796 INFO L273 TraceCheckUtils]: 69: Hoare triple {8037#(<= 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; {8038#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:30,797 INFO L273 TraceCheckUtils]: 70: Hoare triple {8038#(<= 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; {8039#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:30,798 INFO L273 TraceCheckUtils]: 71: Hoare triple {8039#(<= 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; {8040#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:30,798 INFO L273 TraceCheckUtils]: 72: Hoare triple {8040#(<= main_~i~0 15)} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 12:03:30,798 INFO L273 TraceCheckUtils]: 73: Hoare triple {8024#false} havoc ~x~0;~x~0 := 0; {8024#false} is VALID [2018-11-23 12:03:30,799 INFO L273 TraceCheckUtils]: 74: Hoare triple {8024#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8024#false} is VALID [2018-11-23 12:03:30,799 INFO L256 TraceCheckUtils]: 75: Hoare triple {8024#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {8024#false} is VALID [2018-11-23 12:03:30,799 INFO L273 TraceCheckUtils]: 76: Hoare triple {8024#false} ~cond := #in~cond; {8024#false} is VALID [2018-11-23 12:03:30,799 INFO L273 TraceCheckUtils]: 77: Hoare triple {8024#false} assume 0 == ~cond; {8024#false} is VALID [2018-11-23 12:03:30,799 INFO L273 TraceCheckUtils]: 78: Hoare triple {8024#false} assume !false; {8024#false} is VALID [2018-11-23 12:03:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 120 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-23 12:03:30,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:30,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2018-11-23 12:03:30,828 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-23 12:03:30,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:30,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:03:30,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:30,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:03:30,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:03:30,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:03:30,890 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 20 states. [2018-11-23 12:03:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:32,095 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2018-11-23 12:03:32,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:03:32,096 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-23 12:03:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:03:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 116 transitions. [2018-11-23 12:03:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:03:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 116 transitions. [2018-11-23 12:03:32,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 116 transitions. [2018-11-23 12:03:32,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:32,275 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:03:32,275 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:03:32,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:03:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:03:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 12:03:32,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:32,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:32,336 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:32,336 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:32,338 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:03:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:03:32,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:32,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:32,339 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:32,339 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 12:03:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:32,341 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:03:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:03:32,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:32,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:32,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:32,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:03:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-11-23 12:03:32,343 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 79 [2018-11-23 12:03:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:32,344 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-11-23 12:03:32,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:03:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:03:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:03:32,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:32,345 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:32,345 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:32,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash -523964658, now seen corresponding path program 16 times [2018-11-23 12:03:32,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:32,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:32,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:32,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:32,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:33,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {8894#true} call ULTIMATE.init(); {8894#true} is VALID [2018-11-23 12:03:33,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {8894#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8894#true} is VALID [2018-11-23 12:03:33,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {8894#true} assume true; {8894#true} is VALID [2018-11-23 12:03:33,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8894#true} {8894#true} #87#return; {8894#true} is VALID [2018-11-23 12:03:33,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {8894#true} call #t~ret2 := main(); {8894#true} is VALID [2018-11-23 12:03:33,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {8894#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8896#(= main_~i~0 0)} is VALID [2018-11-23 12:03:33,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {8896#(= 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; {8897#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:33,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {8897#(<= 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; {8898#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:33,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {8898#(<= 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; {8899#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:33,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {8899#(<= 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; {8900#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:33,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {8900#(<= 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; {8901#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:33,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {8901#(<= 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; {8902#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:33,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {8902#(<= 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; {8903#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:33,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {8903#(<= 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; {8904#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:33,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {8904#(<= 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; {8905#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:33,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {8905#(<= 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; {8906#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:33,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {8906#(<= 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; {8907#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:33,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {8907#(<= 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; {8908#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:33,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {8908#(<= 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; {8909#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:33,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {8909#(<= 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; {8910#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:33,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {8910#(<= 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; {8911#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:33,529 INFO L273 TraceCheckUtils]: 21: Hoare triple {8911#(<= 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; {8912#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:33,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {8912#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 12:03:33,530 INFO L273 TraceCheckUtils]: 23: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 12:03:33,530 INFO L273 TraceCheckUtils]: 24: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,531 INFO L273 TraceCheckUtils]: 32: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,532 INFO L273 TraceCheckUtils]: 34: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,532 INFO L273 TraceCheckUtils]: 36: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,532 INFO L273 TraceCheckUtils]: 37: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,532 INFO L273 TraceCheckUtils]: 38: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,533 INFO L273 TraceCheckUtils]: 39: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 12:03:33,533 INFO L273 TraceCheckUtils]: 41: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 12:03:33,533 INFO L273 TraceCheckUtils]: 42: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,533 INFO L273 TraceCheckUtils]: 43: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,533 INFO L273 TraceCheckUtils]: 44: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,534 INFO L273 TraceCheckUtils]: 45: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,534 INFO L273 TraceCheckUtils]: 46: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,534 INFO L273 TraceCheckUtils]: 47: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,534 INFO L273 TraceCheckUtils]: 49: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,534 INFO L273 TraceCheckUtils]: 50: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,535 INFO L273 TraceCheckUtils]: 53: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,535 INFO L273 TraceCheckUtils]: 54: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,535 INFO L273 TraceCheckUtils]: 55: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,535 INFO L273 TraceCheckUtils]: 56: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,535 INFO L273 TraceCheckUtils]: 57: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,535 INFO L273 TraceCheckUtils]: 58: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 12:03:33,535 INFO L273 TraceCheckUtils]: 59: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 12:03:33,535 INFO L273 TraceCheckUtils]: 60: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,535 INFO L273 TraceCheckUtils]: 61: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,536 INFO L273 TraceCheckUtils]: 62: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,536 INFO L273 TraceCheckUtils]: 63: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,536 INFO L273 TraceCheckUtils]: 64: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,536 INFO L273 TraceCheckUtils]: 65: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,536 INFO L273 TraceCheckUtils]: 66: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,536 INFO L273 TraceCheckUtils]: 67: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,536 INFO L273 TraceCheckUtils]: 68: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,536 INFO L273 TraceCheckUtils]: 69: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,536 INFO L273 TraceCheckUtils]: 70: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,537 INFO L273 TraceCheckUtils]: 71: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,537 INFO L273 TraceCheckUtils]: 72: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,537 INFO L273 TraceCheckUtils]: 73: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,537 INFO L273 TraceCheckUtils]: 74: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,537 INFO L273 TraceCheckUtils]: 75: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,537 INFO L273 TraceCheckUtils]: 76: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 12:03:33,537 INFO L273 TraceCheckUtils]: 77: Hoare triple {8895#false} havoc ~x~0;~x~0 := 0; {8895#false} is VALID [2018-11-23 12:03:33,537 INFO L273 TraceCheckUtils]: 78: Hoare triple {8895#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8895#false} is VALID [2018-11-23 12:03:33,538 INFO L256 TraceCheckUtils]: 79: Hoare triple {8895#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {8895#false} is VALID [2018-11-23 12:03:33,538 INFO L273 TraceCheckUtils]: 80: Hoare triple {8895#false} ~cond := #in~cond; {8895#false} is VALID [2018-11-23 12:03:33,538 INFO L273 TraceCheckUtils]: 81: Hoare triple {8895#false} assume 0 == ~cond; {8895#false} is VALID [2018-11-23 12:03:33,538 INFO L273 TraceCheckUtils]: 82: Hoare triple {8895#false} assume !false; {8895#false} is VALID [2018-11-23 12:03:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-11-23 12:03:33,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:33,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:33,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:33,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:33,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:33,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:33,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {8894#true} call ULTIMATE.init(); {8894#true} is VALID [2018-11-23 12:03:33,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {8894#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8894#true} is VALID [2018-11-23 12:03:33,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {8894#true} assume true; {8894#true} is VALID [2018-11-23 12:03:33,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8894#true} {8894#true} #87#return; {8894#true} is VALID [2018-11-23 12:03:33,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {8894#true} call #t~ret2 := main(); {8894#true} is VALID [2018-11-23 12:03:33,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {8894#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8931#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:33,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {8931#(<= 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; {8897#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:33,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {8897#(<= 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; {8898#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:33,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {8898#(<= 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; {8899#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:33,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {8899#(<= 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; {8900#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:33,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {8900#(<= 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; {8901#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:33,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {8901#(<= 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; {8902#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:33,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {8902#(<= 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; {8903#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:33,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {8903#(<= 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; {8904#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:33,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {8904#(<= 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; {8905#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:33,804 INFO L273 TraceCheckUtils]: 15: Hoare triple {8905#(<= 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; {8906#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:33,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {8906#(<= 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; {8907#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:33,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {8907#(<= 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; {8908#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:33,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {8908#(<= 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; {8909#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:33,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {8909#(<= 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; {8910#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:33,808 INFO L273 TraceCheckUtils]: 20: Hoare triple {8910#(<= 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; {8911#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:33,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {8911#(<= 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; {8912#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:33,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {8912#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 12:03:33,810 INFO L273 TraceCheckUtils]: 23: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 12:03:33,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,811 INFO L273 TraceCheckUtils]: 28: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,811 INFO L273 TraceCheckUtils]: 31: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,812 INFO L273 TraceCheckUtils]: 34: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,812 INFO L273 TraceCheckUtils]: 35: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,813 INFO L273 TraceCheckUtils]: 39: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,813 INFO L273 TraceCheckUtils]: 40: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 12:03:33,813 INFO L273 TraceCheckUtils]: 41: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 12:03:33,813 INFO L273 TraceCheckUtils]: 42: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,814 INFO L273 TraceCheckUtils]: 43: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,814 INFO L273 TraceCheckUtils]: 44: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,814 INFO L273 TraceCheckUtils]: 46: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,814 INFO L273 TraceCheckUtils]: 47: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,814 INFO L273 TraceCheckUtils]: 48: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,815 INFO L273 TraceCheckUtils]: 49: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,815 INFO L273 TraceCheckUtils]: 53: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,815 INFO L273 TraceCheckUtils]: 54: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,816 INFO L273 TraceCheckUtils]: 55: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,816 INFO L273 TraceCheckUtils]: 56: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,816 INFO L273 TraceCheckUtils]: 57: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,816 INFO L273 TraceCheckUtils]: 58: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 12:03:33,816 INFO L273 TraceCheckUtils]: 59: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 12:03:33,816 INFO L273 TraceCheckUtils]: 60: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,817 INFO L273 TraceCheckUtils]: 61: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,817 INFO L273 TraceCheckUtils]: 62: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,817 INFO L273 TraceCheckUtils]: 63: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,817 INFO L273 TraceCheckUtils]: 64: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,817 INFO L273 TraceCheckUtils]: 65: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,817 INFO L273 TraceCheckUtils]: 66: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,818 INFO L273 TraceCheckUtils]: 67: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,818 INFO L273 TraceCheckUtils]: 68: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,818 INFO L273 TraceCheckUtils]: 69: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,818 INFO L273 TraceCheckUtils]: 70: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,818 INFO L273 TraceCheckUtils]: 71: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,818 INFO L273 TraceCheckUtils]: 72: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,818 INFO L273 TraceCheckUtils]: 73: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,819 INFO L273 TraceCheckUtils]: 74: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,819 INFO L273 TraceCheckUtils]: 75: Hoare triple {8895#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8895#false} is VALID [2018-11-23 12:03:33,819 INFO L273 TraceCheckUtils]: 76: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 12:03:33,819 INFO L273 TraceCheckUtils]: 77: Hoare triple {8895#false} havoc ~x~0;~x~0 := 0; {8895#false} is VALID [2018-11-23 12:03:33,819 INFO L273 TraceCheckUtils]: 78: Hoare triple {8895#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8895#false} is VALID [2018-11-23 12:03:33,819 INFO L256 TraceCheckUtils]: 79: Hoare triple {8895#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {8895#false} is VALID [2018-11-23 12:03:33,820 INFO L273 TraceCheckUtils]: 80: Hoare triple {8895#false} ~cond := #in~cond; {8895#false} is VALID [2018-11-23 12:03:33,820 INFO L273 TraceCheckUtils]: 81: Hoare triple {8895#false} assume 0 == ~cond; {8895#false} is VALID [2018-11-23 12:03:33,820 INFO L273 TraceCheckUtils]: 82: Hoare triple {8895#false} assume !false; {8895#false} is VALID [2018-11-23 12:03:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2018-11-23 12:03:33,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:33,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:03:33,844 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-11-23 12:03:33,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:33,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:03:33,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:33,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:03:33,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:03:33,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:03:33,872 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 20 states. [2018-11-23 12:03:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:34,699 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2018-11-23 12:03:34,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:03:34,699 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-11-23 12:03:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:03:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2018-11-23 12:03:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:03:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2018-11-23 12:03:34,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 120 transitions. [2018-11-23 12:03:34,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:34,823 INFO L225 Difference]: With dead ends: 157 [2018-11-23 12:03:34,823 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:03:34,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:03:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:03:34,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 12:03:34,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:34,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-23 12:03:34,878 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 12:03:34,879 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 12:03:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:34,880 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 12:03:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 12:03:34,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:34,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:34,881 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 12:03:34,882 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 12:03:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:34,883 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 12:03:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 12:03:34,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:34,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:34,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:34,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 12:03:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-23 12:03:34,885 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 83 [2018-11-23 12:03:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:34,886 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-23 12:03:34,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:03:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 12:03:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 12:03:34,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:34,887 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:34,887 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:34,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1688235596, now seen corresponding path program 17 times [2018-11-23 12:03:34,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:34,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:34,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:34,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:34,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:35,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {9807#true} call ULTIMATE.init(); {9807#true} is VALID [2018-11-23 12:03:35,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {9807#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9807#true} is VALID [2018-11-23 12:03:35,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {9807#true} assume true; {9807#true} is VALID [2018-11-23 12:03:35,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9807#true} {9807#true} #87#return; {9807#true} is VALID [2018-11-23 12:03:35,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {9807#true} call #t~ret2 := main(); {9807#true} is VALID [2018-11-23 12:03:35,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {9807#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9809#(= main_~i~0 0)} is VALID [2018-11-23 12:03:35,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {9809#(= 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; {9810#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:35,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {9810#(<= 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; {9811#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:35,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {9811#(<= 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; {9812#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:35,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {9812#(<= 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; {9813#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:35,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {9813#(<= 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; {9814#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:35,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {9814#(<= 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; {9815#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:35,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {9815#(<= 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; {9816#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:35,381 INFO L273 TraceCheckUtils]: 13: Hoare triple {9816#(<= 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; {9817#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:35,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {9817#(<= 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; {9818#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:35,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {9818#(<= 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; {9819#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:35,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {9819#(<= 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; {9820#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:35,384 INFO L273 TraceCheckUtils]: 17: Hoare triple {9820#(<= 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; {9821#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:35,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {9821#(<= 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; {9822#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:35,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {9822#(<= 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; {9823#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:35,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {9823#(<= 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; {9824#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:35,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {9824#(<= 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; {9825#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:35,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {9825#(<= 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; {9826#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:35,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {9826#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 12:03:35,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 12:03:35,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,390 INFO L273 TraceCheckUtils]: 29: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,391 INFO L273 TraceCheckUtils]: 30: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,391 INFO L273 TraceCheckUtils]: 31: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,391 INFO L273 TraceCheckUtils]: 32: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,391 INFO L273 TraceCheckUtils]: 33: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,391 INFO L273 TraceCheckUtils]: 34: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,392 INFO L273 TraceCheckUtils]: 35: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,392 INFO L273 TraceCheckUtils]: 36: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,392 INFO L273 TraceCheckUtils]: 37: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,392 INFO L273 TraceCheckUtils]: 38: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,392 INFO L273 TraceCheckUtils]: 39: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,393 INFO L273 TraceCheckUtils]: 40: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,393 INFO L273 TraceCheckUtils]: 41: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,393 INFO L273 TraceCheckUtils]: 42: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 12:03:35,393 INFO L273 TraceCheckUtils]: 43: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 12:03:35,393 INFO L273 TraceCheckUtils]: 44: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,393 INFO L273 TraceCheckUtils]: 45: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,393 INFO L273 TraceCheckUtils]: 46: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,394 INFO L273 TraceCheckUtils]: 47: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,394 INFO L273 TraceCheckUtils]: 51: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,394 INFO L273 TraceCheckUtils]: 52: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,394 INFO L273 TraceCheckUtils]: 53: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,394 INFO L273 TraceCheckUtils]: 54: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,394 INFO L273 TraceCheckUtils]: 55: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,395 INFO L273 TraceCheckUtils]: 56: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,395 INFO L273 TraceCheckUtils]: 57: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,395 INFO L273 TraceCheckUtils]: 58: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,395 INFO L273 TraceCheckUtils]: 59: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,395 INFO L273 TraceCheckUtils]: 60: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,395 INFO L273 TraceCheckUtils]: 61: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 12:03:35,395 INFO L273 TraceCheckUtils]: 62: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 12:03:35,395 INFO L273 TraceCheckUtils]: 63: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,395 INFO L273 TraceCheckUtils]: 64: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,396 INFO L273 TraceCheckUtils]: 65: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,396 INFO L273 TraceCheckUtils]: 66: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,396 INFO L273 TraceCheckUtils]: 67: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,396 INFO L273 TraceCheckUtils]: 68: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,396 INFO L273 TraceCheckUtils]: 69: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,396 INFO L273 TraceCheckUtils]: 70: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,396 INFO L273 TraceCheckUtils]: 71: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,396 INFO L273 TraceCheckUtils]: 72: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,397 INFO L273 TraceCheckUtils]: 73: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,397 INFO L273 TraceCheckUtils]: 74: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,397 INFO L273 TraceCheckUtils]: 75: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,397 INFO L273 TraceCheckUtils]: 76: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,397 INFO L273 TraceCheckUtils]: 77: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,397 INFO L273 TraceCheckUtils]: 78: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,397 INFO L273 TraceCheckUtils]: 79: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:03:35,397 INFO L273 TraceCheckUtils]: 80: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 12:03:35,397 INFO L273 TraceCheckUtils]: 81: Hoare triple {9808#false} havoc ~x~0;~x~0 := 0; {9808#false} is VALID [2018-11-23 12:03:35,398 INFO L273 TraceCheckUtils]: 82: Hoare triple {9808#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9808#false} is VALID [2018-11-23 12:03:35,398 INFO L256 TraceCheckUtils]: 83: Hoare triple {9808#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {9808#false} is VALID [2018-11-23 12:03:35,398 INFO L273 TraceCheckUtils]: 84: Hoare triple {9808#false} ~cond := #in~cond; {9808#false} is VALID [2018-11-23 12:03:35,398 INFO L273 TraceCheckUtils]: 85: Hoare triple {9808#false} assume 0 == ~cond; {9808#false} is VALID [2018-11-23 12:03:35,398 INFO L273 TraceCheckUtils]: 86: Hoare triple {9808#false} assume !false; {9808#false} is VALID [2018-11-23 12:03:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-23 12:03:35,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:35,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:35,411 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:04:34,701 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:04:34,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:34,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:34,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {9807#true} call ULTIMATE.init(); {9807#true} is VALID [2018-11-23 12:04:34,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {9807#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9807#true} is VALID [2018-11-23 12:04:35,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {9807#true} assume true; {9807#true} is VALID [2018-11-23 12:04:35,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9807#true} {9807#true} #87#return; {9807#true} is VALID [2018-11-23 12:04:35,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {9807#true} call #t~ret2 := main(); {9807#true} is VALID [2018-11-23 12:04:35,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {9807#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9845#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:35,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {9845#(<= 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; {9810#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:35,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {9810#(<= 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; {9811#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:35,004 INFO L273 TraceCheckUtils]: 8: Hoare triple {9811#(<= 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; {9812#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:35,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {9812#(<= 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; {9813#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:35,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {9813#(<= 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; {9814#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:35,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {9814#(<= 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; {9815#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:35,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {9815#(<= 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; {9816#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:35,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {9816#(<= 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; {9817#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:35,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {9817#(<= 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; {9818#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:35,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {9818#(<= 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; {9819#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:35,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {9819#(<= 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; {9820#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:35,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {9820#(<= 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; {9821#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:35,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {9821#(<= 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; {9822#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:35,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {9822#(<= 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; {9823#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:35,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {9823#(<= 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; {9824#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:35,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {9824#(<= 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; {9825#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:35,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {9825#(<= 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; {9826#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:35,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {9826#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 12:04:35,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 12:04:35,016 INFO L273 TraceCheckUtils]: 25: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,018 INFO L273 TraceCheckUtils]: 34: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,018 INFO L273 TraceCheckUtils]: 35: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,018 INFO L273 TraceCheckUtils]: 36: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,018 INFO L273 TraceCheckUtils]: 37: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,019 INFO L273 TraceCheckUtils]: 38: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,019 INFO L273 TraceCheckUtils]: 39: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,019 INFO L273 TraceCheckUtils]: 40: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,019 INFO L273 TraceCheckUtils]: 41: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 12:04:35,019 INFO L273 TraceCheckUtils]: 43: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 12:04:35,020 INFO L273 TraceCheckUtils]: 44: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,020 INFO L273 TraceCheckUtils]: 45: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,020 INFO L273 TraceCheckUtils]: 46: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,020 INFO L273 TraceCheckUtils]: 47: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,020 INFO L273 TraceCheckUtils]: 48: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,020 INFO L273 TraceCheckUtils]: 49: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,020 INFO L273 TraceCheckUtils]: 51: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,021 INFO L273 TraceCheckUtils]: 52: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,021 INFO L273 TraceCheckUtils]: 53: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,021 INFO L273 TraceCheckUtils]: 54: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,021 INFO L273 TraceCheckUtils]: 55: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,021 INFO L273 TraceCheckUtils]: 56: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,021 INFO L273 TraceCheckUtils]: 57: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,021 INFO L273 TraceCheckUtils]: 58: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,021 INFO L273 TraceCheckUtils]: 59: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,021 INFO L273 TraceCheckUtils]: 60: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,022 INFO L273 TraceCheckUtils]: 61: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 12:04:35,022 INFO L273 TraceCheckUtils]: 62: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 12:04:35,022 INFO L273 TraceCheckUtils]: 63: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,022 INFO L273 TraceCheckUtils]: 64: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,022 INFO L273 TraceCheckUtils]: 65: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,022 INFO L273 TraceCheckUtils]: 66: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,022 INFO L273 TraceCheckUtils]: 67: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,023 INFO L273 TraceCheckUtils]: 68: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,023 INFO L273 TraceCheckUtils]: 69: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,023 INFO L273 TraceCheckUtils]: 70: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,023 INFO L273 TraceCheckUtils]: 71: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,023 INFO L273 TraceCheckUtils]: 72: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,023 INFO L273 TraceCheckUtils]: 73: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,024 INFO L273 TraceCheckUtils]: 74: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,024 INFO L273 TraceCheckUtils]: 75: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,024 INFO L273 TraceCheckUtils]: 76: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,024 INFO L273 TraceCheckUtils]: 77: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,024 INFO L273 TraceCheckUtils]: 78: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,025 INFO L273 TraceCheckUtils]: 79: Hoare triple {9808#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9808#false} is VALID [2018-11-23 12:04:35,025 INFO L273 TraceCheckUtils]: 80: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 12:04:35,025 INFO L273 TraceCheckUtils]: 81: Hoare triple {9808#false} havoc ~x~0;~x~0 := 0; {9808#false} is VALID [2018-11-23 12:04:35,025 INFO L273 TraceCheckUtils]: 82: Hoare triple {9808#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9808#false} is VALID [2018-11-23 12:04:35,025 INFO L256 TraceCheckUtils]: 83: Hoare triple {9808#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {9808#false} is VALID [2018-11-23 12:04:35,025 INFO L273 TraceCheckUtils]: 84: Hoare triple {9808#false} ~cond := #in~cond; {9808#false} is VALID [2018-11-23 12:04:35,025 INFO L273 TraceCheckUtils]: 85: Hoare triple {9808#false} assume 0 == ~cond; {9808#false} is VALID [2018-11-23 12:04:35,026 INFO L273 TraceCheckUtils]: 86: Hoare triple {9808#false} assume !false; {9808#false} is VALID [2018-11-23 12:04:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-23 12:04:35,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:35,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:04:35,065 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-11-23 12:04:35,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:35,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:04:35,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:35,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:04:35,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:04:35,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:04:35,104 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 21 states. [2018-11-23 12:04:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:35,828 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-11-23 12:04:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:04:35,828 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-11-23 12:04:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:04:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2018-11-23 12:04:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:04:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2018-11-23 12:04:35,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 124 transitions. [2018-11-23 12:04:35,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:36,000 INFO L225 Difference]: With dead ends: 164 [2018-11-23 12:04:36,000 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:04:36,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:04:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:04:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-23 12:04:36,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:36,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:36,074 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:36,074 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:36,076 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:04:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:04:36,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:36,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:36,077 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:36,077 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:04:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:36,078 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:04:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:04:36,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:36,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:36,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:36,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:04:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-11-23 12:04:36,081 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 87 [2018-11-23 12:04:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:36,081 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-23 12:04:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:04:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:04:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:04:36,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:36,082 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:36,082 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:36,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:36,083 INFO L82 PathProgramCache]: Analyzing trace with hash 721612110, now seen corresponding path program 18 times [2018-11-23 12:04:36,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:36,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:36,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:36,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:36,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:36,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {10763#true} call ULTIMATE.init(); {10763#true} is VALID [2018-11-23 12:04:36,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {10763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10763#true} is VALID [2018-11-23 12:04:36,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {10763#true} assume true; {10763#true} is VALID [2018-11-23 12:04:36,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10763#true} {10763#true} #87#return; {10763#true} is VALID [2018-11-23 12:04:36,547 INFO L256 TraceCheckUtils]: 4: Hoare triple {10763#true} call #t~ret2 := main(); {10763#true} is VALID [2018-11-23 12:04:36,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {10763#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10765#(= main_~i~0 0)} is VALID [2018-11-23 12:04:36,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {10765#(= 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; {10766#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:36,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {10766#(<= 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; {10767#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:36,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {10767#(<= 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; {10768#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:36,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {10768#(<= 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; {10769#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:36,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {10769#(<= 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; {10770#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:36,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {10770#(<= 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; {10771#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:36,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {10771#(<= 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; {10772#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:36,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {10772#(<= 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; {10773#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:36,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {10773#(<= 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; {10774#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:36,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {10774#(<= 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; {10775#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:36,555 INFO L273 TraceCheckUtils]: 16: Hoare triple {10775#(<= 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; {10776#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:36,556 INFO L273 TraceCheckUtils]: 17: Hoare triple {10776#(<= 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; {10777#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:36,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {10777#(<= 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; {10778#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:36,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {10778#(<= 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; {10779#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:36,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {10779#(<= 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; {10780#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:36,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {10780#(<= 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; {10781#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:36,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {10781#(<= 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; {10782#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:36,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {10782#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10783#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:36,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {10783#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 12:04:36,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 12:04:36,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,562 INFO L273 TraceCheckUtils]: 27: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,563 INFO L273 TraceCheckUtils]: 28: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,564 INFO L273 TraceCheckUtils]: 36: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,564 INFO L273 TraceCheckUtils]: 37: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,564 INFO L273 TraceCheckUtils]: 38: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,565 INFO L273 TraceCheckUtils]: 39: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,565 INFO L273 TraceCheckUtils]: 40: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,565 INFO L273 TraceCheckUtils]: 41: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,565 INFO L273 TraceCheckUtils]: 42: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,565 INFO L273 TraceCheckUtils]: 43: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,565 INFO L273 TraceCheckUtils]: 44: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 12:04:36,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 12:04:36,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,566 INFO L273 TraceCheckUtils]: 49: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,566 INFO L273 TraceCheckUtils]: 53: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,566 INFO L273 TraceCheckUtils]: 54: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,566 INFO L273 TraceCheckUtils]: 55: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,567 INFO L273 TraceCheckUtils]: 56: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,567 INFO L273 TraceCheckUtils]: 57: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,567 INFO L273 TraceCheckUtils]: 58: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,567 INFO L273 TraceCheckUtils]: 59: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,567 INFO L273 TraceCheckUtils]: 60: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,567 INFO L273 TraceCheckUtils]: 61: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,567 INFO L273 TraceCheckUtils]: 62: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,567 INFO L273 TraceCheckUtils]: 63: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,567 INFO L273 TraceCheckUtils]: 64: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 12:04:36,568 INFO L273 TraceCheckUtils]: 65: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 12:04:36,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,568 INFO L273 TraceCheckUtils]: 67: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,568 INFO L273 TraceCheckUtils]: 68: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,568 INFO L273 TraceCheckUtils]: 69: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,568 INFO L273 TraceCheckUtils]: 70: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,568 INFO L273 TraceCheckUtils]: 71: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,568 INFO L273 TraceCheckUtils]: 72: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,568 INFO L273 TraceCheckUtils]: 73: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,569 INFO L273 TraceCheckUtils]: 74: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,569 INFO L273 TraceCheckUtils]: 75: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,569 INFO L273 TraceCheckUtils]: 76: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,569 INFO L273 TraceCheckUtils]: 77: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,569 INFO L273 TraceCheckUtils]: 78: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,569 INFO L273 TraceCheckUtils]: 79: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,569 INFO L273 TraceCheckUtils]: 80: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,569 INFO L273 TraceCheckUtils]: 81: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,569 INFO L273 TraceCheckUtils]: 82: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,570 INFO L273 TraceCheckUtils]: 83: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:04:36,570 INFO L273 TraceCheckUtils]: 84: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 12:04:36,570 INFO L273 TraceCheckUtils]: 85: Hoare triple {10764#false} havoc ~x~0;~x~0 := 0; {10764#false} is VALID [2018-11-23 12:04:36,570 INFO L273 TraceCheckUtils]: 86: Hoare triple {10764#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10764#false} is VALID [2018-11-23 12:04:36,570 INFO L256 TraceCheckUtils]: 87: Hoare triple {10764#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {10764#false} is VALID [2018-11-23 12:04:36,570 INFO L273 TraceCheckUtils]: 88: Hoare triple {10764#false} ~cond := #in~cond; {10764#false} is VALID [2018-11-23 12:04:36,570 INFO L273 TraceCheckUtils]: 89: Hoare triple {10764#false} assume 0 == ~cond; {10764#false} is VALID [2018-11-23 12:04:36,570 INFO L273 TraceCheckUtils]: 90: Hoare triple {10764#false} assume !false; {10764#false} is VALID [2018-11-23 12:04:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-23 12:04:36,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:36,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:36,584 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:22,578 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 12:05:22,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:22,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {10763#true} call ULTIMATE.init(); {10763#true} is VALID [2018-11-23 12:05:22,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {10763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10763#true} is VALID [2018-11-23 12:05:22,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {10763#true} assume true; {10763#true} is VALID [2018-11-23 12:05:22,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10763#true} {10763#true} #87#return; {10763#true} is VALID [2018-11-23 12:05:22,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {10763#true} call #t~ret2 := main(); {10763#true} is VALID [2018-11-23 12:05:22,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {10763#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10802#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:22,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {10802#(<= 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; {10766#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {10766#(<= 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; {10767#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {10767#(<= 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; {10768#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {10768#(<= 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; {10769#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:22,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {10769#(<= 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; {10770#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:22,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {10770#(<= 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; {10771#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:22,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {10771#(<= 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; {10772#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:22,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {10772#(<= 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; {10773#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:22,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {10773#(<= 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; {10774#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:22,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {10774#(<= 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; {10775#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:22,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {10775#(<= 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; {10776#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:22,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {10776#(<= 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; {10777#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:22,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {10777#(<= 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; {10778#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:22,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {10778#(<= 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; {10779#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:22,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {10779#(<= 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; {10780#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:22,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {10780#(<= 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; {10781#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:22,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {10781#(<= 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; {10782#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:22,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {10782#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10783#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:22,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {10783#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 12:05:22,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 12:05:22,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,805 INFO L273 TraceCheckUtils]: 28: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,806 INFO L273 TraceCheckUtils]: 33: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,806 INFO L273 TraceCheckUtils]: 34: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,806 INFO L273 TraceCheckUtils]: 35: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,807 INFO L273 TraceCheckUtils]: 39: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,807 INFO L273 TraceCheckUtils]: 40: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,807 INFO L273 TraceCheckUtils]: 41: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,807 INFO L273 TraceCheckUtils]: 42: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,807 INFO L273 TraceCheckUtils]: 43: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 12:05:22,808 INFO L273 TraceCheckUtils]: 45: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 12:05:22,808 INFO L273 TraceCheckUtils]: 46: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,808 INFO L273 TraceCheckUtils]: 47: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,808 INFO L273 TraceCheckUtils]: 48: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,808 INFO L273 TraceCheckUtils]: 49: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,808 INFO L273 TraceCheckUtils]: 51: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,808 INFO L273 TraceCheckUtils]: 52: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,808 INFO L273 TraceCheckUtils]: 53: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,809 INFO L273 TraceCheckUtils]: 54: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,809 INFO L273 TraceCheckUtils]: 55: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,809 INFO L273 TraceCheckUtils]: 56: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,809 INFO L273 TraceCheckUtils]: 57: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,809 INFO L273 TraceCheckUtils]: 58: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,809 INFO L273 TraceCheckUtils]: 59: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,809 INFO L273 TraceCheckUtils]: 60: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,809 INFO L273 TraceCheckUtils]: 61: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,809 INFO L273 TraceCheckUtils]: 62: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,810 INFO L273 TraceCheckUtils]: 63: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,810 INFO L273 TraceCheckUtils]: 64: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 12:05:22,810 INFO L273 TraceCheckUtils]: 65: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 12:05:22,810 INFO L273 TraceCheckUtils]: 66: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,810 INFO L273 TraceCheckUtils]: 67: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,810 INFO L273 TraceCheckUtils]: 68: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,810 INFO L273 TraceCheckUtils]: 69: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,810 INFO L273 TraceCheckUtils]: 70: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,810 INFO L273 TraceCheckUtils]: 71: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,811 INFO L273 TraceCheckUtils]: 72: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,811 INFO L273 TraceCheckUtils]: 73: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,811 INFO L273 TraceCheckUtils]: 74: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,811 INFO L273 TraceCheckUtils]: 75: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,811 INFO L273 TraceCheckUtils]: 76: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,811 INFO L273 TraceCheckUtils]: 77: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,811 INFO L273 TraceCheckUtils]: 78: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,811 INFO L273 TraceCheckUtils]: 79: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,811 INFO L273 TraceCheckUtils]: 80: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,812 INFO L273 TraceCheckUtils]: 81: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,812 INFO L273 TraceCheckUtils]: 82: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,812 INFO L273 TraceCheckUtils]: 83: Hoare triple {10764#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10764#false} is VALID [2018-11-23 12:05:22,812 INFO L273 TraceCheckUtils]: 84: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 12:05:22,812 INFO L273 TraceCheckUtils]: 85: Hoare triple {10764#false} havoc ~x~0;~x~0 := 0; {10764#false} is VALID [2018-11-23 12:05:22,812 INFO L273 TraceCheckUtils]: 86: Hoare triple {10764#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10764#false} is VALID [2018-11-23 12:05:22,812 INFO L256 TraceCheckUtils]: 87: Hoare triple {10764#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {10764#false} is VALID [2018-11-23 12:05:22,812 INFO L273 TraceCheckUtils]: 88: Hoare triple {10764#false} ~cond := #in~cond; {10764#false} is VALID [2018-11-23 12:05:22,812 INFO L273 TraceCheckUtils]: 89: Hoare triple {10764#false} assume 0 == ~cond; {10764#false} is VALID [2018-11-23 12:05:22,813 INFO L273 TraceCheckUtils]: 90: Hoare triple {10764#false} assume !false; {10764#false} is VALID [2018-11-23 12:05:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-11-23 12:05:22,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:22,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:05:22,845 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 91 [2018-11-23 12:05:22,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:22,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:05:22,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:22,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:05:22,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:05:22,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:22,876 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 22 states. [2018-11-23 12:05:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,606 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-11-23 12:05:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:05:23,606 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 91 [2018-11-23 12:05:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 128 transitions. [2018-11-23 12:05:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 128 transitions. [2018-11-23 12:05:23,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 128 transitions. [2018-11-23 12:05:23,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:23,735 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:05:23,736 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 12:05:23,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 12:05:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-23 12:05:23,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:23,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 100 states. [2018-11-23 12:05:23,806 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 12:05:23,806 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 12:05:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,808 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-11-23 12:05:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-23 12:05:23,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,808 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 12:05:23,808 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 12:05:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,810 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-11-23 12:05:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-23 12:05:23,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:23,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:05:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-23 12:05:23,811 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 91 [2018-11-23 12:05:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:23,812 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-23 12:05:23,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:05:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-23 12:05:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 12:05:23,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:23,812 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:23,813 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:23,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash -733207156, now seen corresponding path program 19 times [2018-11-23 12:05:23,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:23,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:23,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:23,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {11762#true} call ULTIMATE.init(); {11762#true} is VALID [2018-11-23 12:05:24,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {11762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11762#true} is VALID [2018-11-23 12:05:24,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {11762#true} assume true; {11762#true} is VALID [2018-11-23 12:05:24,234 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11762#true} {11762#true} #87#return; {11762#true} is VALID [2018-11-23 12:05:24,234 INFO L256 TraceCheckUtils]: 4: Hoare triple {11762#true} call #t~ret2 := main(); {11762#true} is VALID [2018-11-23 12:05:24,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {11762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11764#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {11764#(= 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; {11765#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {11765#(<= 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; {11766#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {11766#(<= 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; {11767#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {11767#(<= 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; {11768#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {11768#(<= 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; {11769#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {11769#(<= 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; {11770#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {11770#(<= 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; {11771#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {11771#(<= 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; {11772#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {11772#(<= 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; {11773#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {11773#(<= 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; {11774#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {11774#(<= 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; {11775#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,244 INFO L273 TraceCheckUtils]: 17: Hoare triple {11775#(<= 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; {11776#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {11776#(<= 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; {11777#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,246 INFO L273 TraceCheckUtils]: 19: Hoare triple {11777#(<= 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; {11778#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:24,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {11778#(<= 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; {11779#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:24,247 INFO L273 TraceCheckUtils]: 21: Hoare triple {11779#(<= 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; {11780#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:24,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {11780#(<= 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; {11781#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:24,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {11781#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11782#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:24,250 INFO L273 TraceCheckUtils]: 24: Hoare triple {11782#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11783#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:24,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {11783#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 12:05:24,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 12:05:24,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,251 INFO L273 TraceCheckUtils]: 29: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,252 INFO L273 TraceCheckUtils]: 33: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,253 INFO L273 TraceCheckUtils]: 35: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,253 INFO L273 TraceCheckUtils]: 36: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,253 INFO L273 TraceCheckUtils]: 40: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,254 INFO L273 TraceCheckUtils]: 41: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,254 INFO L273 TraceCheckUtils]: 43: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,254 INFO L273 TraceCheckUtils]: 44: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,254 INFO L273 TraceCheckUtils]: 45: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 12:05:24,254 INFO L273 TraceCheckUtils]: 47: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 12:05:24,255 INFO L273 TraceCheckUtils]: 48: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,255 INFO L273 TraceCheckUtils]: 49: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,255 INFO L273 TraceCheckUtils]: 50: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,255 INFO L273 TraceCheckUtils]: 51: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,255 INFO L273 TraceCheckUtils]: 52: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,255 INFO L273 TraceCheckUtils]: 53: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,255 INFO L273 TraceCheckUtils]: 54: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,255 INFO L273 TraceCheckUtils]: 56: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,256 INFO L273 TraceCheckUtils]: 58: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,256 INFO L273 TraceCheckUtils]: 59: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,256 INFO L273 TraceCheckUtils]: 60: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,256 INFO L273 TraceCheckUtils]: 61: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,256 INFO L273 TraceCheckUtils]: 62: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,256 INFO L273 TraceCheckUtils]: 63: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,256 INFO L273 TraceCheckUtils]: 65: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,257 INFO L273 TraceCheckUtils]: 66: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,257 INFO L273 TraceCheckUtils]: 67: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 12:05:24,257 INFO L273 TraceCheckUtils]: 68: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 12:05:24,257 INFO L273 TraceCheckUtils]: 69: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,257 INFO L273 TraceCheckUtils]: 70: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,257 INFO L273 TraceCheckUtils]: 71: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,257 INFO L273 TraceCheckUtils]: 72: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,257 INFO L273 TraceCheckUtils]: 73: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,257 INFO L273 TraceCheckUtils]: 74: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,258 INFO L273 TraceCheckUtils]: 75: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,258 INFO L273 TraceCheckUtils]: 76: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,258 INFO L273 TraceCheckUtils]: 77: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,258 INFO L273 TraceCheckUtils]: 78: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,258 INFO L273 TraceCheckUtils]: 79: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,258 INFO L273 TraceCheckUtils]: 80: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,258 INFO L273 TraceCheckUtils]: 81: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,258 INFO L273 TraceCheckUtils]: 82: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,258 INFO L273 TraceCheckUtils]: 83: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,259 INFO L273 TraceCheckUtils]: 84: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,259 INFO L273 TraceCheckUtils]: 86: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,259 INFO L273 TraceCheckUtils]: 87: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,259 INFO L273 TraceCheckUtils]: 88: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 12:05:24,259 INFO L273 TraceCheckUtils]: 89: Hoare triple {11763#false} havoc ~x~0;~x~0 := 0; {11763#false} is VALID [2018-11-23 12:05:24,259 INFO L273 TraceCheckUtils]: 90: Hoare triple {11763#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11763#false} is VALID [2018-11-23 12:05:24,259 INFO L256 TraceCheckUtils]: 91: Hoare triple {11763#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {11763#false} is VALID [2018-11-23 12:05:24,260 INFO L273 TraceCheckUtils]: 92: Hoare triple {11763#false} ~cond := #in~cond; {11763#false} is VALID [2018-11-23 12:05:24,260 INFO L273 TraceCheckUtils]: 93: Hoare triple {11763#false} assume 0 == ~cond; {11763#false} is VALID [2018-11-23 12:05:24,260 INFO L273 TraceCheckUtils]: 94: Hoare triple {11763#false} assume !false; {11763#false} is VALID [2018-11-23 12:05:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-23 12:05:24,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:24,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:24,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:24,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {11762#true} call ULTIMATE.init(); {11762#true} is VALID [2018-11-23 12:05:24,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {11762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11762#true} is VALID [2018-11-23 12:05:24,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {11762#true} assume true; {11762#true} is VALID [2018-11-23 12:05:24,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11762#true} {11762#true} #87#return; {11762#true} is VALID [2018-11-23 12:05:24,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {11762#true} call #t~ret2 := main(); {11762#true} is VALID [2018-11-23 12:05:24,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {11762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11802#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:24,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {11802#(<= 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; {11765#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {11765#(<= 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; {11766#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {11766#(<= 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; {11767#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {11767#(<= 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; {11768#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {11768#(<= 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; {11769#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {11769#(<= 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; {11770#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:24,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {11770#(<= 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; {11771#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:24,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {11771#(<= 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; {11772#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:24,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {11772#(<= 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; {11773#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:24,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {11773#(<= 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; {11774#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:24,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {11774#(<= 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; {11775#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:24,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {11775#(<= 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; {11776#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:24,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {11776#(<= 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; {11777#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:24,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {11777#(<= 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; {11778#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:24,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {11778#(<= 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; {11779#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:24,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {11779#(<= 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; {11780#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:24,520 INFO L273 TraceCheckUtils]: 22: Hoare triple {11780#(<= 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; {11781#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:24,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {11781#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11782#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:24,522 INFO L273 TraceCheckUtils]: 24: Hoare triple {11782#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11783#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:24,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {11783#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 12:05:24,523 INFO L273 TraceCheckUtils]: 26: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 12:05:24,523 INFO L273 TraceCheckUtils]: 27: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,523 INFO L273 TraceCheckUtils]: 28: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,523 INFO L273 TraceCheckUtils]: 29: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,524 INFO L273 TraceCheckUtils]: 30: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,524 INFO L273 TraceCheckUtils]: 35: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,525 INFO L273 TraceCheckUtils]: 36: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,525 INFO L273 TraceCheckUtils]: 37: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,525 INFO L273 TraceCheckUtils]: 40: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,526 INFO L273 TraceCheckUtils]: 41: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,526 INFO L273 TraceCheckUtils]: 42: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,526 INFO L273 TraceCheckUtils]: 43: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,526 INFO L273 TraceCheckUtils]: 44: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,526 INFO L273 TraceCheckUtils]: 45: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 12:05:24,527 INFO L273 TraceCheckUtils]: 47: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 12:05:24,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,527 INFO L273 TraceCheckUtils]: 49: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,527 INFO L273 TraceCheckUtils]: 50: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,527 INFO L273 TraceCheckUtils]: 51: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,527 INFO L273 TraceCheckUtils]: 52: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,528 INFO L273 TraceCheckUtils]: 53: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,528 INFO L273 TraceCheckUtils]: 54: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,528 INFO L273 TraceCheckUtils]: 55: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,528 INFO L273 TraceCheckUtils]: 56: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,528 INFO L273 TraceCheckUtils]: 57: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,528 INFO L273 TraceCheckUtils]: 58: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,528 INFO L273 TraceCheckUtils]: 59: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,528 INFO L273 TraceCheckUtils]: 60: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 61: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 62: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 63: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 64: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 65: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 66: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 67: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 68: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 12:05:24,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 70: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 71: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 72: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 73: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 74: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 75: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 76: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 77: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,530 INFO L273 TraceCheckUtils]: 78: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 79: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 80: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 81: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 82: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 83: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 84: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 85: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 86: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,531 INFO L273 TraceCheckUtils]: 87: Hoare triple {11763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11763#false} is VALID [2018-11-23 12:05:24,532 INFO L273 TraceCheckUtils]: 88: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 12:05:24,532 INFO L273 TraceCheckUtils]: 89: Hoare triple {11763#false} havoc ~x~0;~x~0 := 0; {11763#false} is VALID [2018-11-23 12:05:24,532 INFO L273 TraceCheckUtils]: 90: Hoare triple {11763#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11763#false} is VALID [2018-11-23 12:05:24,532 INFO L256 TraceCheckUtils]: 91: Hoare triple {11763#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {11763#false} is VALID [2018-11-23 12:05:24,532 INFO L273 TraceCheckUtils]: 92: Hoare triple {11763#false} ~cond := #in~cond; {11763#false} is VALID [2018-11-23 12:05:24,532 INFO L273 TraceCheckUtils]: 93: Hoare triple {11763#false} assume 0 == ~cond; {11763#false} is VALID [2018-11-23 12:05:24,532 INFO L273 TraceCheckUtils]: 94: Hoare triple {11763#false} assume !false; {11763#false} is VALID [2018-11-23 12:05:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-23 12:05:24,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:24,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:05:24,556 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2018-11-23 12:05:24,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:24,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:05:24,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:24,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:05:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:05:24,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:05:24,593 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 23 states. [2018-11-23 12:05:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,333 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-11-23 12:05:25,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:05:25,333 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2018-11-23 12:05:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 132 transitions. [2018-11-23 12:05:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 132 transitions. [2018-11-23 12:05:25,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 132 transitions. [2018-11-23 12:05:25,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:25,467 INFO L225 Difference]: With dead ends: 178 [2018-11-23 12:05:25,467 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:05:25,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:05:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:05:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-23 12:05:25,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:25,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 104 states. [2018-11-23 12:05:25,537 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-23 12:05:25,537 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-23 12:05:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,538 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-11-23 12:05:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-23 12:05:25,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:25,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:25,539 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-23 12:05:25,539 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-23 12:05:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,541 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-11-23 12:05:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-23 12:05:25,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:25,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:25,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:25,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:05:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-11-23 12:05:25,544 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 95 [2018-11-23 12:05:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:25,544 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-11-23 12:05:25,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:05:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-23 12:05:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 12:05:25,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:25,545 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:25,545 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:25,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:25,546 INFO L82 PathProgramCache]: Analyzing trace with hash -585802866, now seen corresponding path program 20 times [2018-11-23 12:05:25,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:25,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:25,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:25,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {12804#true} call ULTIMATE.init(); {12804#true} is VALID [2018-11-23 12:05:25,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {12804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12804#true} is VALID [2018-11-23 12:05:25,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {12804#true} assume true; {12804#true} is VALID [2018-11-23 12:05:25,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12804#true} {12804#true} #87#return; {12804#true} is VALID [2018-11-23 12:05:25,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {12804#true} call #t~ret2 := main(); {12804#true} is VALID [2018-11-23 12:05:25,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {12804#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12806#(= main_~i~0 0)} is VALID [2018-11-23 12:05:25,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {12806#(= 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; {12807#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {12807#(<= 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; {12808#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {12808#(<= 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; {12809#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {12809#(<= 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; {12810#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {12810#(<= 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; {12811#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {12811#(<= 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; {12812#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:25,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {12812#(<= 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; {12813#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:25,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {12813#(<= 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; {12814#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:25,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {12814#(<= 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; {12815#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:25,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {12815#(<= 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; {12816#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:25,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {12816#(<= 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; {12817#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:25,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {12817#(<= 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; {12818#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:25,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {12818#(<= 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; {12819#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:25,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {12819#(<= 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; {12820#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:25,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {12820#(<= 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; {12821#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:25,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {12821#(<= 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; {12822#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:25,989 INFO L273 TraceCheckUtils]: 22: Hoare triple {12822#(<= 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; {12823#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:25,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {12823#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12824#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:25,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {12824#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12825#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:25,992 INFO L273 TraceCheckUtils]: 25: Hoare triple {12825#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12826#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:25,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {12826#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 12:05:25,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 12:05:25,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,993 INFO L273 TraceCheckUtils]: 30: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,993 INFO L273 TraceCheckUtils]: 31: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,993 INFO L273 TraceCheckUtils]: 32: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,994 INFO L273 TraceCheckUtils]: 33: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,994 INFO L273 TraceCheckUtils]: 34: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,994 INFO L273 TraceCheckUtils]: 35: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,994 INFO L273 TraceCheckUtils]: 36: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,994 INFO L273 TraceCheckUtils]: 37: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,995 INFO L273 TraceCheckUtils]: 38: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,995 INFO L273 TraceCheckUtils]: 39: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,995 INFO L273 TraceCheckUtils]: 40: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,995 INFO L273 TraceCheckUtils]: 41: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,995 INFO L273 TraceCheckUtils]: 42: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,995 INFO L273 TraceCheckUtils]: 43: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,996 INFO L273 TraceCheckUtils]: 44: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,996 INFO L273 TraceCheckUtils]: 45: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,996 INFO L273 TraceCheckUtils]: 46: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 12:05:25,996 INFO L273 TraceCheckUtils]: 49: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 12:05:25,997 INFO L273 TraceCheckUtils]: 50: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,997 INFO L273 TraceCheckUtils]: 51: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,997 INFO L273 TraceCheckUtils]: 52: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,997 INFO L273 TraceCheckUtils]: 53: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,997 INFO L273 TraceCheckUtils]: 54: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,997 INFO L273 TraceCheckUtils]: 55: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,997 INFO L273 TraceCheckUtils]: 56: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,997 INFO L273 TraceCheckUtils]: 57: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,997 INFO L273 TraceCheckUtils]: 58: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,998 INFO L273 TraceCheckUtils]: 59: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,998 INFO L273 TraceCheckUtils]: 60: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,998 INFO L273 TraceCheckUtils]: 61: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,998 INFO L273 TraceCheckUtils]: 62: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,998 INFO L273 TraceCheckUtils]: 63: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,998 INFO L273 TraceCheckUtils]: 64: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,998 INFO L273 TraceCheckUtils]: 65: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,998 INFO L273 TraceCheckUtils]: 66: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,998 INFO L273 TraceCheckUtils]: 67: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,999 INFO L273 TraceCheckUtils]: 68: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,999 INFO L273 TraceCheckUtils]: 69: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,999 INFO L273 TraceCheckUtils]: 70: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 12:05:25,999 INFO L273 TraceCheckUtils]: 71: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 12:05:25,999 INFO L273 TraceCheckUtils]: 72: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,999 INFO L273 TraceCheckUtils]: 73: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,999 INFO L273 TraceCheckUtils]: 74: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,999 INFO L273 TraceCheckUtils]: 75: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:25,999 INFO L273 TraceCheckUtils]: 76: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,000 INFO L273 TraceCheckUtils]: 77: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,000 INFO L273 TraceCheckUtils]: 78: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,000 INFO L273 TraceCheckUtils]: 79: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,000 INFO L273 TraceCheckUtils]: 82: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,000 INFO L273 TraceCheckUtils]: 83: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,000 INFO L273 TraceCheckUtils]: 84: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,001 INFO L273 TraceCheckUtils]: 85: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,001 INFO L273 TraceCheckUtils]: 86: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,001 INFO L273 TraceCheckUtils]: 87: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,001 INFO L273 TraceCheckUtils]: 88: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,001 INFO L273 TraceCheckUtils]: 89: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,001 INFO L273 TraceCheckUtils]: 90: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,001 INFO L273 TraceCheckUtils]: 91: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,001 INFO L273 TraceCheckUtils]: 92: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 12:05:26,001 INFO L273 TraceCheckUtils]: 93: Hoare triple {12805#false} havoc ~x~0;~x~0 := 0; {12805#false} is VALID [2018-11-23 12:05:26,002 INFO L273 TraceCheckUtils]: 94: Hoare triple {12805#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12805#false} is VALID [2018-11-23 12:05:26,002 INFO L256 TraceCheckUtils]: 95: Hoare triple {12805#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {12805#false} is VALID [2018-11-23 12:05:26,002 INFO L273 TraceCheckUtils]: 96: Hoare triple {12805#false} ~cond := #in~cond; {12805#false} is VALID [2018-11-23 12:05:26,002 INFO L273 TraceCheckUtils]: 97: Hoare triple {12805#false} assume 0 == ~cond; {12805#false} is VALID [2018-11-23 12:05:26,002 INFO L273 TraceCheckUtils]: 98: Hoare triple {12805#false} assume !false; {12805#false} is VALID [2018-11-23 12:05:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-23 12:05:26,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:26,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:26,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:26,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:26,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:26,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:26,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {12804#true} call ULTIMATE.init(); {12804#true} is VALID [2018-11-23 12:05:26,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {12804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12804#true} is VALID [2018-11-23 12:05:26,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {12804#true} assume true; {12804#true} is VALID [2018-11-23 12:05:26,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12804#true} {12804#true} #87#return; {12804#true} is VALID [2018-11-23 12:05:26,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {12804#true} call #t~ret2 := main(); {12804#true} is VALID [2018-11-23 12:05:26,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {12804#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12845#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:26,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {12845#(<= 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; {12807#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:26,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {12807#(<= 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; {12808#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:26,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {12808#(<= 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; {12809#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:26,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {12809#(<= 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; {12810#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:26,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {12810#(<= 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; {12811#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:26,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {12811#(<= 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; {12812#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:26,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {12812#(<= 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; {12813#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:26,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {12813#(<= 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; {12814#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:26,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {12814#(<= 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; {12815#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:26,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {12815#(<= 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; {12816#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:26,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {12816#(<= 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; {12817#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:26,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {12817#(<= 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; {12818#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:26,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {12818#(<= 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; {12819#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:26,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {12819#(<= 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; {12820#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:26,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {12820#(<= 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; {12821#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:26,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {12821#(<= 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; {12822#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:26,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {12822#(<= 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; {12823#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:26,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {12823#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12824#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:26,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {12824#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12825#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:26,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {12825#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12826#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:26,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {12826#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 12:05:26,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 12:05:26,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,417 INFO L273 TraceCheckUtils]: 32: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,417 INFO L273 TraceCheckUtils]: 33: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,418 INFO L273 TraceCheckUtils]: 34: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,418 INFO L273 TraceCheckUtils]: 35: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,418 INFO L273 TraceCheckUtils]: 37: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,418 INFO L273 TraceCheckUtils]: 38: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,419 INFO L273 TraceCheckUtils]: 39: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,419 INFO L273 TraceCheckUtils]: 40: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,419 INFO L273 TraceCheckUtils]: 41: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,419 INFO L273 TraceCheckUtils]: 43: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,419 INFO L273 TraceCheckUtils]: 44: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,420 INFO L273 TraceCheckUtils]: 45: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,420 INFO L273 TraceCheckUtils]: 46: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,420 INFO L273 TraceCheckUtils]: 47: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 12:05:26,420 INFO L273 TraceCheckUtils]: 49: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 12:05:26,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,421 INFO L273 TraceCheckUtils]: 51: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,421 INFO L273 TraceCheckUtils]: 52: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,421 INFO L273 TraceCheckUtils]: 55: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,422 INFO L273 TraceCheckUtils]: 56: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,422 INFO L273 TraceCheckUtils]: 57: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,422 INFO L273 TraceCheckUtils]: 58: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,422 INFO L273 TraceCheckUtils]: 59: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,422 INFO L273 TraceCheckUtils]: 60: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,422 INFO L273 TraceCheckUtils]: 61: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,422 INFO L273 TraceCheckUtils]: 62: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 63: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 64: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 65: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 66: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 67: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 68: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 69: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 70: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 71: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 72: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 73: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 74: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 75: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 76: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 77: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 78: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 79: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 80: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,425 INFO L273 TraceCheckUtils]: 81: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,425 INFO L273 TraceCheckUtils]: 82: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,425 INFO L273 TraceCheckUtils]: 83: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,425 INFO L273 TraceCheckUtils]: 84: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,425 INFO L273 TraceCheckUtils]: 85: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,425 INFO L273 TraceCheckUtils]: 86: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,425 INFO L273 TraceCheckUtils]: 87: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,425 INFO L273 TraceCheckUtils]: 88: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,426 INFO L273 TraceCheckUtils]: 89: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,426 INFO L273 TraceCheckUtils]: 90: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,426 INFO L273 TraceCheckUtils]: 91: Hoare triple {12805#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12805#false} is VALID [2018-11-23 12:05:26,426 INFO L273 TraceCheckUtils]: 92: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 12:05:26,426 INFO L273 TraceCheckUtils]: 93: Hoare triple {12805#false} havoc ~x~0;~x~0 := 0; {12805#false} is VALID [2018-11-23 12:05:26,426 INFO L273 TraceCheckUtils]: 94: Hoare triple {12805#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12805#false} is VALID [2018-11-23 12:05:26,426 INFO L256 TraceCheckUtils]: 95: Hoare triple {12805#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {12805#false} is VALID [2018-11-23 12:05:26,427 INFO L273 TraceCheckUtils]: 96: Hoare triple {12805#false} ~cond := #in~cond; {12805#false} is VALID [2018-11-23 12:05:26,427 INFO L273 TraceCheckUtils]: 97: Hoare triple {12805#false} assume 0 == ~cond; {12805#false} is VALID [2018-11-23 12:05:26,427 INFO L273 TraceCheckUtils]: 98: Hoare triple {12805#false} assume !false; {12805#false} is VALID [2018-11-23 12:05:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-23 12:05:26,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:26,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:05:26,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2018-11-23 12:05:26,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:26,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:05:26,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:26,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:05:26,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:05:26,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:26,485 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 24 states. [2018-11-23 12:05:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:27,454 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2018-11-23 12:05:27,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:05:27,454 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2018-11-23 12:05:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 136 transitions. [2018-11-23 12:05:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 136 transitions. [2018-11-23 12:05:27,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 136 transitions. [2018-11-23 12:05:28,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:28,668 INFO L225 Difference]: With dead ends: 185 [2018-11-23 12:05:28,668 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:05:28,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:05:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-23 12:05:29,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:29,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 108 states. [2018-11-23 12:05:29,551 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2018-11-23 12:05:29,551 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2018-11-23 12:05:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:29,553 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:05:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:05:29,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:29,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:29,554 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2018-11-23 12:05:29,554 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2018-11-23 12:05:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:29,556 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:05:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:05:29,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:29,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:29,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:29,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 12:05:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-11-23 12:05:29,558 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 99 [2018-11-23 12:05:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:29,558 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-11-23 12:05:29,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:05:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:05:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:05:29,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:29,559 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:29,560 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:29,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:29,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1797411636, now seen corresponding path program 21 times [2018-11-23 12:05:29,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:29,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:29,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:29,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:29,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {13889#true} call ULTIMATE.init(); {13889#true} is VALID [2018-11-23 12:05:29,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {13889#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13889#true} is VALID [2018-11-23 12:05:29,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {13889#true} assume true; {13889#true} is VALID [2018-11-23 12:05:29,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13889#true} {13889#true} #87#return; {13889#true} is VALID [2018-11-23 12:05:29,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {13889#true} call #t~ret2 := main(); {13889#true} is VALID [2018-11-23 12:05:29,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {13889#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13891#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {13891#(= 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; {13892#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {13892#(<= 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; {13893#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {13893#(<= 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; {13894#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {13894#(<= 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; {13895#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {13895#(<= 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; {13896#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {13896#(<= 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; {13897#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {13897#(<= 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; {13898#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {13898#(<= 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; {13899#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {13899#(<= 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; {13900#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:29,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {13900#(<= 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; {13901#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:29,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {13901#(<= 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; {13902#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:29,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {13902#(<= 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; {13903#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:29,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {13903#(<= 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; {13904#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:29,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {13904#(<= 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; {13905#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:29,978 INFO L273 TraceCheckUtils]: 20: Hoare triple {13905#(<= 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; {13906#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:29,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {13906#(<= 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; {13907#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:29,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {13907#(<= 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; {13908#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:29,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {13908#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13909#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:29,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {13909#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13910#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:29,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {13910#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13911#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:29,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {13911#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13912#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:29,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {13912#(<= main_~i~0 21)} assume !(~i~0 < 100000); {13890#false} is VALID [2018-11-23 12:05:29,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {13890#false} ~i~0 := 0; {13890#false} is VALID [2018-11-23 12:05:29,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,985 INFO L273 TraceCheckUtils]: 33: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,985 INFO L273 TraceCheckUtils]: 34: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,985 INFO L273 TraceCheckUtils]: 36: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,986 INFO L273 TraceCheckUtils]: 38: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,986 INFO L273 TraceCheckUtils]: 40: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,986 INFO L273 TraceCheckUtils]: 41: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,986 INFO L273 TraceCheckUtils]: 42: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,987 INFO L273 TraceCheckUtils]: 44: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,987 INFO L273 TraceCheckUtils]: 45: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,987 INFO L273 TraceCheckUtils]: 46: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,987 INFO L273 TraceCheckUtils]: 47: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,987 INFO L273 TraceCheckUtils]: 48: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,988 INFO L273 TraceCheckUtils]: 49: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,988 INFO L273 TraceCheckUtils]: 50: Hoare triple {13890#false} assume !(~i~0 < 100000); {13890#false} is VALID [2018-11-23 12:05:29,988 INFO L273 TraceCheckUtils]: 51: Hoare triple {13890#false} ~i~0 := 0; {13890#false} is VALID [2018-11-23 12:05:29,988 INFO L273 TraceCheckUtils]: 52: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,988 INFO L273 TraceCheckUtils]: 53: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,988 INFO L273 TraceCheckUtils]: 54: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,989 INFO L273 TraceCheckUtils]: 55: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,989 INFO L273 TraceCheckUtils]: 56: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,989 INFO L273 TraceCheckUtils]: 57: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,989 INFO L273 TraceCheckUtils]: 58: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,989 INFO L273 TraceCheckUtils]: 59: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,989 INFO L273 TraceCheckUtils]: 60: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,989 INFO L273 TraceCheckUtils]: 61: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,989 INFO L273 TraceCheckUtils]: 62: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,990 INFO L273 TraceCheckUtils]: 63: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,990 INFO L273 TraceCheckUtils]: 64: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,990 INFO L273 TraceCheckUtils]: 65: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,990 INFO L273 TraceCheckUtils]: 66: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,990 INFO L273 TraceCheckUtils]: 67: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,990 INFO L273 TraceCheckUtils]: 68: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,990 INFO L273 TraceCheckUtils]: 69: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,990 INFO L273 TraceCheckUtils]: 70: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,990 INFO L273 TraceCheckUtils]: 71: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,991 INFO L273 TraceCheckUtils]: 72: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,991 INFO L273 TraceCheckUtils]: 73: Hoare triple {13890#false} assume !(~i~0 < 100000); {13890#false} is VALID [2018-11-23 12:05:29,991 INFO L273 TraceCheckUtils]: 74: Hoare triple {13890#false} ~i~0 := 0; {13890#false} is VALID [2018-11-23 12:05:29,991 INFO L273 TraceCheckUtils]: 75: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,991 INFO L273 TraceCheckUtils]: 76: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,991 INFO L273 TraceCheckUtils]: 77: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,991 INFO L273 TraceCheckUtils]: 78: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,991 INFO L273 TraceCheckUtils]: 79: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,992 INFO L273 TraceCheckUtils]: 80: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,992 INFO L273 TraceCheckUtils]: 81: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,992 INFO L273 TraceCheckUtils]: 82: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,992 INFO L273 TraceCheckUtils]: 83: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,992 INFO L273 TraceCheckUtils]: 84: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,992 INFO L273 TraceCheckUtils]: 85: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,992 INFO L273 TraceCheckUtils]: 86: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,992 INFO L273 TraceCheckUtils]: 87: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,992 INFO L273 TraceCheckUtils]: 88: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,993 INFO L273 TraceCheckUtils]: 89: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,993 INFO L273 TraceCheckUtils]: 90: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,993 INFO L273 TraceCheckUtils]: 91: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,993 INFO L273 TraceCheckUtils]: 92: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,993 INFO L273 TraceCheckUtils]: 93: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,993 INFO L273 TraceCheckUtils]: 94: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,993 INFO L273 TraceCheckUtils]: 95: Hoare triple {13890#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13890#false} is VALID [2018-11-23 12:05:29,993 INFO L273 TraceCheckUtils]: 96: Hoare triple {13890#false} assume !(~i~0 < 100000); {13890#false} is VALID [2018-11-23 12:05:29,993 INFO L273 TraceCheckUtils]: 97: Hoare triple {13890#false} havoc ~x~0;~x~0 := 0; {13890#false} is VALID [2018-11-23 12:05:29,994 INFO L273 TraceCheckUtils]: 98: Hoare triple {13890#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13890#false} is VALID [2018-11-23 12:05:29,994 INFO L256 TraceCheckUtils]: 99: Hoare triple {13890#false} call __VERIFIER_assert((if 45 == #t~mem1 then 1 else 0)); {13890#false} is VALID [2018-11-23 12:05:29,994 INFO L273 TraceCheckUtils]: 100: Hoare triple {13890#false} ~cond := #in~cond; {13890#false} is VALID [2018-11-23 12:05:29,994 INFO L273 TraceCheckUtils]: 101: Hoare triple {13890#false} assume 0 == ~cond; {13890#false} is VALID [2018-11-23 12:05:29,994 INFO L273 TraceCheckUtils]: 102: Hoare triple {13890#false} assume !false; {13890#false} is VALID [2018-11-23 12:05:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-23 12:05:29,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:29,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:30,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2