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_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:54:48,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:54:48,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:54:48,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:54:48,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:54:48,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:54:48,394 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:54:48,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:54:48,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:54:48,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:54:48,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:54:48,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:54:48,409 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:54:48,414 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:54:48,417 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:54:48,418 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:54:48,419 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:54:48,421 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:54:48,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:54:48,433 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:54:48,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:54:48,439 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:54:48,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:54:48,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:54:48,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:54:48,448 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:54:48,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:54:48,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:54:48,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:54:48,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:54:48,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:54:48,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:54:48,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:54:48,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:54:48,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:54:48,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:54:48,464 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:54:48,490 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:54:48,490 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:54:48,491 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:54:48,491 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:54:48,492 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:54:48,492 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:54:48,492 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:54:48,492 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:54:48,492 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:54:48,493 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:54:48,493 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:54:48,493 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:54:48,493 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:54:48,493 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:54:48,494 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:54:48,494 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:54:48,494 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:54:48,494 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:54:48,494 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:54:48,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:54:48,495 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:54:48,495 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:54:48,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:54:48,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:48,496 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:54:48,496 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:54:48,496 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:54:48,496 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:54:48,496 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:54:48,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:54:48,497 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:54:48,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:54:48,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:54:48,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:54:48,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:54:48,560 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:54:48,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init4_false-unreach-call_ground.i [2018-11-23 11:54:48,622 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311e26497/85d8775b6b574f57996ec68ca96839a7/FLAGeb14bd42c [2018-11-23 11:54:49,110 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:54:49,110 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init4_false-unreach-call_ground.i [2018-11-23 11:54:49,117 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311e26497/85d8775b6b574f57996ec68ca96839a7/FLAGeb14bd42c [2018-11-23 11:54:49,442 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311e26497/85d8775b6b574f57996ec68ca96839a7 [2018-11-23 11:54:49,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:54:49,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:54:49,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:49,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:54:49,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:54:49,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6e76f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49, skipping insertion in model container [2018-11-23 11:54:49,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:54:49,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:54:49,730 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:49,736 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:54:49,772 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:54:49,801 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:54:49,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49 WrapperNode [2018-11-23 11:54:49,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:54:49,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:49,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:54:49,804 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:54:49,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:54:49,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:54:49,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:54:49,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:54:49,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... [2018-11-23 11:54:49,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:54:49,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:54:49,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:54:49,890 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:54:49,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:54:50,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:54:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:54:50,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:54:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:54:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:54:50,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:54:50,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:54:50,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:54:50,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:54:50,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:54:50,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:54:50,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:54:50,675 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:54:50,676 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 11:54:50,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:50 BoogieIcfgContainer [2018-11-23 11:54:50,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:54:50,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:54:50,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:54:50,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:54:50,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:54:49" (1/3) ... [2018-11-23 11:54:50,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a009d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:50, skipping insertion in model container [2018-11-23 11:54:50,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:54:49" (2/3) ... [2018-11-23 11:54:50,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a009d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:54:50, skipping insertion in model container [2018-11-23 11:54:50,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:54:50" (3/3) ... [2018-11-23 11:54:50,686 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init4_false-unreach-call_ground.i [2018-11-23 11:54:50,695 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:54:50,703 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:54:50,719 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:54:50,751 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:54:50,751 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:54:50,751 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:54:50,752 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:54:50,752 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:54:50,752 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:54:50,752 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:54:50,752 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:54:50,752 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:54:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 11:54:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:54:50,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:50,779 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 11:54:50,781 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:50,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1568614638, now seen corresponding path program 1 times [2018-11-23 11:54:50,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:50,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:50,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 11:54:50,946 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 11:54:50,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 11:54:50,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #87#return; {32#true} is VALID [2018-11-23 11:54:50,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2018-11-23 11:54:50,948 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 11:54:50,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 11:54:50,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 11:54:50,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 11:54:50,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 11:54:50,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 11:54:50,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 11:54:50,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !(~i~0 < 100000); {33#false} is VALID [2018-11-23 11:54:50,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} havoc ~x~0;~x~0 := 0; {33#false} is VALID [2018-11-23 11:54:50,953 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 11:54:50,953 INFO L256 TraceCheckUtils]: 15: Hoare triple {33#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {33#false} is VALID [2018-11-23 11:54:50,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 11:54:50,954 INFO L273 TraceCheckUtils]: 17: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 11:54:50,954 INFO L273 TraceCheckUtils]: 18: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 11:54:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:50,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:50,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:54:50,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 11:54:50,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:50,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:54:51,128 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 11:54:51,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:54:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:54:51,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:54:51,141 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 11:54:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,512 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2018-11-23 11:54:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:54:51,513 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 11:54:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 11:54:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:54:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 11:54:51,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-23 11:54:51,742 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 11:54:51,754 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:54:51,755 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:54:51,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:54:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:54:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 11:54:51,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:51,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:51,816 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:51,816 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,820 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 11:54:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 11:54:51,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:51,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:51,822 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:51,822 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:54:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:51,826 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 11:54:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 11:54:51,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:51,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:51,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:51,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:54:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 11:54:51,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2018-11-23 11:54:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:51,833 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 11:54:51,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:54:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 11:54:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:54:51,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:51,834 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 11:54:51,835 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:51,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash -395002610, now seen corresponding path program 1 times [2018-11-23 11:54:51,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:51,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:51,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:51,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:51,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:51,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {187#true} call ULTIMATE.init(); {187#true} is VALID [2018-11-23 11:54:51,927 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 11:54:51,928 INFO L273 TraceCheckUtils]: 2: Hoare triple {187#true} assume true; {187#true} is VALID [2018-11-23 11:54:51,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {187#true} {187#true} #87#return; {187#true} is VALID [2018-11-23 11:54:51,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {187#true} call #t~ret2 := main(); {187#true} is VALID [2018-11-23 11:54:51,930 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 11:54:51,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {189#(= main_~i~0 0)} assume !(~i~0 < 100000); {188#false} is VALID [2018-11-23 11:54:51,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {188#false} ~i~0 := 0; {188#false} is VALID [2018-11-23 11:54:51,933 INFO L273 TraceCheckUtils]: 8: Hoare triple {188#false} assume !(~i~0 < 100000); {188#false} is VALID [2018-11-23 11:54:51,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {188#false} ~i~0 := 0; {188#false} is VALID [2018-11-23 11:54:51,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {188#false} assume !(~i~0 < 100000); {188#false} is VALID [2018-11-23 11:54:51,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {188#false} ~i~0 := 0; {188#false} is VALID [2018-11-23 11:54:51,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {188#false} assume !(~i~0 < 100000); {188#false} is VALID [2018-11-23 11:54:51,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {188#false} havoc ~x~0;~x~0 := 0; {188#false} is VALID [2018-11-23 11:54:51,936 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 11:54:51,936 INFO L256 TraceCheckUtils]: 15: Hoare triple {188#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {188#false} is VALID [2018-11-23 11:54:51,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {188#false} ~cond := #in~cond; {188#false} is VALID [2018-11-23 11:54:51,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {188#false} assume 0 == ~cond; {188#false} is VALID [2018-11-23 11:54:51,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {188#false} assume !false; {188#false} is VALID [2018-11-23 11:54:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:54:51,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:54:51,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:54:51,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:54:51,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:51,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:54:51,980 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 11:54:51,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:54:51,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:54:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:54:51,981 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-23 11:54:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,344 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 11:54:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:54:52,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:54:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 11:54:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:54:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 11:54:52,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-23 11:54:52,664 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 11:54:52,667 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:54:52,668 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:54:52,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:54:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:54:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:54:52,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:52,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:52,692 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:52,692 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,695 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 11:54:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:54:52,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,696 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:52,697 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:54:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:52,699 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 11:54:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:54:52,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:52,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:52,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:52,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:54:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 11:54:52,704 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2018-11-23 11:54:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:52,704 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 11:54:52,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:54:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:54:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:54:52,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:52,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:52,706 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:52,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash 47445068, now seen corresponding path program 1 times [2018-11-23 11:54:52,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:52,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:52,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:52,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 11:54:52,863 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 11:54:52,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 11:54:52,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #87#return; {357#true} is VALID [2018-11-23 11:54:52,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret2 := main(); {357#true} is VALID [2018-11-23 11:54:52,866 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 11:54:52,872 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 11:54:52,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {360#(<= main_~i~0 1)} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 11:54:52,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 11:54:52,873 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 11:54:52,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 11:54:52,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 11:54:52,874 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 11:54:52,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 11:54:52,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 11:54:52,875 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 11:54:52,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 11:54:52,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {358#false} havoc ~x~0;~x~0 := 0; {358#false} is VALID [2018-11-23 11:54:52,876 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 11:54:52,876 INFO L256 TraceCheckUtils]: 19: Hoare triple {358#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {358#false} is VALID [2018-11-23 11:54:52,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2018-11-23 11:54:52,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2018-11-23 11:54:52,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 11:54:52,879 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 11:54:52,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:52,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:52,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:52,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:53,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 11:54:53,205 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 11:54:53,205 INFO L273 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 11:54:53,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #87#return; {357#true} is VALID [2018-11-23 11:54:53,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret2 := main(); {357#true} is VALID [2018-11-23 11:54:53,208 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 11:54:53,209 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 11:54:53,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {360#(<= main_~i~0 1)} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 11:54:53,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 11:54:53,210 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 11:54:53,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 11:54:53,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 11:54:53,211 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 11:54:53,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 11:54:53,211 INFO L273 TraceCheckUtils]: 14: Hoare triple {358#false} ~i~0 := 0; {358#false} is VALID [2018-11-23 11:54:53,212 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 11:54:53,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {358#false} assume !(~i~0 < 100000); {358#false} is VALID [2018-11-23 11:54:53,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {358#false} havoc ~x~0;~x~0 := 0; {358#false} is VALID [2018-11-23 11:54:53,213 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 11:54:53,213 INFO L256 TraceCheckUtils]: 19: Hoare triple {358#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {358#false} is VALID [2018-11-23 11:54:53,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2018-11-23 11:54:53,213 INFO L273 TraceCheckUtils]: 21: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2018-11-23 11:54:53,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 11:54:53,215 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 11:54:53,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:53,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:54:53,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:54:53,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:53,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:54:53,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:53,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:54:53,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:54:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:54:53,303 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-23 11:54:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,676 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 11:54:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:54:53,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:54:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 11:54:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:54:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 11:54:53,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 11:54:53,882 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 11:54:53,884 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:54:53,884 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:54:53,885 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 11:54:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:54:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 11:54:53,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:53,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:53,908 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:53,908 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,912 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 11:54:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 11:54:53,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,913 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:53,913 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 11:54:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:53,916 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 11:54:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 11:54:53,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:53,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:53,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:53,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:54:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 11:54:53,919 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2018-11-23 11:54:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:53,920 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 11:54:53,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:54:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 11:54:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:54:53,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:53,921 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 11:54:53,922 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:53,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1810840398, now seen corresponding path program 2 times [2018-11-23 11:54:53,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:53,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:53,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2018-11-23 11:54:54,040 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 11:54:54,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2018-11-23 11:54:54,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #87#return; {625#true} is VALID [2018-11-23 11:54:54,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret2 := main(); {625#true} is VALID [2018-11-23 11:54:54,043 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 11:54:54,043 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 11:54:54,045 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 11:54:54,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 11:54:54,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {626#false} ~i~0 := 0; {626#false} is VALID [2018-11-23 11:54:54,046 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 11:54:54,046 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 11:54:54,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {626#false} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 11:54:54,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {626#false} ~i~0 := 0; {626#false} is VALID [2018-11-23 11:54:54,047 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 11:54:54,048 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 11:54:54,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {626#false} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 11:54:54,049 INFO L273 TraceCheckUtils]: 17: Hoare triple {626#false} ~i~0 := 0; {626#false} is VALID [2018-11-23 11:54:54,049 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 11:54:54,050 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 11:54:54,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {626#false} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 11:54:54,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {626#false} havoc ~x~0;~x~0 := 0; {626#false} is VALID [2018-11-23 11:54:54,050 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 11:54:54,051 INFO L256 TraceCheckUtils]: 23: Hoare triple {626#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {626#false} is VALID [2018-11-23 11:54:54,051 INFO L273 TraceCheckUtils]: 24: Hoare triple {626#false} ~cond := #in~cond; {626#false} is VALID [2018-11-23 11:54:54,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {626#false} assume 0 == ~cond; {626#false} is VALID [2018-11-23 11:54:54,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {626#false} assume !false; {626#false} is VALID [2018-11-23 11:54:54,053 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 11:54:54,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:54,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:54,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:54,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:54,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:54,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:54,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2018-11-23 11:54:54,394 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 11:54:54,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2018-11-23 11:54:54,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #87#return; {625#true} is VALID [2018-11-23 11:54:54,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret2 := main(); {625#true} is VALID [2018-11-23 11:54:54,395 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 11:54:54,395 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 11:54:54,395 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 11:54:54,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {625#true} assume !(~i~0 < 100000); {625#true} is VALID [2018-11-23 11:54:54,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {625#true} ~i~0 := 0; {625#true} is VALID [2018-11-23 11:54:54,396 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 11:54:54,396 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 11:54:54,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#true} assume !(~i~0 < 100000); {625#true} is VALID [2018-11-23 11:54:54,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#true} ~i~0 := 0; {625#true} is VALID [2018-11-23 11:54:54,397 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 11:54:54,398 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 11:54:54,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {625#true} assume !(~i~0 < 100000); {625#true} is VALID [2018-11-23 11:54:54,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {625#true} ~i~0 := 0; {684#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:54,412 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 11:54:54,415 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 11:54:54,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 100000); {626#false} is VALID [2018-11-23 11:54:54,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {626#false} havoc ~x~0;~x~0 := 0; {626#false} is VALID [2018-11-23 11:54:54,417 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 11:54:54,417 INFO L256 TraceCheckUtils]: 23: Hoare triple {626#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {626#false} is VALID [2018-11-23 11:54:54,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {626#false} ~cond := #in~cond; {626#false} is VALID [2018-11-23 11:54:54,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {626#false} assume 0 == ~cond; {626#false} is VALID [2018-11-23 11:54:54,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {626#false} assume !false; {626#false} is VALID [2018-11-23 11:54:54,419 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 11:54:54,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:54,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:54:54,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 11:54:54,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:54,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:54:54,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:54,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:54:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:54:54,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:54:54,487 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-11-23 11:54:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,742 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 11:54:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:54:54,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 11:54:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 11:54:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:54:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 11:54:54,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 11:54:54,856 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 11:54:54,857 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:54:54,858 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:54:54,858 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 11:54:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:54:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 11:54:54,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:54,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:54,888 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:54,888 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,892 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 11:54:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 11:54:54,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,893 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:54,893 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:54:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:54,896 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 11:54:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 11:54:54,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:54,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:54,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:54,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:54:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 11:54:54,899 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 27 [2018-11-23 11:54:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:54,900 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 11:54:54,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:54:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 11:54:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:54:54,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:54,901 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 11:54:54,901 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:54,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1527698548, now seen corresponding path program 3 times [2018-11-23 11:54:54,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:54,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:54,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:54,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {936#true} call ULTIMATE.init(); {936#true} is VALID [2018-11-23 11:54:55,072 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 11:54:55,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {936#true} assume true; {936#true} is VALID [2018-11-23 11:54:55,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {936#true} {936#true} #87#return; {936#true} is VALID [2018-11-23 11:54:55,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {936#true} call #t~ret2 := main(); {936#true} is VALID [2018-11-23 11:54:55,075 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 11:54:55,076 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 11:54:55,077 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 11:54:55,078 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 11:54:55,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {941#(<= main_~i~0 3)} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 11:54:55,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2018-11-23 11:54:55,080 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 11:54:55,080 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 11:54:55,080 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 11:54:55,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {937#false} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 11:54:55,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2018-11-23 11:54:55,081 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 11:54:55,082 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 11:54:55,082 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 11:54:55,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {937#false} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 11:54:55,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2018-11-23 11:54:55,083 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 11:54:55,083 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 11:54:55,083 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 11:54:55,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {937#false} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 11:54:55,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {937#false} havoc ~x~0;~x~0 := 0; {937#false} is VALID [2018-11-23 11:54:55,084 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 11:54:55,084 INFO L256 TraceCheckUtils]: 27: Hoare triple {937#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {937#false} is VALID [2018-11-23 11:54:55,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {937#false} ~cond := #in~cond; {937#false} is VALID [2018-11-23 11:54:55,085 INFO L273 TraceCheckUtils]: 29: Hoare triple {937#false} assume 0 == ~cond; {937#false} is VALID [2018-11-23 11:54:55,085 INFO L273 TraceCheckUtils]: 30: Hoare triple {937#false} assume !false; {937#false} is VALID [2018-11-23 11:54:55,087 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 11:54:55,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:55,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:55,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:55,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:54:55,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:55,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:55,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {936#true} call ULTIMATE.init(); {936#true} is VALID [2018-11-23 11:54:55,252 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 11:54:55,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {936#true} assume true; {936#true} is VALID [2018-11-23 11:54:55,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {936#true} {936#true} #87#return; {936#true} is VALID [2018-11-23 11:54:55,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {936#true} call #t~ret2 := main(); {936#true} is VALID [2018-11-23 11:54:55,254 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 11:54:55,254 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 11:54:55,254 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 11:54:55,255 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 11:54:55,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {936#true} assume !(~i~0 < 100000); {936#true} is VALID [2018-11-23 11:54:55,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {936#true} ~i~0 := 0; {936#true} is VALID [2018-11-23 11:54:55,255 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 11:54:55,256 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 11:54:55,256 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 11:54:55,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {936#true} assume !(~i~0 < 100000); {936#true} is VALID [2018-11-23 11:54:55,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {936#true} ~i~0 := 0; {990#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:55,286 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 11:54:55,296 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 11:54:55,297 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 11:54:55,299 INFO L273 TraceCheckUtils]: 19: Hoare triple {941#(<= main_~i~0 3)} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 11:54:55,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {937#false} ~i~0 := 0; {937#false} is VALID [2018-11-23 11:54:55,299 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 11:54:55,300 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 11:54:55,300 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 11:54:55,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {937#false} assume !(~i~0 < 100000); {937#false} is VALID [2018-11-23 11:54:55,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {937#false} havoc ~x~0;~x~0 := 0; {937#false} is VALID [2018-11-23 11:54:55,301 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 11:54:55,301 INFO L256 TraceCheckUtils]: 27: Hoare triple {937#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {937#false} is VALID [2018-11-23 11:54:55,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {937#false} ~cond := #in~cond; {937#false} is VALID [2018-11-23 11:54:55,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {937#false} assume 0 == ~cond; {937#false} is VALID [2018-11-23 11:54:55,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {937#false} assume !false; {937#false} is VALID [2018-11-23 11:54:55,304 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 11:54:55,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:55,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:54:55,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 11:54:55,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:55,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:54:55,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:55,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:54:55,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:54:55,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:54:55,376 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 7 states. [2018-11-23 11:54:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,613 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-23 11:54:55,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:54:55,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 11:54:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 11:54:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:54:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-23 11:54:55,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2018-11-23 11:54:55,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:55,737 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:54:55,737 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:54:55,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:54:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:54:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:54:55,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:55,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:55,787 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:55,788 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,790 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 11:54:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 11:54:55,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,791 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:55,791 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:54:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:55,793 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 11:54:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 11:54:55,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:55,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:55,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:55,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:54:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 11:54:55,797 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2018-11-23 11:54:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:55,797 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 11:54:55,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:54:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 11:54:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:54:55,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:55,799 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 11:54:55,799 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:55,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1451349618, now seen corresponding path program 4 times [2018-11-23 11:54:55,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:55,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {1290#true} call ULTIMATE.init(); {1290#true} is VALID [2018-11-23 11:54:56,117 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 11:54:56,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {1290#true} assume true; {1290#true} is VALID [2018-11-23 11:54:56,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1290#true} {1290#true} #87#return; {1290#true} is VALID [2018-11-23 11:54:56,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {1290#true} call #t~ret2 := main(); {1290#true} is VALID [2018-11-23 11:54:56,135 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 11:54:56,149 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 11:54:56,158 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 11:54:56,159 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 11:54:56,159 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 11:54:56,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {1296#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 11:54:56,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 11:54:56,161 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 11:54:56,161 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 11:54:56,162 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 11:54:56,162 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 11:54:56,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 11:54:56,163 INFO L273 TraceCheckUtils]: 17: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 11:54:56,163 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 11:54:56,163 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 11:54:56,163 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 11:54:56,164 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 11:54:56,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 11:54:56,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 11:54:56,164 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 11:54:56,165 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 11:54:56,165 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 11:54:56,165 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 11:54:56,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 11:54:56,166 INFO L273 TraceCheckUtils]: 29: Hoare triple {1291#false} havoc ~x~0;~x~0 := 0; {1291#false} is VALID [2018-11-23 11:54:56,166 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 11:54:56,166 INFO L256 TraceCheckUtils]: 31: Hoare triple {1291#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1291#false} is VALID [2018-11-23 11:54:56,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {1291#false} ~cond := #in~cond; {1291#false} is VALID [2018-11-23 11:54:56,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {1291#false} assume 0 == ~cond; {1291#false} is VALID [2018-11-23 11:54:56,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {1291#false} assume !false; {1291#false} is VALID [2018-11-23 11:54:56,169 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 11:54:56,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:56,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:56,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:56,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:56,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:56,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:56,428 INFO L256 TraceCheckUtils]: 0: Hoare triple {1290#true} call ULTIMATE.init(); {1290#true} is VALID [2018-11-23 11:54:56,428 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 11:54:56,429 INFO L273 TraceCheckUtils]: 2: Hoare triple {1290#true} assume true; {1290#true} is VALID [2018-11-23 11:54:56,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1290#true} {1290#true} #87#return; {1290#true} is VALID [2018-11-23 11:54:56,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {1290#true} call #t~ret2 := main(); {1290#true} is VALID [2018-11-23 11:54:56,431 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 11:54:56,432 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 11:54:56,433 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 11:54:56,434 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 11:54:56,435 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 11:54:56,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {1296#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 11:54:56,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 11:54:56,436 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 11:54:56,437 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 11:54:56,437 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 11:54:56,437 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 11:54:56,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 11:54:56,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 11:54:56,438 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 11:54:56,439 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 11:54:56,439 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 11:54:56,440 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 11:54:56,440 INFO L273 TraceCheckUtils]: 22: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 11:54:56,441 INFO L273 TraceCheckUtils]: 23: Hoare triple {1291#false} ~i~0 := 0; {1291#false} is VALID [2018-11-23 11:54:56,441 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 11:54:56,441 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 11:54:56,441 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 11:54:56,442 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 11:54:56,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {1291#false} assume !(~i~0 < 100000); {1291#false} is VALID [2018-11-23 11:54:56,442 INFO L273 TraceCheckUtils]: 29: Hoare triple {1291#false} havoc ~x~0;~x~0 := 0; {1291#false} is VALID [2018-11-23 11:54:56,442 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 11:54:56,443 INFO L256 TraceCheckUtils]: 31: Hoare triple {1291#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1291#false} is VALID [2018-11-23 11:54:56,443 INFO L273 TraceCheckUtils]: 32: Hoare triple {1291#false} ~cond := #in~cond; {1291#false} is VALID [2018-11-23 11:54:56,443 INFO L273 TraceCheckUtils]: 33: Hoare triple {1291#false} assume 0 == ~cond; {1291#false} is VALID [2018-11-23 11:54:56,444 INFO L273 TraceCheckUtils]: 34: Hoare triple {1291#false} assume !false; {1291#false} is VALID [2018-11-23 11:54:56,445 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 11:54:56,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:56,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:54:56,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-23 11:54:56,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:56,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:54:56,511 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 11:54:56,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:54:56,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:54:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:54:56,513 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 8 states. [2018-11-23 11:54:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,741 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-23 11:54:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:54:56,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-23 11:54:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 11:54:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:54:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-23 11:54:56,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-23 11:54:56,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:56,847 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:54:56,848 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:54:56,849 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 11:54:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:54:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 11:54:56,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:56,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 11:54:56,919 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 11:54:56,919 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 11:54:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,922 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 11:54:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 11:54:56,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,923 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 11:54:56,923 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 11:54:56,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:56,926 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 11:54:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 11:54:56,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:56,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:56,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:56,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:54:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 11:54:56,931 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 35 [2018-11-23 11:54:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:56,931 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 11:54:56,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:54:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 11:54:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:54:56,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:56,935 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 11:54:56,936 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:56,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:56,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2058629836, now seen corresponding path program 5 times [2018-11-23 11:54:56,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:56,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:56,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:56,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:57,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 11:54:57,170 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 11:54:57,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 11:54:57,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #87#return; {1687#true} is VALID [2018-11-23 11:54:57,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret2 := main(); {1687#true} is VALID [2018-11-23 11:54:57,171 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 11:54:57,185 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 11:54:57,198 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 11:54:57,211 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 11:54:57,223 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 11:54:57,236 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 11:54:57,249 INFO L273 TraceCheckUtils]: 11: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:57,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 11:54:57,250 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 11:54:57,250 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 11:54:57,250 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 11:54:57,250 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 11:54:57,251 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 11:54:57,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:57,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 11:54:57,251 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 11:54:57,252 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 11:54:57,252 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 11:54:57,252 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 11:54:57,252 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 11:54:57,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:57,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 11:54:57,253 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 11:54:57,253 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 11:54:57,253 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 11:54:57,254 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 11:54:57,254 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 11:54:57,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:57,254 INFO L273 TraceCheckUtils]: 33: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 11:54:57,254 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 11:54:57,255 INFO L256 TraceCheckUtils]: 35: Hoare triple {1688#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1688#false} is VALID [2018-11-23 11:54:57,255 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 11:54:57,255 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 11:54:57,255 INFO L273 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 11:54:57,257 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 11:54:57,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:57,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:57,270 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:57,635 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 11:54:57,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:57,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:57,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 11:54:57,764 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 11:54:57,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 11:54:57,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1687#true} {1687#true} #87#return; {1687#true} is VALID [2018-11-23 11:54:57,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {1687#true} call #t~ret2 := main(); {1687#true} is VALID [2018-11-23 11:54:57,766 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 11:54:57,766 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 11:54:57,767 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 11:54:57,767 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 11:54:57,767 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 11:54:57,768 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 11:54:57,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 11:54:57,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {1687#true} ~i~0 := 0; {1687#true} is VALID [2018-11-23 11:54:57,768 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 11:54:57,769 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 11:54:57,769 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 11:54:57,769 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 11:54:57,769 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 11:54:57,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#true} assume !(~i~0 < 100000); {1687#true} is VALID [2018-11-23 11:54:57,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {1687#true} ~i~0 := 0; {1755#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:57,775 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 11:54:57,776 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 11:54:57,777 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 11:54:57,777 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 11:54:57,779 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 11:54:57,780 INFO L273 TraceCheckUtils]: 25: Hoare triple {1694#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:57,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {1688#false} ~i~0 := 0; {1688#false} is VALID [2018-11-23 11:54:57,780 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 11:54:57,781 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 11:54:57,781 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 11:54:57,781 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 11:54:57,782 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 11:54:57,782 INFO L273 TraceCheckUtils]: 32: Hoare triple {1688#false} assume !(~i~0 < 100000); {1688#false} is VALID [2018-11-23 11:54:57,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {1688#false} havoc ~x~0;~x~0 := 0; {1688#false} is VALID [2018-11-23 11:54:57,783 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 11:54:57,783 INFO L256 TraceCheckUtils]: 35: Hoare triple {1688#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {1688#false} is VALID [2018-11-23 11:54:57,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 11:54:57,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 11:54:57,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 11:54:57,785 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 11:54:57,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:57,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:54:57,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 11:54:57,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:57,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:54:57,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:57,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:54:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:54:57,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:54:57,853 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 9 states. [2018-11-23 11:54:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,223 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-11-23 11:54:58,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:54:58,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 11:54:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 11:54:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:54:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 11:54:58,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2018-11-23 11:54:58,373 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 11:54:58,374 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:54:58,374 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:54:58,375 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 11:54:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:54:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 11:54:58,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:58,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 11:54:58,414 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:54:58,414 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:54:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,417 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 11:54:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 11:54:58,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,418 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:54:58,418 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:54:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:58,420 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 11:54:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 11:54:58,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:58,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:58,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:58,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:54:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-23 11:54:58,423 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 39 [2018-11-23 11:54:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:58,424 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-23 11:54:58,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:54:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 11:54:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:54:58,425 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:58,425 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 11:54:58,425 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:58,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:58,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1129940942, now seen corresponding path program 6 times [2018-11-23 11:54:58,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:58,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:58,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {2127#true} call ULTIMATE.init(); {2127#true} is VALID [2018-11-23 11:54:58,771 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 11:54:58,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {2127#true} assume true; {2127#true} is VALID [2018-11-23 11:54:58,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2127#true} {2127#true} #87#return; {2127#true} is VALID [2018-11-23 11:54:58,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {2127#true} call #t~ret2 := main(); {2127#true} is VALID [2018-11-23 11:54:58,779 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 11:54:58,779 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 11:54:58,780 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 11:54:58,781 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 11:54:58,784 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 11:54:58,785 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 11:54:58,785 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 11:54:58,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {2135#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 11:54:58,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 11:54:58,787 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 11:54:58,787 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 11:54:58,787 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 11:54:58,787 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 11:54:58,788 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 11:54:58,788 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 11:54:58,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 11:54:58,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 11:54:58,788 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 11:54:58,788 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 11:54:58,788 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 11:54:58,789 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 11:54:58,789 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 11:54:58,789 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 11:54:58,789 INFO L273 TraceCheckUtils]: 28: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 11:54:58,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 11:54:58,789 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 11:54:58,789 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 11:54:58,790 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 11:54:58,790 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 11:54:58,790 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 11:54:58,790 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 11:54:58,791 INFO L273 TraceCheckUtils]: 36: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 11:54:58,791 INFO L273 TraceCheckUtils]: 37: Hoare triple {2128#false} havoc ~x~0;~x~0 := 0; {2128#false} is VALID [2018-11-23 11:54:58,791 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 11:54:58,791 INFO L256 TraceCheckUtils]: 39: Hoare triple {2128#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2128#false} is VALID [2018-11-23 11:54:58,791 INFO L273 TraceCheckUtils]: 40: Hoare triple {2128#false} ~cond := #in~cond; {2128#false} is VALID [2018-11-23 11:54:58,792 INFO L273 TraceCheckUtils]: 41: Hoare triple {2128#false} assume 0 == ~cond; {2128#false} is VALID [2018-11-23 11:54:58,792 INFO L273 TraceCheckUtils]: 42: Hoare triple {2128#false} assume !false; {2128#false} is VALID [2018-11-23 11:54:58,793 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 11:54:58,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:58,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:54:58,802 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:59,072 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 11:54:59,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:59,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:59,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {2127#true} call ULTIMATE.init(); {2127#true} is VALID [2018-11-23 11:54:59,666 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 11:54:59,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {2127#true} assume true; {2127#true} is VALID [2018-11-23 11:54:59,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2127#true} {2127#true} #87#return; {2127#true} is VALID [2018-11-23 11:54:59,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {2127#true} call #t~ret2 := main(); {2127#true} is VALID [2018-11-23 11:54:59,679 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 11:54:59,696 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 11:54:59,705 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 11:54:59,718 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 11:54:59,725 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 11:54:59,726 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 11:54:59,727 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 11:54:59,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {2135#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 11:54:59,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 11:54:59,728 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 11:54:59,728 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 11:54:59,728 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 11:54:59,728 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 11:54:59,728 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 11:54:59,728 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 11:54:59,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 11:54:59,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 11:54:59,729 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 11:54:59,729 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 11:54:59,729 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 11:54:59,729 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 11:54:59,730 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 11:54:59,730 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 11:54:59,730 INFO L273 TraceCheckUtils]: 28: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 11:54:59,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {2128#false} ~i~0 := 0; {2128#false} is VALID [2018-11-23 11:54:59,730 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 11:54:59,731 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 11:54:59,731 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 11:54:59,731 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 11:54:59,731 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 11:54:59,731 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 11:54:59,732 INFO L273 TraceCheckUtils]: 36: Hoare triple {2128#false} assume !(~i~0 < 100000); {2128#false} is VALID [2018-11-23 11:54:59,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {2128#false} havoc ~x~0;~x~0 := 0; {2128#false} is VALID [2018-11-23 11:54:59,732 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 11:54:59,733 INFO L256 TraceCheckUtils]: 39: Hoare triple {2128#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2128#false} is VALID [2018-11-23 11:54:59,733 INFO L273 TraceCheckUtils]: 40: Hoare triple {2128#false} ~cond := #in~cond; {2128#false} is VALID [2018-11-23 11:54:59,733 INFO L273 TraceCheckUtils]: 41: Hoare triple {2128#false} assume 0 == ~cond; {2128#false} is VALID [2018-11-23 11:54:59,733 INFO L273 TraceCheckUtils]: 42: Hoare triple {2128#false} assume !false; {2128#false} is VALID [2018-11-23 11:54:59,735 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 11:54:59,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:59,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:54:59,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-23 11:54:59,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:59,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:54:59,843 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 11:54:59,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:54:59,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:54:59,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:54:59,845 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2018-11-23 11:55:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,306 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-23 11:55:00,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:55:00,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-23 11:55:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 11:55:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:55:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2018-11-23 11:55:00,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 80 transitions. [2018-11-23 11:55:00,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:00,417 INFO L225 Difference]: With dead ends: 87 [2018-11-23 11:55:00,418 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:55:00,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:55:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:55:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 11:55:00,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:00,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:00,477 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:00,477 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,479 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 11:55:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 11:55:00,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,480 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:00,480 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 11:55:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:00,482 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 11:55:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 11:55:00,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:00,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:00,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:00,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:55:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-23 11:55:00,485 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 43 [2018-11-23 11:55:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:00,485 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 11:55:00,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:55:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 11:55:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:55:00,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:00,486 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 11:55:00,486 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:00,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2092627444, now seen corresponding path program 7 times [2018-11-23 11:55:00,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:00,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:00,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:00,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:00,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {2610#true} call ULTIMATE.init(); {2610#true} is VALID [2018-11-23 11:55:00,673 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 11:55:00,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {2610#true} assume true; {2610#true} is VALID [2018-11-23 11:55:00,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2610#true} {2610#true} #87#return; {2610#true} is VALID [2018-11-23 11:55:00,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {2610#true} call #t~ret2 := main(); {2610#true} is VALID [2018-11-23 11:55:00,675 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 11:55:00,676 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 11:55:00,679 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 11:55:00,680 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 11:55:00,681 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 11:55:00,693 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 11:55:00,694 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 11:55:00,695 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 11:55:00,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {2619#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 11:55:00,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 11:55:00,699 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 11:55:00,699 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 11:55:00,699 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 11:55:00,700 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 11:55:00,700 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 11:55:00,700 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 11:55:00,700 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 11:55:00,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 11:55:00,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 11:55:00,701 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 11:55:00,701 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 11:55:00,701 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 11:55:00,702 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 11:55:00,702 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 11:55:00,702 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 11:55:00,702 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 11:55:00,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 11:55:00,702 INFO L273 TraceCheckUtils]: 32: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 11:55:00,703 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 11:55:00,703 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 11:55:00,703 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 11:55:00,703 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 11:55:00,703 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 11:55:00,703 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 11:55:00,704 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 11:55:00,704 INFO L273 TraceCheckUtils]: 40: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 11:55:00,704 INFO L273 TraceCheckUtils]: 41: Hoare triple {2611#false} havoc ~x~0;~x~0 := 0; {2611#false} is VALID [2018-11-23 11:55:00,704 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 11:55:00,704 INFO L256 TraceCheckUtils]: 43: Hoare triple {2611#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2611#false} is VALID [2018-11-23 11:55:00,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {2611#false} ~cond := #in~cond; {2611#false} is VALID [2018-11-23 11:55:00,705 INFO L273 TraceCheckUtils]: 45: Hoare triple {2611#false} assume 0 == ~cond; {2611#false} is VALID [2018-11-23 11:55:00,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {2611#false} assume !false; {2611#false} is VALID [2018-11-23 11:55:00,707 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 11:55:00,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:00,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:00,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:00,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:00,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {2610#true} call ULTIMATE.init(); {2610#true} is VALID [2018-11-23 11:55:00,895 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 11:55:00,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {2610#true} assume true; {2610#true} is VALID [2018-11-23 11:55:00,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2610#true} {2610#true} #87#return; {2610#true} is VALID [2018-11-23 11:55:00,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {2610#true} call #t~ret2 := main(); {2610#true} is VALID [2018-11-23 11:55:00,896 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 11:55:00,902 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 11:55:00,903 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 11:55:00,903 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 11:55:00,904 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 11:55:00,905 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 11:55:00,905 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 11:55:00,906 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 11:55:00,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {2619#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 11:55:00,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 11:55:00,907 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 11:55:00,907 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 11:55:00,908 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 11:55:00,908 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 11:55:00,908 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 11:55:00,908 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 11:55:00,909 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 11:55:00,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 11:55:00,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 11:55:00,909 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 11:55:00,909 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 11:55:00,910 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 11:55:00,910 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 11:55:00,910 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 11:55:00,910 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 11:55:00,910 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 11:55:00,911 INFO L273 TraceCheckUtils]: 31: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 11:55:00,911 INFO L273 TraceCheckUtils]: 32: Hoare triple {2611#false} ~i~0 := 0; {2611#false} is VALID [2018-11-23 11:55:00,911 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 11:55:00,911 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 11:55:00,911 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 11:55:00,912 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 11:55:00,912 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 11:55:00,912 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 11:55:00,912 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 11:55:00,912 INFO L273 TraceCheckUtils]: 40: Hoare triple {2611#false} assume !(~i~0 < 100000); {2611#false} is VALID [2018-11-23 11:55:00,912 INFO L273 TraceCheckUtils]: 41: Hoare triple {2611#false} havoc ~x~0;~x~0 := 0; {2611#false} is VALID [2018-11-23 11:55:00,913 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 11:55:00,913 INFO L256 TraceCheckUtils]: 43: Hoare triple {2611#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {2611#false} is VALID [2018-11-23 11:55:00,913 INFO L273 TraceCheckUtils]: 44: Hoare triple {2611#false} ~cond := #in~cond; {2611#false} is VALID [2018-11-23 11:55:00,913 INFO L273 TraceCheckUtils]: 45: Hoare triple {2611#false} assume 0 == ~cond; {2611#false} is VALID [2018-11-23 11:55:00,913 INFO L273 TraceCheckUtils]: 46: Hoare triple {2611#false} assume !false; {2611#false} is VALID [2018-11-23 11:55:00,915 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 11:55:00,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:00,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:55:00,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-23 11:55:00,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:00,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:55:00,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:00,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:55:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:55:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:00,960 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 11 states. [2018-11-23 11:55:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,568 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-11-23 11:55:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:55:01,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-23 11:55:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-23 11:55:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:55:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2018-11-23 11:55:01,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 84 transitions. [2018-11-23 11:55:01,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:01,658 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:55:01,658 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:55:01,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:55:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:55:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 11:55:01,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:01,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:01,698 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:01,698 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:01,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,701 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-23 11:55:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 11:55:01,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,702 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:01,702 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 11:55:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:01,703 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-23 11:55:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 11:55:01,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:01,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:01,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:01,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:55:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-23 11:55:01,705 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 47 [2018-11-23 11:55:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:01,706 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-23 11:55:01,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:55:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 11:55:01,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:55:01,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:01,707 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 11:55:01,707 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:01,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:01,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2092520974, now seen corresponding path program 8 times [2018-11-23 11:55:01,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:01,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {3136#true} call ULTIMATE.init(); {3136#true} is VALID [2018-11-23 11:55:01,890 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 11:55:01,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {3136#true} assume true; {3136#true} is VALID [2018-11-23 11:55:01,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3136#true} {3136#true} #87#return; {3136#true} is VALID [2018-11-23 11:55:01,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {3136#true} call #t~ret2 := main(); {3136#true} is VALID [2018-11-23 11:55:01,891 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 11:55:01,892 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 11:55:01,893 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 11:55:01,893 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 11:55:01,894 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 11:55:01,895 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 11:55:01,896 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 11:55:01,897 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 11:55:01,897 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 11:55:01,898 INFO L273 TraceCheckUtils]: 14: Hoare triple {3146#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 11:55:01,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 11:55:01,899 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 11:55:01,899 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 11:55:01,899 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 11:55:01,899 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 11:55:01,900 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 11:55:01,900 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 11:55:01,900 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 11:55:01,900 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 11:55:01,901 INFO L273 TraceCheckUtils]: 24: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 11:55:01,901 INFO L273 TraceCheckUtils]: 25: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 11:55:01,901 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 11:55:01,901 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 11:55:01,901 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 11:55:01,901 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 11:55:01,901 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 11:55:01,901 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 11:55:01,902 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 11:55:01,902 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 11:55:01,902 INFO L273 TraceCheckUtils]: 34: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 11:55:01,902 INFO L273 TraceCheckUtils]: 35: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 11:55:01,902 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 11:55:01,902 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 11:55:01,902 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 11:55:01,902 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 11:55:01,903 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 11:55:01,903 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 11:55:01,903 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 11:55:01,903 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 11:55:01,903 INFO L273 TraceCheckUtils]: 44: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 11:55:01,903 INFO L273 TraceCheckUtils]: 45: Hoare triple {3137#false} havoc ~x~0;~x~0 := 0; {3137#false} is VALID [2018-11-23 11:55:01,903 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 11:55:01,904 INFO L256 TraceCheckUtils]: 47: Hoare triple {3137#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3137#false} is VALID [2018-11-23 11:55:01,904 INFO L273 TraceCheckUtils]: 48: Hoare triple {3137#false} ~cond := #in~cond; {3137#false} is VALID [2018-11-23 11:55:01,904 INFO L273 TraceCheckUtils]: 49: Hoare triple {3137#false} assume 0 == ~cond; {3137#false} is VALID [2018-11-23 11:55:01,904 INFO L273 TraceCheckUtils]: 50: Hoare triple {3137#false} assume !false; {3137#false} is VALID [2018-11-23 11:55:01,905 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 11:55:01,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:01,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:01,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:01,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:01,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:01,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:02,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {3136#true} call ULTIMATE.init(); {3136#true} is VALID [2018-11-23 11:55:02,241 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 11:55:02,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {3136#true} assume true; {3136#true} is VALID [2018-11-23 11:55:02,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3136#true} {3136#true} #87#return; {3136#true} is VALID [2018-11-23 11:55:02,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {3136#true} call #t~ret2 := main(); {3136#true} is VALID [2018-11-23 11:55:02,242 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 11:55:02,244 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 11:55:02,244 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 11:55:02,246 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 11:55:02,247 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 11:55:02,248 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 11:55:02,249 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 11:55:02,250 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 11:55:02,251 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 11:55:02,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {3146#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 11:55:02,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 11:55:02,252 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 11:55:02,252 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 11:55:02,253 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 11:55:02,253 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 11:55:02,253 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 11:55:02,253 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 11:55:02,254 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 11:55:02,254 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 11:55:02,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 11:55:02,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 11:55:02,254 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 11:55:02,255 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 11:55:02,255 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 11:55:02,255 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 11:55:02,255 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 11:55:02,256 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 11:55:02,256 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 11:55:02,256 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 11:55:02,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 11:55:02,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {3137#false} ~i~0 := 0; {3137#false} is VALID [2018-11-23 11:55:02,256 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 11:55:02,257 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 11:55:02,257 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 11:55:02,257 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 11:55:02,257 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 11:55:02,257 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 11:55:02,257 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 11:55:02,257 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 11:55:02,258 INFO L273 TraceCheckUtils]: 44: Hoare triple {3137#false} assume !(~i~0 < 100000); {3137#false} is VALID [2018-11-23 11:55:02,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {3137#false} havoc ~x~0;~x~0 := 0; {3137#false} is VALID [2018-11-23 11:55:02,258 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 11:55:02,258 INFO L256 TraceCheckUtils]: 47: Hoare triple {3137#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3137#false} is VALID [2018-11-23 11:55:02,258 INFO L273 TraceCheckUtils]: 48: Hoare triple {3137#false} ~cond := #in~cond; {3137#false} is VALID [2018-11-23 11:55:02,258 INFO L273 TraceCheckUtils]: 49: Hoare triple {3137#false} assume 0 == ~cond; {3137#false} is VALID [2018-11-23 11:55:02,258 INFO L273 TraceCheckUtils]: 50: Hoare triple {3137#false} assume !false; {3137#false} is VALID [2018-11-23 11:55:02,260 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 11:55:02,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:02,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:55:02,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-23 11:55:02,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:02,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:55:02,323 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 11:55:02,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:55:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:55:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:55:02,324 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 12 states. [2018-11-23 11:55:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,804 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-11-23 11:55:02,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:55:02,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-23 11:55:02,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-23 11:55:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:55:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-23 11:55:02,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-23 11:55:02,900 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 11:55:02,902 INFO L225 Difference]: With dead ends: 101 [2018-11-23 11:55:02,902 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:55:02,903 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 11:55:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:55:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 11:55:02,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:02,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:02,947 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:02,947 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,949 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-23 11:55:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 11:55:02,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,949 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:02,949 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 11:55:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:02,951 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-23 11:55:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 11:55:02,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:02,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:02,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:02,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:55:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-23 11:55:02,952 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 51 [2018-11-23 11:55:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:02,953 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-23 11:55:02,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:55:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 11:55:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:55:02,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:02,953 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 11:55:02,954 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:02,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1825288524, now seen corresponding path program 9 times [2018-11-23 11:55:02,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:02,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:02,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:02,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:03,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {3705#true} call ULTIMATE.init(); {3705#true} is VALID [2018-11-23 11:55:03,261 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 11:55:03,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {3705#true} assume true; {3705#true} is VALID [2018-11-23 11:55:03,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3705#true} {3705#true} #87#return; {3705#true} is VALID [2018-11-23 11:55:03,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {3705#true} call #t~ret2 := main(); {3705#true} is VALID [2018-11-23 11:55:03,262 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 11:55:03,263 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 11:55:03,263 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 11:55:03,281 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 11:55:03,284 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 11:55:03,301 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 11:55:03,302 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 11:55:03,302 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 11:55:03,303 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 11:55:03,304 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 11:55:03,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 11:55:03,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {3706#false} ~i~0 := 0; {3706#false} is VALID [2018-11-23 11:55:03,304 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 11:55:03,304 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 11:55:03,305 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 11:55:03,305 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 11:55:03,305 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 11:55:03,305 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 11:55:03,305 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 11:55:03,305 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 11:55:03,305 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 11:55:03,306 INFO L273 TraceCheckUtils]: 26: Hoare triple {3706#false} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 11:55:03,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {3706#false} ~i~0 := 0; {3706#false} is VALID [2018-11-23 11:55:03,306 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 11:55:03,306 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 11:55:03,307 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 11:55:03,307 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 11:55:03,307 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 11:55:03,307 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 11:55:03,308 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 11:55:03,308 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 11:55:03,308 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 11:55:03,308 INFO L273 TraceCheckUtils]: 37: Hoare triple {3706#false} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 11:55:03,309 INFO L273 TraceCheckUtils]: 38: Hoare triple {3706#false} ~i~0 := 0; {3706#false} is VALID [2018-11-23 11:55:03,309 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 11:55:03,309 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 11:55:03,309 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 11:55:03,309 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 11:55:03,309 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 11:55:03,310 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 11:55:03,310 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 11:55:03,310 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 11:55:03,310 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 11:55:03,310 INFO L273 TraceCheckUtils]: 48: Hoare triple {3706#false} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 11:55:03,311 INFO L273 TraceCheckUtils]: 49: Hoare triple {3706#false} havoc ~x~0;~x~0 := 0; {3706#false} is VALID [2018-11-23 11:55:03,311 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 11:55:03,311 INFO L256 TraceCheckUtils]: 51: Hoare triple {3706#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3706#false} is VALID [2018-11-23 11:55:03,311 INFO L273 TraceCheckUtils]: 52: Hoare triple {3706#false} ~cond := #in~cond; {3706#false} is VALID [2018-11-23 11:55:03,311 INFO L273 TraceCheckUtils]: 53: Hoare triple {3706#false} assume 0 == ~cond; {3706#false} is VALID [2018-11-23 11:55:03,311 INFO L273 TraceCheckUtils]: 54: Hoare triple {3706#false} assume !false; {3706#false} is VALID [2018-11-23 11:55:03,313 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 11:55:03,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:03,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:03,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:05,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:55:05,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:05,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:06,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {3705#true} call ULTIMATE.init(); {3705#true} is VALID [2018-11-23 11:55:06,007 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 11:55:06,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {3705#true} assume true; {3705#true} is VALID [2018-11-23 11:55:06,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3705#true} {3705#true} #87#return; {3705#true} is VALID [2018-11-23 11:55:06,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {3705#true} call #t~ret2 := main(); {3705#true} is VALID [2018-11-23 11:55:06,008 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 11:55:06,008 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 11:55:06,008 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 11:55:06,008 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 11:55:06,009 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 11:55:06,009 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 11:55:06,009 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 11:55:06,009 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 11:55:06,009 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 11:55:06,010 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 11:55:06,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {3705#true} assume !(~i~0 < 100000); {3705#true} is VALID [2018-11-23 11:55:06,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {3705#true} ~i~0 := 0; {3705#true} is VALID [2018-11-23 11:55:06,010 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 11:55:06,010 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 11:55:06,010 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 11:55:06,010 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 11:55:06,010 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 11:55:06,011 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 11:55:06,011 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 11:55:06,011 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 11:55:06,011 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 11:55:06,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {3705#true} assume !(~i~0 < 100000); {3705#true} is VALID [2018-11-23 11:55:06,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {3705#true} ~i~0 := 0; {3801#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:06,012 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 11:55:06,013 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 11:55:06,013 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 11:55:06,014 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 11:55:06,014 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 11:55:06,015 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 11:55:06,016 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 11:55:06,019 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 11:55:06,020 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 11:55:06,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {3716#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 11:55:06,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {3706#false} ~i~0 := 0; {3706#false} is VALID [2018-11-23 11:55:06,021 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 11:55:06,022 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 11:55:06,022 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 11:55:06,022 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 11:55:06,022 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 11:55:06,022 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 11:55:06,022 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 11:55:06,022 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 11:55:06,022 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 11:55:06,023 INFO L273 TraceCheckUtils]: 48: Hoare triple {3706#false} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 11:55:06,023 INFO L273 TraceCheckUtils]: 49: Hoare triple {3706#false} havoc ~x~0;~x~0 := 0; {3706#false} is VALID [2018-11-23 11:55:06,023 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 11:55:06,023 INFO L256 TraceCheckUtils]: 51: Hoare triple {3706#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {3706#false} is VALID [2018-11-23 11:55:06,023 INFO L273 TraceCheckUtils]: 52: Hoare triple {3706#false} ~cond := #in~cond; {3706#false} is VALID [2018-11-23 11:55:06,023 INFO L273 TraceCheckUtils]: 53: Hoare triple {3706#false} assume 0 == ~cond; {3706#false} is VALID [2018-11-23 11:55:06,023 INFO L273 TraceCheckUtils]: 54: Hoare triple {3706#false} assume !false; {3706#false} is VALID [2018-11-23 11:55:06,025 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 11:55:06,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:06,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:55:06,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-23 11:55:06,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:06,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:55:06,108 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 11:55:06,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:55:06,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:55:06,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:55:06,110 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 13 states. [2018-11-23 11:55:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,454 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2018-11-23 11:55:06,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:55:06,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-23 11:55:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 92 transitions. [2018-11-23 11:55:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:55:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 92 transitions. [2018-11-23 11:55:06,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 92 transitions. [2018-11-23 11:55:06,571 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 11:55:06,573 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:55:06,573 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:55:06,574 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 11:55:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:55:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 11:55:06,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:06,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:06,622 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:06,622 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,624 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 11:55:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 11:55:06,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:06,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:06,624 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:06,624 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 11:55:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:06,626 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 11:55:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 11:55:06,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:06,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:06,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:06,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:55:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-23 11:55:06,628 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 55 [2018-11-23 11:55:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:06,629 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-23 11:55:06,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:55:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 11:55:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:55:06,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:06,630 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 11:55:06,630 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:06,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1177185202, now seen corresponding path program 10 times [2018-11-23 11:55:06,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:06,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:06,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:06,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:06,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:07,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {4317#true} call ULTIMATE.init(); {4317#true} is VALID [2018-11-23 11:55:07,412 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 11:55:07,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {4317#true} assume true; {4317#true} is VALID [2018-11-23 11:55:07,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4317#true} {4317#true} #87#return; {4317#true} is VALID [2018-11-23 11:55:07,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {4317#true} call #t~ret2 := main(); {4317#true} is VALID [2018-11-23 11:55:07,414 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 11:55:07,415 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 11:55:07,416 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 11:55:07,417 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 11:55:07,417 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 11:55:07,419 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 11:55:07,420 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 11:55:07,421 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 11:55:07,422 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 11:55:07,423 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 11:55:07,424 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 11:55:07,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {4329#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 11:55:07,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 11:55:07,425 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 11:55:07,425 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 11:55:07,425 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 11:55:07,426 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 11:55:07,426 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 11:55:07,426 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 11:55:07,426 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 11:55:07,426 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 11:55:07,427 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 11:55:07,427 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 11:55:07,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 11:55:07,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 11:55:07,427 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 11:55:07,428 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 11:55:07,428 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 11:55:07,428 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 11:55:07,428 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 11:55:07,428 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 11:55:07,429 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 11:55:07,429 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 11:55:07,429 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 11:55:07,429 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 11:55:07,430 INFO L273 TraceCheckUtils]: 40: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 11:55:07,430 INFO L273 TraceCheckUtils]: 41: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 11:55:07,430 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 11:55:07,430 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 11:55:07,431 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 11:55:07,431 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 11:55:07,431 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 11:55:07,431 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 11:55:07,431 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 11:55:07,432 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 11:55:07,432 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 11:55:07,432 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 11:55:07,432 INFO L273 TraceCheckUtils]: 52: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 11:55:07,432 INFO L273 TraceCheckUtils]: 53: Hoare triple {4318#false} havoc ~x~0;~x~0 := 0; {4318#false} is VALID [2018-11-23 11:55:07,432 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 11:55:07,433 INFO L256 TraceCheckUtils]: 55: Hoare triple {4318#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4318#false} is VALID [2018-11-23 11:55:07,433 INFO L273 TraceCheckUtils]: 56: Hoare triple {4318#false} ~cond := #in~cond; {4318#false} is VALID [2018-11-23 11:55:07,433 INFO L273 TraceCheckUtils]: 57: Hoare triple {4318#false} assume 0 == ~cond; {4318#false} is VALID [2018-11-23 11:55:07,433 INFO L273 TraceCheckUtils]: 58: Hoare triple {4318#false} assume !false; {4318#false} is VALID [2018-11-23 11:55:07,435 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 11:55:07,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:07,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:07,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:55:07,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:55:07,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:07,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:07,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {4317#true} call ULTIMATE.init(); {4317#true} is VALID [2018-11-23 11:55:07,753 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 11:55:07,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {4317#true} assume true; {4317#true} is VALID [2018-11-23 11:55:07,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4317#true} {4317#true} #87#return; {4317#true} is VALID [2018-11-23 11:55:07,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {4317#true} call #t~ret2 := main(); {4317#true} is VALID [2018-11-23 11:55:07,755 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 11:55:07,755 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 11:55:07,756 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 11:55:07,757 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 11:55:07,758 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 11:55:07,759 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 11:55:07,760 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 11:55:07,761 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 11:55:07,762 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 11:55:07,763 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 11:55:07,764 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 11:55:07,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {4329#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 11:55:07,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 11:55:07,766 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 11:55:07,766 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 11:55:07,766 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 11:55:07,766 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 11:55:07,767 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 11:55:07,767 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 11:55:07,767 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 11:55:07,767 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 11:55:07,768 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 11:55:07,768 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 11:55:07,768 INFO L273 TraceCheckUtils]: 28: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 11:55:07,768 INFO L273 TraceCheckUtils]: 29: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 11:55:07,768 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 11:55:07,768 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 11:55:07,769 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 11:55:07,769 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 11:55:07,769 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 11:55:07,769 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 11:55:07,769 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 11:55:07,769 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 11:55:07,769 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 11:55:07,770 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 11:55:07,770 INFO L273 TraceCheckUtils]: 40: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 11:55:07,770 INFO L273 TraceCheckUtils]: 41: Hoare triple {4318#false} ~i~0 := 0; {4318#false} is VALID [2018-11-23 11:55:07,770 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 11:55:07,770 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 11:55:07,770 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 11:55:07,770 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 11:55:07,771 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 11:55:07,771 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 11:55:07,771 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 11:55:07,771 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 11:55:07,771 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 11:55:07,771 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 11:55:07,772 INFO L273 TraceCheckUtils]: 52: Hoare triple {4318#false} assume !(~i~0 < 100000); {4318#false} is VALID [2018-11-23 11:55:07,772 INFO L273 TraceCheckUtils]: 53: Hoare triple {4318#false} havoc ~x~0;~x~0 := 0; {4318#false} is VALID [2018-11-23 11:55:07,772 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 11:55:07,772 INFO L256 TraceCheckUtils]: 55: Hoare triple {4318#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4318#false} is VALID [2018-11-23 11:55:07,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {4318#false} ~cond := #in~cond; {4318#false} is VALID [2018-11-23 11:55:07,772 INFO L273 TraceCheckUtils]: 57: Hoare triple {4318#false} assume 0 == ~cond; {4318#false} is VALID [2018-11-23 11:55:07,772 INFO L273 TraceCheckUtils]: 58: Hoare triple {4318#false} assume !false; {4318#false} is VALID [2018-11-23 11:55:07,776 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 11:55:07,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:07,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:55:07,799 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-11-23 11:55:07,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:07,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:55:07,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:07,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:55:07,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:55:07,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:07,836 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 14 states. [2018-11-23 11:55:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:08,300 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-23 11:55:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:55:08,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-11-23 11:55:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-23 11:55:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:55:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-23 11:55:08,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 96 transitions. [2018-11-23 11:55:08,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:08,476 INFO L225 Difference]: With dead ends: 115 [2018-11-23 11:55:08,477 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 11:55:08,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:55:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 11:55:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 11:55:08,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:08,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-23 11:55:08,526 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 11:55:08,526 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 11:55:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:08,528 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 11:55:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 11:55:08,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:08,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:08,529 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-23 11:55:08,529 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-23 11:55:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:08,530 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 11:55:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 11:55:08,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:08,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:08,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:08,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:55:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-23 11:55:08,533 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 59 [2018-11-23 11:55:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:08,533 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-23 11:55:08,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:55:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 11:55:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 11:55:08,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:08,534 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 11:55:08,535 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:08,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash 342894732, now seen corresponding path program 11 times [2018-11-23 11:55:08,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:08,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:08,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:10,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2018-11-23 11:55:10,239 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 11:55:10,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2018-11-23 11:55:10,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #87#return; {4972#true} is VALID [2018-11-23 11:55:10,240 INFO L256 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret2 := main(); {4972#true} is VALID [2018-11-23 11:55:10,240 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 11:55:10,241 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 11:55:10,242 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 11:55:10,242 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 11:55:10,243 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 11:55:10,243 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 11:55:10,244 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 11:55:10,245 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 11:55:10,246 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 11:55:10,247 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 11:55:10,247 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 11:55:10,248 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 11:55:10,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {4985#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 11:55:10,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 11:55:10,250 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 11:55:10,250 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 11:55:10,250 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 11:55:10,250 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 11:55:10,250 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 11:55:10,251 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 11:55:10,251 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 11:55:10,251 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 11:55:10,251 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 11:55:10,251 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 11:55:10,252 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 11:55:10,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 11:55:10,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 11:55:10,252 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 11:55:10,252 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 11:55:10,253 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 11:55:10,253 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 11:55:10,253 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 11:55:10,253 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 11:55:10,253 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 11:55:10,253 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 11:55:10,254 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 11:55:10,254 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 11:55:10,254 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 11:55:10,254 INFO L273 TraceCheckUtils]: 43: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 11:55:10,254 INFO L273 TraceCheckUtils]: 44: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 11:55:10,254 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 11:55:10,254 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 11:55:10,254 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 11:55:10,254 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 11:55:10,255 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 11:55:10,255 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 11:55:10,255 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 11:55:10,255 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 11:55:10,255 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 11:55:10,255 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 11:55:10,255 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 11:55:10,255 INFO L273 TraceCheckUtils]: 56: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 11:55:10,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {4973#false} havoc ~x~0;~x~0 := 0; {4973#false} is VALID [2018-11-23 11:55:10,256 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 11:55:10,256 INFO L256 TraceCheckUtils]: 59: Hoare triple {4973#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4973#false} is VALID [2018-11-23 11:55:10,256 INFO L273 TraceCheckUtils]: 60: Hoare triple {4973#false} ~cond := #in~cond; {4973#false} is VALID [2018-11-23 11:55:10,256 INFO L273 TraceCheckUtils]: 61: Hoare triple {4973#false} assume 0 == ~cond; {4973#false} is VALID [2018-11-23 11:55:10,256 INFO L273 TraceCheckUtils]: 62: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2018-11-23 11:55:10,258 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 11:55:10,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:10,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:10,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:55:24,772 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 11:55:24,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:24,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:25,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {4972#true} call ULTIMATE.init(); {4972#true} is VALID [2018-11-23 11:55:25,002 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 11:55:25,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {4972#true} assume true; {4972#true} is VALID [2018-11-23 11:55:25,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4972#true} {4972#true} #87#return; {4972#true} is VALID [2018-11-23 11:55:25,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {4972#true} call #t~ret2 := main(); {4972#true} is VALID [2018-11-23 11:55:25,005 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 11:55:25,005 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 11:55:25,006 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 11:55:25,006 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 11:55:25,007 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 11:55:25,007 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 11:55:25,008 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 11:55:25,009 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 11:55:25,010 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 11:55:25,011 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 11:55:25,012 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 11:55:25,012 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 11:55:25,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {4985#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 11:55:25,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 11:55:25,014 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 11:55:25,014 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 11:55:25,014 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 11:55:25,014 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 11:55:25,014 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 11:55:25,015 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 11:55:25,015 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 11:55:25,015 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 11:55:25,015 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 11:55:25,015 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 11:55:25,016 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 11:55:25,016 INFO L273 TraceCheckUtils]: 30: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 11:55:25,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 11:55:25,016 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 11:55:25,016 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 11:55:25,016 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 11:55:25,017 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 11:55:25,017 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 11:55:25,017 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 11:55:25,017 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 11:55:25,017 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 11:55:25,017 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 11:55:25,017 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 11:55:25,017 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 11:55:25,018 INFO L273 TraceCheckUtils]: 43: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 11:55:25,018 INFO L273 TraceCheckUtils]: 44: Hoare triple {4973#false} ~i~0 := 0; {4973#false} is VALID [2018-11-23 11:55:25,018 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 11:55:25,018 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 11:55:25,018 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 11:55:25,018 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 11:55:25,018 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 11:55:25,018 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 11:55:25,019 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 11:55:25,019 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 11:55:25,019 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 11:55:25,019 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 11:55:25,019 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 11:55:25,019 INFO L273 TraceCheckUtils]: 56: Hoare triple {4973#false} assume !(~i~0 < 100000); {4973#false} is VALID [2018-11-23 11:55:25,019 INFO L273 TraceCheckUtils]: 57: Hoare triple {4973#false} havoc ~x~0;~x~0 := 0; {4973#false} is VALID [2018-11-23 11:55:25,019 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 11:55:25,020 INFO L256 TraceCheckUtils]: 59: Hoare triple {4973#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {4973#false} is VALID [2018-11-23 11:55:25,020 INFO L273 TraceCheckUtils]: 60: Hoare triple {4973#false} ~cond := #in~cond; {4973#false} is VALID [2018-11-23 11:55:25,020 INFO L273 TraceCheckUtils]: 61: Hoare triple {4973#false} assume 0 == ~cond; {4973#false} is VALID [2018-11-23 11:55:25,020 INFO L273 TraceCheckUtils]: 62: Hoare triple {4973#false} assume !false; {4973#false} is VALID [2018-11-23 11:55:25,022 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 11:55:25,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:25,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:55:25,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-11-23 11:55:25,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:25,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:55:25,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:25,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:55:25,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:55:25,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:25,076 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 15 states. [2018-11-23 11:55:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:25,635 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-11-23 11:55:25,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:55:25,635 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-11-23 11:55:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2018-11-23 11:55:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:55:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2018-11-23 11:55:25,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 100 transitions. [2018-11-23 11:55:26,497 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 11:55:26,500 INFO L225 Difference]: With dead ends: 122 [2018-11-23 11:55:26,500 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:55:26,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:55:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:55:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 11:55:26,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:26,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:26,549 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:26,549 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:26,552 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 11:55:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:55:26,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:26,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:26,553 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:26,553 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 11:55:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:26,554 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 11:55:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:55:26,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:26,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:26,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:26,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:55:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-11-23 11:55:26,557 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 63 [2018-11-23 11:55:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:26,557 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-11-23 11:55:26,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:55:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:55:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:55:26,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:26,558 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 11:55:26,558 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:26,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1686898, now seen corresponding path program 12 times [2018-11-23 11:55:26,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:26,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:26,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:26,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:26,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:27,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {5670#true} call ULTIMATE.init(); {5670#true} is VALID [2018-11-23 11:55:27,224 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 11:55:27,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {5670#true} assume true; {5670#true} is VALID [2018-11-23 11:55:27,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5670#true} {5670#true} #87#return; {5670#true} is VALID [2018-11-23 11:55:27,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {5670#true} call #t~ret2 := main(); {5670#true} is VALID [2018-11-23 11:55:27,225 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 11:55:27,226 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 11:55:27,227 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 11:55:27,228 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 11:55:27,229 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 11:55:27,230 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 11:55:27,231 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 11:55:27,231 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 11:55:27,232 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 11:55:27,233 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 11:55:27,234 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 11:55:27,235 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 11:55:27,236 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 11:55:27,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {5684#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 11:55:27,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {5671#false} ~i~0 := 0; {5671#false} is VALID [2018-11-23 11:55:27,237 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 11:55:27,238 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 11:55:27,238 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 11:55:27,238 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 11:55:27,238 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 11:55:27,238 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 11:55:27,239 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 11:55:27,239 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 11:55:27,239 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 11:55:27,239 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 11:55:27,239 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 11:55:27,240 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 11:55:27,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {5671#false} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 11:55:27,240 INFO L273 TraceCheckUtils]: 33: Hoare triple {5671#false} ~i~0 := 0; {5671#false} is VALID [2018-11-23 11:55:27,240 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 11:55:27,241 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 11:55:27,241 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 11:55:27,241 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 11:55:27,241 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 11:55:27,241 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 11:55:27,242 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 11:55:27,242 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 11:55:27,242 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 11:55:27,242 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 11:55:27,242 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 11:55:27,242 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 11:55:27,242 INFO L273 TraceCheckUtils]: 46: Hoare triple {5671#false} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 11:55:27,242 INFO L273 TraceCheckUtils]: 47: Hoare triple {5671#false} ~i~0 := 0; {5671#false} is VALID [2018-11-23 11:55:27,242 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 11:55:27,243 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 11:55:27,243 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 11:55:27,243 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 11:55:27,243 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 11:55:27,243 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 11:55:27,243 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 11:55:27,243 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 11:55:27,243 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 11:55:27,244 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 11:55:27,244 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 11:55:27,244 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 11:55:27,244 INFO L273 TraceCheckUtils]: 60: Hoare triple {5671#false} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 11:55:27,244 INFO L273 TraceCheckUtils]: 61: Hoare triple {5671#false} havoc ~x~0;~x~0 := 0; {5671#false} is VALID [2018-11-23 11:55:27,244 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 11:55:27,244 INFO L256 TraceCheckUtils]: 63: Hoare triple {5671#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {5671#false} is VALID [2018-11-23 11:55:27,244 INFO L273 TraceCheckUtils]: 64: Hoare triple {5671#false} ~cond := #in~cond; {5671#false} is VALID [2018-11-23 11:55:27,245 INFO L273 TraceCheckUtils]: 65: Hoare triple {5671#false} assume 0 == ~cond; {5671#false} is VALID [2018-11-23 11:55:27,245 INFO L273 TraceCheckUtils]: 66: Hoare triple {5671#false} assume !false; {5671#false} is VALID [2018-11-23 11:55:27,247 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 11:55:27,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:27,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:27,255 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:55:35,341 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:55:35,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:35,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:35,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {5670#true} call ULTIMATE.init(); {5670#true} is VALID [2018-11-23 11:55:35,545 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 11:55:35,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {5670#true} assume true; {5670#true} is VALID [2018-11-23 11:55:35,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5670#true} {5670#true} #87#return; {5670#true} is VALID [2018-11-23 11:55:35,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {5670#true} call #t~ret2 := main(); {5670#true} is VALID [2018-11-23 11:55:35,545 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 11:55:35,546 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 11:55:35,546 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 11:55:35,546 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 11:55:35,546 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 11:55:35,546 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 11:55:35,547 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 11:55:35,547 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 11:55:35,547 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 11:55:35,547 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 11:55:35,548 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 11:55:35,548 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 11:55:35,548 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; {5670#true} is VALID [2018-11-23 11:55:35,548 INFO L273 TraceCheckUtils]: 18: Hoare triple {5670#true} assume !(~i~0 < 100000); {5670#true} is VALID [2018-11-23 11:55:35,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {5670#true} ~i~0 := 0; {5670#true} is VALID [2018-11-23 11:55:35,548 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 11:55:35,548 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 11:55:35,549 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 11:55:35,549 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 11:55:35,549 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 11:55:35,549 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 11:55:35,549 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 11:55:35,549 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 11:55:35,549 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 11:55:35,549 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 11:55:35,550 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 11:55:35,550 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; {5781#(<= main_~i~0 100000)} is VALID [2018-11-23 11:55:35,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {5781#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5670#true} is VALID [2018-11-23 11:55:35,551 INFO L273 TraceCheckUtils]: 33: Hoare triple {5670#true} ~i~0 := 0; {5670#true} is VALID [2018-11-23 11:55:35,551 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 11:55:35,551 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 11:55:35,551 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 11:55:35,551 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 11:55:35,551 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 11:55:35,551 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 11:55:35,552 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 11:55:35,552 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 11:55:35,552 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 11:55:35,552 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 11:55:35,552 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 11:55:35,553 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; {5781#(<= main_~i~0 100000)} is VALID [2018-11-23 11:55:35,553 INFO L273 TraceCheckUtils]: 46: Hoare triple {5781#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5670#true} is VALID [2018-11-23 11:55:35,553 INFO L273 TraceCheckUtils]: 47: Hoare triple {5670#true} ~i~0 := 0; {5830#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:35,554 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 11:55:35,554 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 11:55:35,555 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 11:55:35,555 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 11:55:35,556 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 11:55:35,557 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 11:55:35,558 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 11:55:35,559 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 11:55:35,559 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 11:55:35,560 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 11:55:35,561 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 11:55:35,562 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 11:55:35,563 INFO L273 TraceCheckUtils]: 60: Hoare triple {5684#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5671#false} is VALID [2018-11-23 11:55:35,563 INFO L273 TraceCheckUtils]: 61: Hoare triple {5671#false} havoc ~x~0;~x~0 := 0; {5671#false} is VALID [2018-11-23 11:55:35,563 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 11:55:35,564 INFO L256 TraceCheckUtils]: 63: Hoare triple {5671#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {5671#false} is VALID [2018-11-23 11:55:35,564 INFO L273 TraceCheckUtils]: 64: Hoare triple {5671#false} ~cond := #in~cond; {5671#false} is VALID [2018-11-23 11:55:35,564 INFO L273 TraceCheckUtils]: 65: Hoare triple {5671#false} assume 0 == ~cond; {5671#false} is VALID [2018-11-23 11:55:35,564 INFO L273 TraceCheckUtils]: 66: Hoare triple {5671#false} assume !false; {5671#false} is VALID [2018-11-23 11:55:35,567 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 11:55:35,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:35,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2018-11-23 11:55:35,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-23 11:55:35,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:35,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:55:35,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:35,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:55:35,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:55:35,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:35,649 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 17 states. [2018-11-23 11:55:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,545 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2018-11-23 11:55:36,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:55:36,545 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-23 11:55:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2018-11-23 11:55:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2018-11-23 11:55:36,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 104 transitions. [2018-11-23 11:55:36,664 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 11:55:36,666 INFO L225 Difference]: With dead ends: 129 [2018-11-23 11:55:36,666 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:55:36,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:36,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:55:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 11:55:36,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:36,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,828 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,828 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,833 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 11:55:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 11:55:36,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,834 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,834 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 11:55:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:36,836 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 11:55:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 11:55:36,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:36,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:36,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:36,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:55:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-11-23 11:55:36,839 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 67 [2018-11-23 11:55:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:36,839 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-23 11:55:36,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:55:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 11:55:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:55:36,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:36,840 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 11:55:36,840 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:36,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:36,841 INFO L82 PathProgramCache]: Analyzing trace with hash 106590156, now seen corresponding path program 13 times [2018-11-23 11:55:36,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:36,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:36,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:36,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {6412#true} call ULTIMATE.init(); {6412#true} is VALID [2018-11-23 11:55:37,401 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 11:55:37,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {6412#true} assume true; {6412#true} is VALID [2018-11-23 11:55:37,402 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6412#true} {6412#true} #87#return; {6412#true} is VALID [2018-11-23 11:55:37,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {6412#true} call #t~ret2 := main(); {6412#true} is VALID [2018-11-23 11:55:37,403 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 11:55:37,404 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 11:55:37,404 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 11:55:37,405 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 11:55:37,405 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 11:55:37,406 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 11:55:37,406 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 11:55:37,407 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 11:55:37,408 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 11:55:37,409 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 11:55:37,410 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 11:55:37,411 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 11:55:37,412 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 11:55:37,413 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 11:55:37,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {6427#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 11:55:37,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 11:55:37,414 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 11:55:37,414 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 11:55:37,415 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 11:55:37,415 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 11:55:37,415 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 11:55:37,415 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 11:55:37,415 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 11:55:37,416 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 11:55:37,416 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 11:55:37,416 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 11:55:37,416 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 11:55:37,416 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 11:55:37,417 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 11:55:37,417 INFO L273 TraceCheckUtils]: 34: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 11:55:37,417 INFO L273 TraceCheckUtils]: 35: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 11:55:37,417 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 11:55:37,417 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 11:55:37,417 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 11:55:37,417 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 11:55:37,417 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 11:55:37,418 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 11:55:37,418 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 11:55:37,418 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 11:55:37,418 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 11:55:37,418 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 11:55:37,418 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 11:55:37,418 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 11:55:37,418 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 11:55:37,419 INFO L273 TraceCheckUtils]: 49: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 11:55:37,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 11:55:37,419 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 11:55:37,419 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 11:55:37,419 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 11:55:37,419 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 11:55:37,419 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 11:55:37,419 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 11:55:37,420 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 11:55:37,420 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 11:55:37,420 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 11:55:37,420 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 11:55:37,420 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 11:55:37,420 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 11:55:37,420 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 11:55:37,420 INFO L273 TraceCheckUtils]: 64: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 11:55:37,420 INFO L273 TraceCheckUtils]: 65: Hoare triple {6413#false} havoc ~x~0;~x~0 := 0; {6413#false} is VALID [2018-11-23 11:55:37,421 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 11:55:37,421 INFO L256 TraceCheckUtils]: 67: Hoare triple {6413#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {6413#false} is VALID [2018-11-23 11:55:37,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {6413#false} ~cond := #in~cond; {6413#false} is VALID [2018-11-23 11:55:37,421 INFO L273 TraceCheckUtils]: 69: Hoare triple {6413#false} assume 0 == ~cond; {6413#false} is VALID [2018-11-23 11:55:37,421 INFO L273 TraceCheckUtils]: 70: Hoare triple {6413#false} assume !false; {6413#false} is VALID [2018-11-23 11:55:37,423 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 11:55:37,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:37,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:37,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:37,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:37,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {6412#true} call ULTIMATE.init(); {6412#true} is VALID [2018-11-23 11:55:37,917 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 11:55:37,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {6412#true} assume true; {6412#true} is VALID [2018-11-23 11:55:37,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6412#true} {6412#true} #87#return; {6412#true} is VALID [2018-11-23 11:55:37,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {6412#true} call #t~ret2 := main(); {6412#true} is VALID [2018-11-23 11:55:37,918 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 11:55:37,918 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 11:55:37,919 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 11:55:37,920 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 11:55:37,920 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 11:55:37,921 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 11:55:37,921 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 11:55:37,922 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 11:55:37,923 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 11:55:37,924 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 11:55:37,925 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 11:55:37,926 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 11:55:37,927 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 11:55:37,928 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 11:55:37,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {6427#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 11:55:37,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 11:55:37,929 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 11:55:37,929 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 11:55:37,929 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 11:55:37,929 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 11:55:37,930 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 11:55:37,930 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 11:55:37,930 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 11:55:37,930 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 11:55:37,930 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 11:55:37,931 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 11:55:37,931 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 11:55:37,931 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 11:55:37,931 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 11:55:37,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 11:55:37,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 11:55:37,932 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 11:55:37,932 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 11:55:37,932 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 11:55:37,932 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 11:55:37,933 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 11:55:37,933 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 11:55:37,933 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 11:55:37,933 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 11:55:37,933 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 11:55:37,933 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 11:55:37,933 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 11:55:37,933 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 11:55:37,934 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 11:55:37,934 INFO L273 TraceCheckUtils]: 49: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 11:55:37,934 INFO L273 TraceCheckUtils]: 50: Hoare triple {6413#false} ~i~0 := 0; {6413#false} is VALID [2018-11-23 11:55:37,934 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 11:55:37,934 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 11:55:37,934 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 11:55:37,934 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 11:55:37,934 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 11:55:37,935 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 11:55:37,935 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 11:55:37,935 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 11:55:37,935 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 11:55:37,935 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 11:55:37,935 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 11:55:37,935 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 11:55:37,935 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 11:55:37,935 INFO L273 TraceCheckUtils]: 64: Hoare triple {6413#false} assume !(~i~0 < 100000); {6413#false} is VALID [2018-11-23 11:55:37,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {6413#false} havoc ~x~0;~x~0 := 0; {6413#false} is VALID [2018-11-23 11:55:37,936 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 11:55:37,936 INFO L256 TraceCheckUtils]: 67: Hoare triple {6413#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {6413#false} is VALID [2018-11-23 11:55:37,936 INFO L273 TraceCheckUtils]: 68: Hoare triple {6413#false} ~cond := #in~cond; {6413#false} is VALID [2018-11-23 11:55:37,936 INFO L273 TraceCheckUtils]: 69: Hoare triple {6413#false} assume 0 == ~cond; {6413#false} is VALID [2018-11-23 11:55:37,936 INFO L273 TraceCheckUtils]: 70: Hoare triple {6413#false} assume !false; {6413#false} is VALID [2018-11-23 11:55:37,938 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 11:55:37,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:37,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:55:37,962 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-11-23 11:55:37,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:37,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:55:38,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:38,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:55:38,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:55:38,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:55:38,027 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 17 states. [2018-11-23 11:55:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:38,782 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-11-23 11:55:38,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:55:38,782 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-11-23 11:55:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2018-11-23 11:55:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:55:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2018-11-23 11:55:38,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 108 transitions. [2018-11-23 11:55:39,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:39,333 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:55:39,333 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 11:55:39,334 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 11:55:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 11:55:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-23 11:55:39,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:39,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:39,385 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:39,385 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,388 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 11:55:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 11:55:39,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:39,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:39,389 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:39,389 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-23 11:55:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:39,390 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 11:55:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 11:55:39,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:39,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:39,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:39,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:55:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-23 11:55:39,393 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 71 [2018-11-23 11:55:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:39,393 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-23 11:55:39,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:55:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 11:55:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:55:39,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:39,394 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 11:55:39,394 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:39,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1965252814, now seen corresponding path program 14 times [2018-11-23 11:55:39,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:39,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:39,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:55:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:39,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {7196#true} call ULTIMATE.init(); {7196#true} is VALID [2018-11-23 11:55:39,745 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 11:55:39,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {7196#true} assume true; {7196#true} is VALID [2018-11-23 11:55:39,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7196#true} {7196#true} #87#return; {7196#true} is VALID [2018-11-23 11:55:39,746 INFO L256 TraceCheckUtils]: 4: Hoare triple {7196#true} call #t~ret2 := main(); {7196#true} is VALID [2018-11-23 11:55:39,746 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 11:55:39,747 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 11:55:39,748 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 11:55:39,748 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 11:55:39,749 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 11:55:39,750 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 11:55:39,751 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 11:55:39,752 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 11:55:39,753 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 11:55:39,755 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 11:55:39,756 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 11:55:39,757 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 11:55:39,758 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 11:55:39,759 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 11:55:39,760 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 11:55:39,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {7212#(<= main_~i~0 14)} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 11:55:39,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 11:55:39,761 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 11:55:39,762 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 11:55:39,762 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 11:55:39,762 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 11:55:39,762 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 11:55:39,763 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 11:55:39,763 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 11:55:39,764 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 11:55:39,764 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 11:55:39,764 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 11:55:39,764 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 11:55:39,765 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 11:55:39,765 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 11:55:39,765 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 11:55:39,765 INFO L273 TraceCheckUtils]: 36: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 11:55:39,766 INFO L273 TraceCheckUtils]: 37: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 11:55:39,766 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 11:55:39,766 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 11:55:39,766 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 11:55:39,766 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 11:55:39,767 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 11:55:39,767 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 11:55:39,767 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 11:55:39,767 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 11:55:39,767 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 11:55:39,768 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 11:55:39,768 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 11:55:39,768 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 11:55:39,768 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 11:55:39,768 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 11:55:39,769 INFO L273 TraceCheckUtils]: 52: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 11:55:39,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 11:55:39,769 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 11:55:39,769 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 11:55:39,769 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 11:55:39,770 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 11:55:39,770 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 11:55:39,770 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 11:55:39,770 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 11:55:39,771 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 11:55:39,771 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 11:55:39,771 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 11:55:39,771 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 11:55:39,771 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 11:55:39,772 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 11:55:39,772 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 11:55:39,772 INFO L273 TraceCheckUtils]: 68: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 11:55:39,772 INFO L273 TraceCheckUtils]: 69: Hoare triple {7197#false} havoc ~x~0;~x~0 := 0; {7197#false} is VALID [2018-11-23 11:55:39,772 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 11:55:39,773 INFO L256 TraceCheckUtils]: 71: Hoare triple {7197#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {7197#false} is VALID [2018-11-23 11:55:39,773 INFO L273 TraceCheckUtils]: 72: Hoare triple {7197#false} ~cond := #in~cond; {7197#false} is VALID [2018-11-23 11:55:39,773 INFO L273 TraceCheckUtils]: 73: Hoare triple {7197#false} assume 0 == ~cond; {7197#false} is VALID [2018-11-23 11:55:39,773 INFO L273 TraceCheckUtils]: 74: Hoare triple {7197#false} assume !false; {7197#false} is VALID [2018-11-23 11:55:39,780 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 11:55:39,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:39,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:39,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:55:39,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:55:39,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:39,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:40,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {7196#true} call ULTIMATE.init(); {7196#true} is VALID [2018-11-23 11:55:40,081 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 11:55:40,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {7196#true} assume true; {7196#true} is VALID [2018-11-23 11:55:40,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7196#true} {7196#true} #87#return; {7196#true} is VALID [2018-11-23 11:55:40,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {7196#true} call #t~ret2 := main(); {7196#true} is VALID [2018-11-23 11:55:40,083 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 11:55:40,083 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 11:55:40,084 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 11:55:40,085 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 11:55:40,104 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 11:55:40,105 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 11:55:40,106 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 11:55:40,106 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 11:55:40,107 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 11:55:40,108 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 11:55:40,109 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 11:55:40,110 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 11:55:40,111 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 11:55:40,112 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 11:55:40,113 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 11:55:40,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {7212#(<= main_~i~0 14)} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 11:55:40,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 11:55:40,115 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 11:55:40,115 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 11:55:40,115 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 11:55:40,116 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 11:55:40,116 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 11:55:40,116 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 11:55:40,116 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 11:55:40,117 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 11:55:40,117 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 11:55:40,117 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 11:55:40,117 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 11:55:40,118 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 11:55:40,118 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 11:55:40,118 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 11:55:40,118 INFO L273 TraceCheckUtils]: 36: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 11:55:40,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 11:55:40,119 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 11:55:40,119 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 11:55:40,119 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 11:55:40,120 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 11:55:40,120 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 11:55:40,120 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 11:55:40,120 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 11:55:40,120 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 11:55:40,120 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 11:55:40,121 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 11:55:40,121 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 11:55:40,121 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 11:55:40,121 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 11:55:40,121 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 11:55:40,121 INFO L273 TraceCheckUtils]: 52: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 11:55:40,121 INFO L273 TraceCheckUtils]: 53: Hoare triple {7197#false} ~i~0 := 0; {7197#false} is VALID [2018-11-23 11:55:40,122 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 11:55:40,122 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 11:55:40,122 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 11:55:40,122 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 11:55:40,122 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 11:55:40,122 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 11:55:40,123 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 11:55:40,123 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 11:55:40,123 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 11:55:40,123 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 11:55:40,123 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 11:55:40,123 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 11:55:40,123 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 11:55:40,124 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 11:55:40,124 INFO L273 TraceCheckUtils]: 68: Hoare triple {7197#false} assume !(~i~0 < 100000); {7197#false} is VALID [2018-11-23 11:55:40,124 INFO L273 TraceCheckUtils]: 69: Hoare triple {7197#false} havoc ~x~0;~x~0 := 0; {7197#false} is VALID [2018-11-23 11:55:40,124 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 11:55:40,124 INFO L256 TraceCheckUtils]: 71: Hoare triple {7197#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {7197#false} is VALID [2018-11-23 11:55:40,124 INFO L273 TraceCheckUtils]: 72: Hoare triple {7197#false} ~cond := #in~cond; {7197#false} is VALID [2018-11-23 11:55:40,124 INFO L273 TraceCheckUtils]: 73: Hoare triple {7197#false} assume 0 == ~cond; {7197#false} is VALID [2018-11-23 11:55:40,125 INFO L273 TraceCheckUtils]: 74: Hoare triple {7197#false} assume !false; {7197#false} is VALID [2018-11-23 11:55:40,130 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 11:55:40,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:40,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:55:40,150 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-11-23 11:55:40,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:55:40,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:55:40,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:55:40,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:55:40,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:55:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:55:40,185 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 18 states. [2018-11-23 11:55:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:40,873 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-11-23 11:55:40,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:55:40,873 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-11-23 11:55:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:55:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-23 11:55:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:55:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-23 11:55:40,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 112 transitions. [2018-11-23 11:55:41,048 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 11:55:41,050 INFO L225 Difference]: With dead ends: 143 [2018-11-23 11:55:41,050 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 11:55:41,052 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 11:55:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 11:55:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-23 11:55:41,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:55:41,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2018-11-23 11:55:41,123 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 11:55:41,123 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 11:55:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:41,126 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 11:55:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 11:55:41,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:41,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:41,127 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 11:55:41,127 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 11:55:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:55:41,129 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 11:55:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 11:55:41,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:55:41,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:55:41,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:55:41,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:55:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:55:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-11-23 11:55:41,131 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 75 [2018-11-23 11:55:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:55:41,132 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-11-23 11:55:41,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:55:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 11:55:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:55:41,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:55:41,133 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 11:55:41,133 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:55:41,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:55:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash -38631668, now seen corresponding path program 15 times [2018-11-23 11:55:41,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:55:41,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:55:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:41,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:55:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:55:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:41,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {8023#true} call ULTIMATE.init(); {8023#true} is VALID [2018-11-23 11:55:41,651 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 11:55:41,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {8023#true} assume true; {8023#true} is VALID [2018-11-23 11:55:41,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8023#true} {8023#true} #87#return; {8023#true} is VALID [2018-11-23 11:55:41,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {8023#true} call #t~ret2 := main(); {8023#true} is VALID [2018-11-23 11:55:41,653 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 11:55:41,654 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 11:55:41,654 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 11:55:41,655 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 11:55:41,655 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 11:55:41,656 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 11:55:41,656 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 11:55:41,657 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 11:55:41,658 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 11:55:41,659 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 11:55:41,660 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 11:55:41,661 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 11:55:41,662 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 11:55:41,663 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 11:55:41,664 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 11:55:41,665 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 11:55:41,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {8040#(<= main_~i~0 15)} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 11:55:41,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {8024#false} ~i~0 := 0; {8024#false} is VALID [2018-11-23 11:55:41,686 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 11:55:41,687 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 11:55:41,687 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 11:55:41,687 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 11:55:41,687 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 11:55:41,687 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 11:55:41,687 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 11:55:41,688 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 11:55:41,688 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 11:55:41,688 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 11:55:41,688 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 11:55:41,688 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 11:55:41,688 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 11:55:41,689 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 11:55:41,689 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 11:55:41,689 INFO L273 TraceCheckUtils]: 38: Hoare triple {8024#false} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 11:55:41,689 INFO L273 TraceCheckUtils]: 39: Hoare triple {8024#false} ~i~0 := 0; {8024#false} is VALID [2018-11-23 11:55:41,689 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 11:55:41,689 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 11:55:41,690 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 11:55:41,690 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 11:55:41,690 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 11:55:41,690 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 11:55:41,690 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 11:55:41,690 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 11:55:41,691 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 11:55:41,691 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 11:55:41,691 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 11:55:41,691 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 11:55:41,691 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 11:55:41,691 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 11:55:41,692 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 11:55:41,692 INFO L273 TraceCheckUtils]: 55: Hoare triple {8024#false} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 11:55:41,692 INFO L273 TraceCheckUtils]: 56: Hoare triple {8024#false} ~i~0 := 0; {8024#false} is VALID [2018-11-23 11:55:41,692 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 11:55:41,692 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 11:55:41,692 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 11:55:41,693 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 11:55:41,693 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 11:55:41,693 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 11:55:41,693 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 11:55:41,693 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 11:55:41,693 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 11:55:41,693 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 11:55:41,694 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 11:55:41,694 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 11:55:41,694 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 11:55:41,694 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 11:55:41,694 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 11:55:41,694 INFO L273 TraceCheckUtils]: 72: Hoare triple {8024#false} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 11:55:41,695 INFO L273 TraceCheckUtils]: 73: Hoare triple {8024#false} havoc ~x~0;~x~0 := 0; {8024#false} is VALID [2018-11-23 11:55:41,695 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 11:55:41,695 INFO L256 TraceCheckUtils]: 75: Hoare triple {8024#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {8024#false} is VALID [2018-11-23 11:55:41,695 INFO L273 TraceCheckUtils]: 76: Hoare triple {8024#false} ~cond := #in~cond; {8024#false} is VALID [2018-11-23 11:55:41,695 INFO L273 TraceCheckUtils]: 77: Hoare triple {8024#false} assume 0 == ~cond; {8024#false} is VALID [2018-11-23 11:55:41,695 INFO L273 TraceCheckUtils]: 78: Hoare triple {8024#false} assume !false; {8024#false} is VALID [2018-11-23 11:55:41,699 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 11:55:41,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:55:41,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:55:41,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:55:59,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:55:59,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:55:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:55:59,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:55:59,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {8023#true} call ULTIMATE.init(); {8023#true} is VALID [2018-11-23 11:55:59,947 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 11:55:59,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {8023#true} assume true; {8023#true} is VALID [2018-11-23 11:55:59,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8023#true} {8023#true} #87#return; {8023#true} is VALID [2018-11-23 11:55:59,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {8023#true} call #t~ret2 := main(); {8023#true} is VALID [2018-11-23 11:55:59,948 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 11:55:59,949 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 11:55:59,949 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 11:55:59,949 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 11:55:59,949 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 11:55:59,949 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 11:55:59,949 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 11:55:59,949 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 11:55:59,950 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 11:55:59,950 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 11:55:59,950 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 11:55:59,950 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 11:55:59,950 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 11:55:59,950 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 11:55:59,950 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 11:55:59,951 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; {8104#(<= main_~i~0 100000)} is VALID [2018-11-23 11:55:59,951 INFO L273 TraceCheckUtils]: 21: Hoare triple {8104#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {8023#true} is VALID [2018-11-23 11:55:59,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {8023#true} ~i~0 := 0; {8023#true} is VALID [2018-11-23 11:55:59,951 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 11:55:59,952 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 11:55:59,952 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 11:55:59,952 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 11:55:59,952 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 11:55:59,952 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 11:55:59,952 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 11:55:59,952 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 11:55:59,952 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 11:55:59,952 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 11:55:59,953 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 11:55:59,953 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 11:55:59,953 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 11:55:59,953 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 11:55:59,954 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; {8104#(<= main_~i~0 100000)} is VALID [2018-11-23 11:55:59,954 INFO L273 TraceCheckUtils]: 38: Hoare triple {8104#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {8023#true} is VALID [2018-11-23 11:55:59,954 INFO L273 TraceCheckUtils]: 39: Hoare triple {8023#true} ~i~0 := 0; {8023#true} is VALID [2018-11-23 11:55:59,954 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 11:55:59,955 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 11:55:59,955 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 11:55:59,955 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 11:55:59,955 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 11:55:59,955 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 11:55:59,955 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 11:55:59,955 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 11:55:59,955 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 11:55:59,956 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 11:55:59,956 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 11:55:59,956 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 11:55:59,956 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 11:55:59,956 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 11:55:59,956 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 11:55:59,956 INFO L273 TraceCheckUtils]: 55: Hoare triple {8023#true} assume !(~i~0 < 100000); {8023#true} is VALID [2018-11-23 11:55:59,957 INFO L273 TraceCheckUtils]: 56: Hoare triple {8023#true} ~i~0 := 0; {8213#(<= main_~i~0 0)} is VALID [2018-11-23 11:55:59,957 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 11:55:59,958 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 11:55:59,958 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 11:55:59,959 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 11:55:59,960 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 11:55:59,960 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 11:55:59,961 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 11:55:59,962 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 11:55:59,963 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 11:55:59,964 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 11:55:59,965 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 11:55:59,966 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 11:55:59,966 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 11:55:59,967 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 11:55:59,968 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 11:55:59,969 INFO L273 TraceCheckUtils]: 72: Hoare triple {8040#(<= main_~i~0 15)} assume !(~i~0 < 100000); {8024#false} is VALID [2018-11-23 11:55:59,969 INFO L273 TraceCheckUtils]: 73: Hoare triple {8024#false} havoc ~x~0;~x~0 := 0; {8024#false} is VALID [2018-11-23 11:55:59,969 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 11:55:59,970 INFO L256 TraceCheckUtils]: 75: Hoare triple {8024#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {8024#false} is VALID [2018-11-23 11:55:59,970 INFO L273 TraceCheckUtils]: 76: Hoare triple {8024#false} ~cond := #in~cond; {8024#false} is VALID [2018-11-23 11:55:59,970 INFO L273 TraceCheckUtils]: 77: Hoare triple {8024#false} assume 0 == ~cond; {8024#false} is VALID [2018-11-23 11:55:59,970 INFO L273 TraceCheckUtils]: 78: Hoare triple {8024#false} assume !false; {8024#false} is VALID [2018-11-23 11:55:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-23 11:55:59,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:55:59,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2018-11-23 11:56:00,000 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-23 11:56:00,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:00,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:56:00,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:00,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:56:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:56:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:56:00,064 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 20 states. [2018-11-23 11:56:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:01,335 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2018-11-23 11:56:01,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:56:01,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-23 11:56:01,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:56:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 116 transitions. [2018-11-23 11:56:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:56:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 116 transitions. [2018-11-23 11:56:01,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 116 transitions. [2018-11-23 11:56:01,627 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 11:56:01,629 INFO L225 Difference]: With dead ends: 150 [2018-11-23 11:56:01,629 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:56:01,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:56:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:56:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 11:56:01,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:01,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 11:56:01,721 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 11:56:01,721 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 11:56:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:01,723 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 11:56:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 11:56:01,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:01,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:01,724 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 11:56:01,724 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 11:56:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:01,726 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 11:56:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 11:56:01,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:01,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:01,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:01,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:56:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-11-23 11:56:01,729 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 79 [2018-11-23 11:56:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:01,729 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-11-23 11:56:01,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:56:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 11:56:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:56:01,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:01,730 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 11:56:01,730 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:01,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash -523964658, now seen corresponding path program 16 times [2018-11-23 11:56:01,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:01,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:01,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:02,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {8894#true} call ULTIMATE.init(); {8894#true} is VALID [2018-11-23 11:56:02,654 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 11:56:02,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {8894#true} assume true; {8894#true} is VALID [2018-11-23 11:56:02,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8894#true} {8894#true} #87#return; {8894#true} is VALID [2018-11-23 11:56:02,655 INFO L256 TraceCheckUtils]: 4: Hoare triple {8894#true} call #t~ret2 := main(); {8894#true} is VALID [2018-11-23 11:56:02,656 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 11:56:02,657 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 11:56:02,657 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 11:56:02,658 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 11:56:02,659 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 11:56:02,659 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 11:56:02,660 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 11:56:02,661 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 11:56:02,662 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 11:56:02,663 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 11:56:02,664 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 11:56:02,665 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 11:56:02,665 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 11:56:02,666 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 11:56:02,667 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 11:56:02,668 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 11:56:02,669 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 11:56:02,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {8912#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 11:56:02,670 INFO L273 TraceCheckUtils]: 23: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 11:56:02,670 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 11:56:02,671 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 11:56:02,671 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 11:56:02,671 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 11:56:02,671 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 11:56:02,671 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 11:56:02,672 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 11:56:02,672 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 11:56:02,672 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 11:56:02,672 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 11:56:02,672 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 11:56:02,672 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 11:56:02,673 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 11:56:02,673 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 11:56:02,673 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 11:56:02,673 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 11:56:02,673 INFO L273 TraceCheckUtils]: 40: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 11:56:02,673 INFO L273 TraceCheckUtils]: 41: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 11:56:02,673 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 11:56:02,673 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 11:56:02,673 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 11:56:02,674 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 11:56:02,674 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 11:56:02,674 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 11:56:02,674 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 11:56:02,674 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 11:56:02,674 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 11:56:02,674 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 11:56:02,674 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 11:56:02,674 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 11:56:02,675 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 11:56:02,675 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 11:56:02,675 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 11:56:02,675 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 11:56:02,675 INFO L273 TraceCheckUtils]: 58: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 11:56:02,675 INFO L273 TraceCheckUtils]: 59: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 11:56:02,675 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 11:56:02,675 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 11:56:02,676 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 11:56:02,676 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 11:56:02,676 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 11:56:02,676 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 11:56:02,676 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 11:56:02,676 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 11:56:02,676 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 11:56:02,676 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 11:56:02,676 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 11:56:02,677 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 11:56:02,677 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 11:56:02,677 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 11:56:02,677 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 11:56:02,677 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 11:56:02,677 INFO L273 TraceCheckUtils]: 76: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 11:56:02,677 INFO L273 TraceCheckUtils]: 77: Hoare triple {8895#false} havoc ~x~0;~x~0 := 0; {8895#false} is VALID [2018-11-23 11:56:02,677 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 11:56:02,678 INFO L256 TraceCheckUtils]: 79: Hoare triple {8895#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {8895#false} is VALID [2018-11-23 11:56:02,678 INFO L273 TraceCheckUtils]: 80: Hoare triple {8895#false} ~cond := #in~cond; {8895#false} is VALID [2018-11-23 11:56:02,678 INFO L273 TraceCheckUtils]: 81: Hoare triple {8895#false} assume 0 == ~cond; {8895#false} is VALID [2018-11-23 11:56:02,678 INFO L273 TraceCheckUtils]: 82: Hoare triple {8895#false} assume !false; {8895#false} is VALID [2018-11-23 11:56:02,681 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 11:56:02,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:02,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:56:02,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:56:02,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:56:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:02,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:56:02,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {8894#true} call ULTIMATE.init(); {8894#true} is VALID [2018-11-23 11:56:02,955 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 11:56:02,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {8894#true} assume true; {8894#true} is VALID [2018-11-23 11:56:02,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8894#true} {8894#true} #87#return; {8894#true} is VALID [2018-11-23 11:56:02,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {8894#true} call #t~ret2 := main(); {8894#true} is VALID [2018-11-23 11:56:02,956 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 11:56:02,957 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 11:56:02,957 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 11:56:02,958 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 11:56:02,958 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 11:56:02,959 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 11:56:02,960 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 11:56:02,960 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 11:56:02,961 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 11:56:02,962 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 11:56:02,963 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 11:56:02,964 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 11:56:02,965 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 11:56:02,966 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 11:56:02,967 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 11:56:02,968 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 11:56:02,969 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 11:56:02,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {8912#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 11:56:02,970 INFO L273 TraceCheckUtils]: 23: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 11:56:02,970 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 11:56:02,970 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 11:56:02,970 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 11:56:02,970 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 11:56:02,971 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 11:56:02,971 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 11:56:02,971 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 11:56:02,971 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 11:56:02,971 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 11:56:02,972 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 11:56:02,972 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 11:56:02,972 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 11:56:02,972 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 11:56:02,972 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 11:56:02,973 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 11:56:02,973 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 11:56:02,973 INFO L273 TraceCheckUtils]: 40: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 11:56:02,974 INFO L273 TraceCheckUtils]: 41: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 11:56:02,974 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 11:56:02,974 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 11:56:02,974 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 11:56:02,974 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 11:56:02,975 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 11:56:02,975 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 11:56:02,975 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 11:56:02,975 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 11:56:02,975 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 11:56:02,975 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 11:56:02,976 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 11:56:02,976 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 11:56:02,976 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 11:56:02,976 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 11:56:02,976 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 11:56:02,976 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 11:56:02,977 INFO L273 TraceCheckUtils]: 58: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 11:56:02,977 INFO L273 TraceCheckUtils]: 59: Hoare triple {8895#false} ~i~0 := 0; {8895#false} is VALID [2018-11-23 11:56:02,977 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 11:56:02,977 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 11:56:02,977 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 11:56:02,977 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 11:56:02,977 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 11:56:02,978 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 11:56:02,978 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 11:56:02,978 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 11:56:02,978 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 11:56:02,978 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 11:56:02,978 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 11:56:02,979 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 11:56:02,979 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 11:56:02,979 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 11:56:02,979 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 11:56:02,979 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 11:56:02,979 INFO L273 TraceCheckUtils]: 76: Hoare triple {8895#false} assume !(~i~0 < 100000); {8895#false} is VALID [2018-11-23 11:56:02,980 INFO L273 TraceCheckUtils]: 77: Hoare triple {8895#false} havoc ~x~0;~x~0 := 0; {8895#false} is VALID [2018-11-23 11:56:02,980 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 11:56:02,980 INFO L256 TraceCheckUtils]: 79: Hoare triple {8895#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {8895#false} is VALID [2018-11-23 11:56:02,980 INFO L273 TraceCheckUtils]: 80: Hoare triple {8895#false} ~cond := #in~cond; {8895#false} is VALID [2018-11-23 11:56:02,980 INFO L273 TraceCheckUtils]: 81: Hoare triple {8895#false} assume 0 == ~cond; {8895#false} is VALID [2018-11-23 11:56:02,980 INFO L273 TraceCheckUtils]: 82: Hoare triple {8895#false} assume !false; {8895#false} is VALID [2018-11-23 11:56:02,984 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 11:56:03,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:56:03,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:56:03,004 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-11-23 11:56:03,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:56:03,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:56:03,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:03,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:56:03,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:56:03,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:56:03,037 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 20 states. [2018-11-23 11:56:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:03,838 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2018-11-23 11:56:03,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:56:03,838 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-11-23 11:56:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:56:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:56:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2018-11-23 11:56:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:56:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2018-11-23 11:56:03,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 120 transitions. [2018-11-23 11:56:03,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:56:03,991 INFO L225 Difference]: With dead ends: 157 [2018-11-23 11:56:03,991 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 11:56:03,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:56:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 11:56:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 11:56:04,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:56:04,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-23 11:56:04,051 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 11:56:04,051 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 11:56:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:04,054 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 11:56:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 11:56:04,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:04,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:04,054 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 11:56:04,055 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 11:56:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:56:04,056 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 11:56:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 11:56:04,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:56:04,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:56:04,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:56:04,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:56:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 11:56:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-23 11:56:04,058 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 83 [2018-11-23 11:56:04,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:56:04,059 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-23 11:56:04,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:56:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 11:56:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 11:56:04,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:56:04,060 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 11:56:04,060 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:56:04,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:56:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1688235596, now seen corresponding path program 17 times [2018-11-23 11:56:04,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:56:04,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:56:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:04,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:56:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:56:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:56:04,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {9807#true} call ULTIMATE.init(); {9807#true} is VALID [2018-11-23 11:56:04,574 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 11:56:04,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {9807#true} assume true; {9807#true} is VALID [2018-11-23 11:56:04,574 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9807#true} {9807#true} #87#return; {9807#true} is VALID [2018-11-23 11:56:04,574 INFO L256 TraceCheckUtils]: 4: Hoare triple {9807#true} call #t~ret2 := main(); {9807#true} is VALID [2018-11-23 11:56:04,575 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 11:56:04,576 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 11:56:04,576 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 11:56:04,577 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 11:56:04,578 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 11:56:04,579 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 11:56:04,580 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 11:56:04,581 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 11:56:04,582 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 11:56:04,583 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 11:56:04,584 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 11:56:04,585 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 11:56:04,586 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 11:56:04,587 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 11:56:04,588 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 11:56:04,589 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 11:56:04,589 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 11:56:04,590 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 11:56:04,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {9826#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 11:56:04,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 11:56:04,592 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 11:56:04,592 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 11:56:04,592 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 11:56:04,592 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 11:56:04,592 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 11:56:04,593 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 11:56:04,593 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 11:56:04,593 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 11:56:04,593 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 11:56:04,593 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 11:56:04,594 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 11:56:04,594 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 11:56:04,594 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 11:56:04,594 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 11:56:04,594 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 11:56:04,595 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 11:56:04,595 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 11:56:04,595 INFO L273 TraceCheckUtils]: 42: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 11:56:04,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 11:56:04,595 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 11:56:04,595 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 11:56:04,595 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 11:56:04,596 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 11:56:04,596 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 11:56:04,596 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 11:56:04,596 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 11:56:04,596 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 11:56:04,596 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 11:56:04,596 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 11:56:04,596 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 11:56:04,597 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 11:56:04,597 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 11:56:04,597 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 11:56:04,597 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 11:56:04,597 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 11:56:04,597 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 11:56:04,597 INFO L273 TraceCheckUtils]: 61: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 11:56:04,597 INFO L273 TraceCheckUtils]: 62: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 11:56:04,597 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 11:56:04,598 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 11:56:04,598 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 11:56:04,598 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 11:56:04,598 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 11:56:04,598 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 11:56:04,598 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 11:56:04,598 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 11:56:04,598 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 11:56:04,598 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 11:56:04,599 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 11:56:04,599 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 11:56:04,599 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 11:56:04,599 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 11:56:04,599 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 11:56:04,599 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 11:56:04,599 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 11:56:04,599 INFO L273 TraceCheckUtils]: 80: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 11:56:04,599 INFO L273 TraceCheckUtils]: 81: Hoare triple {9808#false} havoc ~x~0;~x~0 := 0; {9808#false} is VALID [2018-11-23 11:56:04,600 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 11:56:04,600 INFO L256 TraceCheckUtils]: 83: Hoare triple {9808#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {9808#false} is VALID [2018-11-23 11:56:04,600 INFO L273 TraceCheckUtils]: 84: Hoare triple {9808#false} ~cond := #in~cond; {9808#false} is VALID [2018-11-23 11:56:04,600 INFO L273 TraceCheckUtils]: 85: Hoare triple {9808#false} assume 0 == ~cond; {9808#false} is VALID [2018-11-23 11:56:04,600 INFO L273 TraceCheckUtils]: 86: Hoare triple {9808#false} assume !false; {9808#false} is VALID [2018-11-23 11:56:04,603 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 11:56:04,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:56:04,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:56:04,613 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:57:01,491 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 11:57:01,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:01,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:01,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {9807#true} call ULTIMATE.init(); {9807#true} is VALID [2018-11-23 11:57:01,754 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 11:57:01,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {9807#true} assume true; {9807#true} is VALID [2018-11-23 11:57:01,755 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9807#true} {9807#true} #87#return; {9807#true} is VALID [2018-11-23 11:57:01,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {9807#true} call #t~ret2 := main(); {9807#true} is VALID [2018-11-23 11:57:01,756 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 11:57:01,757 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 11:57:01,757 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 11:57:01,758 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 11:57:01,759 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 11:57:01,759 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 11:57:01,760 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 11:57:01,761 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 11:57:01,762 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 11:57:01,763 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 11:57:01,764 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 11:57:01,765 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 11:57:01,766 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 11:57:01,767 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 11:57:01,768 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 11:57:01,769 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 11:57:01,769 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 11:57:01,770 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 11:57:01,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {9826#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 11:57:01,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 11:57:01,772 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 11:57:01,772 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 11:57:01,772 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 11:57:01,772 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 11:57:01,772 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 11:57:01,773 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 11:57:01,773 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 11:57:01,773 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 11:57:01,773 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 11:57:01,773 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 11:57:01,773 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 11:57:01,774 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 11:57:01,774 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 11:57:01,774 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 11:57:01,774 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 11:57:01,774 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 11:57:01,775 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 11:57:01,775 INFO L273 TraceCheckUtils]: 42: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 11:57:01,775 INFO L273 TraceCheckUtils]: 43: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 11:57:01,775 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 11:57:01,775 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 11:57:01,776 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 11:57:01,776 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 11:57:01,776 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 11:57:01,776 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 11:57:01,776 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 11:57:01,777 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 11:57:01,777 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 11:57:01,777 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 11:57:01,777 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 11:57:01,777 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 11:57:01,777 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 11:57:01,778 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 11:57:01,778 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 11:57:01,778 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 11:57:01,778 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 11:57:01,778 INFO L273 TraceCheckUtils]: 61: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 11:57:01,778 INFO L273 TraceCheckUtils]: 62: Hoare triple {9808#false} ~i~0 := 0; {9808#false} is VALID [2018-11-23 11:57:01,778 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 11:57:01,778 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 11:57:01,778 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 11:57:01,779 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 11:57:01,779 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 11:57:01,779 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 11:57:01,779 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 11:57:01,779 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 11:57:01,779 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 11:57:01,779 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 11:57:01,779 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 11:57:01,779 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 11:57:01,780 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 11:57:01,780 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 11:57:01,780 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 11:57:01,780 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 11:57:01,780 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 11:57:01,780 INFO L273 TraceCheckUtils]: 80: Hoare triple {9808#false} assume !(~i~0 < 100000); {9808#false} is VALID [2018-11-23 11:57:01,780 INFO L273 TraceCheckUtils]: 81: Hoare triple {9808#false} havoc ~x~0;~x~0 := 0; {9808#false} is VALID [2018-11-23 11:57:01,780 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 11:57:01,780 INFO L256 TraceCheckUtils]: 83: Hoare triple {9808#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {9808#false} is VALID [2018-11-23 11:57:01,781 INFO L273 TraceCheckUtils]: 84: Hoare triple {9808#false} ~cond := #in~cond; {9808#false} is VALID [2018-11-23 11:57:01,781 INFO L273 TraceCheckUtils]: 85: Hoare triple {9808#false} assume 0 == ~cond; {9808#false} is VALID [2018-11-23 11:57:01,781 INFO L273 TraceCheckUtils]: 86: Hoare triple {9808#false} assume !false; {9808#false} is VALID [2018-11-23 11:57:01,784 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 11:57:01,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:01,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:57:01,816 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-11-23 11:57:01,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:01,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:57:01,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:01,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:57:01,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:57:01,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:57:01,856 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 21 states. [2018-11-23 11:57:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:02,538 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-11-23 11:57:02,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:57:02,539 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-11-23 11:57:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:57:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2018-11-23 11:57:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:57:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2018-11-23 11:57:02,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 124 transitions. [2018-11-23 11:57:02,673 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 11:57:02,675 INFO L225 Difference]: With dead ends: 164 [2018-11-23 11:57:02,675 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 11:57:02,675 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 11:57:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 11:57:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-23 11:57:02,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:02,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-23 11:57:02,792 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 11:57:02,792 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 11:57:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:02,795 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 11:57:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 11:57:02,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:02,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:02,796 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 11:57:02,796 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 11:57:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:02,797 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 11:57:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 11:57:02,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:02,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:02,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:02,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:57:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-11-23 11:57:02,800 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 87 [2018-11-23 11:57:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:02,800 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-23 11:57:02,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:57:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 11:57:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:57:02,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:02,802 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 11:57:02,802 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:02,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:02,802 INFO L82 PathProgramCache]: Analyzing trace with hash 721612110, now seen corresponding path program 18 times [2018-11-23 11:57:02,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:02,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:02,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:02,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:02,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:03,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {10763#true} call ULTIMATE.init(); {10763#true} is VALID [2018-11-23 11:57:03,298 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 11:57:03,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {10763#true} assume true; {10763#true} is VALID [2018-11-23 11:57:03,298 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10763#true} {10763#true} #87#return; {10763#true} is VALID [2018-11-23 11:57:03,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {10763#true} call #t~ret2 := main(); {10763#true} is VALID [2018-11-23 11:57:03,299 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 11:57:03,300 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 11:57:03,301 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 11:57:03,302 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 11:57:03,303 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 11:57:03,304 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 11:57:03,304 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 11:57:03,305 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 11:57:03,306 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 11:57:03,307 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 11:57:03,308 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 11:57:03,309 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 11:57:03,310 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 11:57:03,311 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 11:57:03,312 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 11:57:03,313 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 11:57:03,314 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 11:57:03,315 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 11:57:03,316 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 11:57:03,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {10783#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 11:57:03,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 11:57:03,317 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 11:57:03,317 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 11:57:03,317 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 11:57:03,317 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 11:57:03,317 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 11:57:03,318 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 11:57:03,318 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 11:57:03,318 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 11:57:03,318 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 11:57:03,318 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 11:57:03,319 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 11:57:03,319 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 11:57:03,319 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 11:57:03,319 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 11:57:03,319 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 11:57:03,319 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 11:57:03,319 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 11:57:03,320 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 11:57:03,320 INFO L273 TraceCheckUtils]: 44: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 11:57:03,320 INFO L273 TraceCheckUtils]: 45: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 11:57:03,320 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 11:57:03,320 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 11:57:03,320 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 11:57:03,320 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 11:57:03,320 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 11:57:03,321 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 11:57:03,321 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 11:57:03,321 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 11:57:03,321 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 11:57:03,321 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 11:57:03,321 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 11:57:03,321 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 11:57:03,321 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 11:57:03,321 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 11:57:03,322 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 11:57:03,322 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 11:57:03,322 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 11:57:03,322 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 11:57:03,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 11:57:03,322 INFO L273 TraceCheckUtils]: 65: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 11:57:03,322 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 11:57:03,322 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 11:57:03,322 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 11:57:03,323 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 11:57:03,323 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 11:57:03,323 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 11:57:03,323 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 11:57:03,323 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 11:57:03,323 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 11:57:03,323 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 11:57:03,323 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 11:57:03,324 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 11:57:03,324 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 11:57:03,324 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 11:57:03,324 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 11:57:03,324 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 11:57:03,324 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 11:57:03,324 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 11:57:03,324 INFO L273 TraceCheckUtils]: 84: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 11:57:03,324 INFO L273 TraceCheckUtils]: 85: Hoare triple {10764#false} havoc ~x~0;~x~0 := 0; {10764#false} is VALID [2018-11-23 11:57:03,325 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 11:57:03,325 INFO L256 TraceCheckUtils]: 87: Hoare triple {10764#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {10764#false} is VALID [2018-11-23 11:57:03,325 INFO L273 TraceCheckUtils]: 88: Hoare triple {10764#false} ~cond := #in~cond; {10764#false} is VALID [2018-11-23 11:57:03,325 INFO L273 TraceCheckUtils]: 89: Hoare triple {10764#false} assume 0 == ~cond; {10764#false} is VALID [2018-11-23 11:57:03,325 INFO L273 TraceCheckUtils]: 90: Hoare triple {10764#false} assume !false; {10764#false} is VALID [2018-11-23 11:57:03,329 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 11:57:03,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:03,329 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 11:57:03,337 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:57:57,331 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 11:57:57,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:57:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:57,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:57,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {10763#true} call ULTIMATE.init(); {10763#true} is VALID [2018-11-23 11:57:57,530 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 11:57:57,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {10763#true} assume true; {10763#true} is VALID [2018-11-23 11:57:57,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10763#true} {10763#true} #87#return; {10763#true} is VALID [2018-11-23 11:57:57,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {10763#true} call #t~ret2 := main(); {10763#true} is VALID [2018-11-23 11:57:57,532 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 11:57:57,532 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 11:57:57,533 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 11:57:57,533 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 11:57:57,534 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 11:57:57,535 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 11:57:57,536 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 11:57:57,537 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 11:57:57,538 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 11:57:57,539 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 11:57:57,540 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 11:57:57,541 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 11:57:57,542 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 11:57:57,543 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 11:57:57,543 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 11:57:57,544 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 11:57:57,545 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 11:57:57,546 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 11:57:57,547 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 11:57:57,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {10783#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 11:57:57,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 11:57:57,548 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 11:57:57,549 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 11:57:57,549 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 11:57:57,549 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 11:57:57,549 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 11:57:57,549 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 11:57:57,550 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 11:57:57,550 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 11:57:57,550 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 11:57:57,550 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 11:57:57,550 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 11:57:57,551 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 11:57:57,551 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 11:57:57,551 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 11:57:57,551 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 11:57:57,551 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 11:57:57,552 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 11:57:57,552 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 11:57:57,552 INFO L273 TraceCheckUtils]: 44: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 11:57:57,552 INFO L273 TraceCheckUtils]: 45: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 11:57:57,552 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 11:57:57,553 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 11:57:57,553 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 11:57:57,553 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 11:57:57,553 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 11:57:57,553 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 11:57:57,553 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 11:57:57,553 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 11:57:57,553 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 11:57:57,553 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 11:57:57,554 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 11:57:57,554 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 11:57:57,554 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 11:57:57,554 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 11:57:57,554 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 11:57:57,554 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 11:57:57,554 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 11:57:57,554 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 11:57:57,555 INFO L273 TraceCheckUtils]: 64: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 11:57:57,555 INFO L273 TraceCheckUtils]: 65: Hoare triple {10764#false} ~i~0 := 0; {10764#false} is VALID [2018-11-23 11:57:57,555 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 11:57:57,555 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 11:57:57,555 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 11:57:57,555 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 11:57:57,555 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 11:57:57,555 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 11:57:57,555 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 11:57:57,556 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 11:57:57,556 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 11:57:57,556 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 11:57:57,556 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 11:57:57,556 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 11:57:57,556 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 11:57:57,556 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 11:57:57,556 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 11:57:57,556 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 11:57:57,557 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 11:57:57,557 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 11:57:57,557 INFO L273 TraceCheckUtils]: 84: Hoare triple {10764#false} assume !(~i~0 < 100000); {10764#false} is VALID [2018-11-23 11:57:57,557 INFO L273 TraceCheckUtils]: 85: Hoare triple {10764#false} havoc ~x~0;~x~0 := 0; {10764#false} is VALID [2018-11-23 11:57:57,557 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 11:57:57,557 INFO L256 TraceCheckUtils]: 87: Hoare triple {10764#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {10764#false} is VALID [2018-11-23 11:57:57,557 INFO L273 TraceCheckUtils]: 88: Hoare triple {10764#false} ~cond := #in~cond; {10764#false} is VALID [2018-11-23 11:57:57,557 INFO L273 TraceCheckUtils]: 89: Hoare triple {10764#false} assume 0 == ~cond; {10764#false} is VALID [2018-11-23 11:57:57,558 INFO L273 TraceCheckUtils]: 90: Hoare triple {10764#false} assume !false; {10764#false} is VALID [2018-11-23 11:57:57,561 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 11:57:57,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:57,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:57:57,590 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 91 [2018-11-23 11:57:57,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:57,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:57:57,621 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 11:57:57,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:57:57,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:57:57,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:57:57,622 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 22 states. [2018-11-23 11:57:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:58,400 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-11-23 11:57:58,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:57:58,401 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 91 [2018-11-23 11:57:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:57:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:57:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 128 transitions. [2018-11-23 11:57:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:57:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 128 transitions. [2018-11-23 11:57:58,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 128 transitions. [2018-11-23 11:57:58,560 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 11:57:58,562 INFO L225 Difference]: With dead ends: 171 [2018-11-23 11:57:58,562 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 11:57:58,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:57:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 11:57:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-23 11:57:58,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:57:58,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 100 states. [2018-11-23 11:57:58,636 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 11:57:58,636 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 11:57:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:58,638 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-11-23 11:57:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-23 11:57:58,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:58,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:58,638 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 100 states. [2018-11-23 11:57:58,639 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 100 states. [2018-11-23 11:57:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:57:58,640 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-11-23 11:57:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-23 11:57:58,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:57:58,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:57:58,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:57:58,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:57:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 11:57:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-23 11:57:58,642 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 91 [2018-11-23 11:57:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:57:58,642 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-23 11:57:58,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:57:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-23 11:57:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 11:57:58,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:57:58,643 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 11:57:58,643 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:57:58,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:57:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash -733207156, now seen corresponding path program 19 times [2018-11-23 11:57:58,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:57:58,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:57:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:58,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:57:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:57:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:59,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {11762#true} call ULTIMATE.init(); {11762#true} is VALID [2018-11-23 11:57:59,297 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 11:57:59,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {11762#true} assume true; {11762#true} is VALID [2018-11-23 11:57:59,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11762#true} {11762#true} #87#return; {11762#true} is VALID [2018-11-23 11:57:59,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {11762#true} call #t~ret2 := main(); {11762#true} is VALID [2018-11-23 11:57:59,298 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 11:57:59,299 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 11:57:59,300 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 11:57:59,300 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 11:57:59,301 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 11:57:59,301 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 11:57:59,302 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 11:57:59,303 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 11:57:59,303 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 11:57:59,304 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 11:57:59,305 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 11:57:59,306 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 11:57:59,307 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 11:57:59,308 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 11:57:59,309 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 11:57:59,310 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 11:57:59,311 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 11:57:59,312 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 11:57:59,313 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 11:57:59,314 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 11:57:59,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {11783#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 11:57:59,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 11:57:59,315 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 11:57:59,315 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 11:57:59,315 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 11:57:59,316 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 11:57:59,316 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 11:57:59,316 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 11:57:59,316 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 11:57:59,316 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 11:57:59,317 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 11:57:59,317 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 11:57:59,317 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 11:57:59,317 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 11:57:59,317 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 11:57:59,318 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 11:57:59,318 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 11:57:59,318 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 11:57:59,318 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 11:57:59,318 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 11:57:59,319 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 11:57:59,319 INFO L273 TraceCheckUtils]: 46: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 11:57:59,319 INFO L273 TraceCheckUtils]: 47: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 11:57:59,319 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 11:57:59,319 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 11:57:59,320 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 11:57:59,320 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 11:57:59,320 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 11:57:59,320 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 11:57:59,320 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 11:57:59,320 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 11:57:59,320 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 11:57:59,320 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 11:57:59,321 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 11:57:59,321 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 11:57:59,321 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 11:57:59,321 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 11:57:59,321 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 11:57:59,321 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 11:57:59,321 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 11:57:59,321 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 11:57:59,322 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 11:57:59,322 INFO L273 TraceCheckUtils]: 67: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 11:57:59,322 INFO L273 TraceCheckUtils]: 68: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 11:57:59,322 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 11:57:59,322 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 11:57:59,322 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 11:57:59,322 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 11:57:59,322 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 11:57:59,322 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 11:57:59,323 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 11:57:59,323 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 11:57:59,323 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 11:57:59,323 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 11:57:59,323 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 11:57:59,323 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 11:57:59,323 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 11:57:59,323 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 11:57:59,323 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 11:57:59,324 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 11:57:59,324 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 11:57:59,324 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 11:57:59,324 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 11:57:59,324 INFO L273 TraceCheckUtils]: 88: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 11:57:59,324 INFO L273 TraceCheckUtils]: 89: Hoare triple {11763#false} havoc ~x~0;~x~0 := 0; {11763#false} is VALID [2018-11-23 11:57:59,324 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 11:57:59,324 INFO L256 TraceCheckUtils]: 91: Hoare triple {11763#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {11763#false} is VALID [2018-11-23 11:57:59,324 INFO L273 TraceCheckUtils]: 92: Hoare triple {11763#false} ~cond := #in~cond; {11763#false} is VALID [2018-11-23 11:57:59,325 INFO L273 TraceCheckUtils]: 93: Hoare triple {11763#false} assume 0 == ~cond; {11763#false} is VALID [2018-11-23 11:57:59,325 INFO L273 TraceCheckUtils]: 94: Hoare triple {11763#false} assume !false; {11763#false} is VALID [2018-11-23 11:57:59,329 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 11:57:59,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:57:59,329 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 11:57:59,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:57:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:57:59,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:57:59,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {11762#true} call ULTIMATE.init(); {11762#true} is VALID [2018-11-23 11:57:59,589 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 11:57:59,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {11762#true} assume true; {11762#true} is VALID [2018-11-23 11:57:59,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11762#true} {11762#true} #87#return; {11762#true} is VALID [2018-11-23 11:57:59,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {11762#true} call #t~ret2 := main(); {11762#true} is VALID [2018-11-23 11:57:59,590 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 11:57:59,591 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 11:57:59,592 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 11:57:59,593 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 11:57:59,593 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 11:57:59,594 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 11:57:59,594 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 11:57:59,595 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 11:57:59,596 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 11:57:59,597 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 11:57:59,598 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 11:57:59,599 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 11:57:59,600 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 11:57:59,601 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 11:57:59,602 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 11:57:59,602 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 11:57:59,603 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 11:57:59,604 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 11:57:59,605 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 11:57:59,606 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 11:57:59,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {11783#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 11:57:59,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 11:57:59,607 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 11:57:59,608 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 11:57:59,608 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 11:57:59,608 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 11:57:59,608 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 11:57:59,608 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 11:57:59,609 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 11:57:59,609 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 11:57:59,609 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 11:57:59,609 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 11:57:59,609 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 11:57:59,610 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 11:57:59,610 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 11:57:59,610 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 11:57:59,610 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 11:57:59,610 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 11:57:59,611 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 11:57:59,611 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 11:57:59,611 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 11:57:59,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 11:57:59,611 INFO L273 TraceCheckUtils]: 47: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 11:57:59,611 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 11:57:59,611 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 11:57:59,611 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 11:57:59,611 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 11:57:59,612 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 11:57:59,612 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 11:57:59,612 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 11:57:59,612 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 11:57:59,612 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 11:57:59,612 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 11:57:59,612 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 11:57:59,612 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 11:57:59,612 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 11:57:59,613 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 11:57:59,613 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 11:57:59,613 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 11:57:59,613 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 11:57:59,613 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 11:57:59,613 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 11:57:59,613 INFO L273 TraceCheckUtils]: 67: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 11:57:59,613 INFO L273 TraceCheckUtils]: 68: Hoare triple {11763#false} ~i~0 := 0; {11763#false} is VALID [2018-11-23 11:57:59,614 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 11:57:59,614 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 11:57:59,614 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 11:57:59,614 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 11:57:59,614 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 11:57:59,614 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 11:57:59,614 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 11:57:59,614 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 11:57:59,614 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 11:57:59,615 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 11:57:59,615 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 11:57:59,615 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 11:57:59,615 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 11:57:59,615 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 11:57:59,615 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 11:57:59,615 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 11:57:59,615 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 11:57:59,616 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 11:57:59,616 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 11:57:59,616 INFO L273 TraceCheckUtils]: 88: Hoare triple {11763#false} assume !(~i~0 < 100000); {11763#false} is VALID [2018-11-23 11:57:59,616 INFO L273 TraceCheckUtils]: 89: Hoare triple {11763#false} havoc ~x~0;~x~0 := 0; {11763#false} is VALID [2018-11-23 11:57:59,616 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 11:57:59,616 INFO L256 TraceCheckUtils]: 91: Hoare triple {11763#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {11763#false} is VALID [2018-11-23 11:57:59,616 INFO L273 TraceCheckUtils]: 92: Hoare triple {11763#false} ~cond := #in~cond; {11763#false} is VALID [2018-11-23 11:57:59,616 INFO L273 TraceCheckUtils]: 93: Hoare triple {11763#false} assume 0 == ~cond; {11763#false} is VALID [2018-11-23 11:57:59,616 INFO L273 TraceCheckUtils]: 94: Hoare triple {11763#false} assume !false; {11763#false} is VALID [2018-11-23 11:57:59,620 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 11:57:59,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:57:59,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:57:59,641 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2018-11-23 11:57:59,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:57:59,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:57:59,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:57:59,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:57:59,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:57:59,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:57:59,680 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 23 states. [2018-11-23 11:58:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:00,495 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-11-23 11:58:00,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:58:00,495 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 95 [2018-11-23 11:58:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:58:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 132 transitions. [2018-11-23 11:58:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:58:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 132 transitions. [2018-11-23 11:58:00,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 132 transitions. [2018-11-23 11:58:00,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:00,639 INFO L225 Difference]: With dead ends: 178 [2018-11-23 11:58:00,639 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:58:00,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:58:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:58:00,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-23 11:58:00,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:00,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 104 states. [2018-11-23 11:58:00,715 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-23 11:58:00,715 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-23 11:58:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:00,717 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-11-23 11:58:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-23 11:58:00,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:00,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:00,717 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states. [2018-11-23 11:58:00,717 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states. [2018-11-23 11:58:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:00,719 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-11-23 11:58:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-23 11:58:00,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:00,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:00,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:00,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:58:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-11-23 11:58:00,722 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 95 [2018-11-23 11:58:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:00,722 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-11-23 11:58:00,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:58:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-23 11:58:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 11:58:00,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:00,723 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 11:58:00,723 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:00,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash -585802866, now seen corresponding path program 20 times [2018-11-23 11:58:00,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:00,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:00,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:01,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {12804#true} call ULTIMATE.init(); {12804#true} is VALID [2018-11-23 11:58:01,115 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 11:58:01,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {12804#true} assume true; {12804#true} is VALID [2018-11-23 11:58:01,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12804#true} {12804#true} #87#return; {12804#true} is VALID [2018-11-23 11:58:01,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {12804#true} call #t~ret2 := main(); {12804#true} is VALID [2018-11-23 11:58:01,115 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 11:58:01,116 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 11:58:01,116 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 11:58:01,117 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 11:58:01,118 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 11:58:01,119 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 11:58:01,120 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 11:58:01,120 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 11:58:01,121 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 11:58:01,122 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 11:58:01,123 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 11:58:01,124 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 11:58:01,125 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 11:58:01,126 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 11:58:01,127 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 11:58:01,128 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 11:58:01,129 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 11:58:01,130 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 11:58:01,131 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 11:58:01,132 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 11:58:01,133 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 11:58:01,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {12826#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 11:58:01,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 11:58:01,134 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 11:58:01,134 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 11:58:01,134 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 11:58:01,134 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 11:58:01,135 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 11:58:01,135 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 11:58:01,135 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 11:58:01,135 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 11:58:01,135 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 11:58:01,136 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 11:58:01,136 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 11:58:01,136 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 11:58:01,136 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 11:58:01,136 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 11:58:01,137 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 11:58:01,137 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 11:58:01,137 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 11:58:01,137 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 11:58:01,137 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 11:58:01,137 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 11:58:01,138 INFO L273 TraceCheckUtils]: 48: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 11:58:01,138 INFO L273 TraceCheckUtils]: 49: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 11:58:01,138 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 11:58:01,138 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 11:58:01,138 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 11:58:01,139 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 11:58:01,139 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 11:58:01,139 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 11:58:01,139 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 11:58:01,139 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 11:58:01,139 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 11:58:01,139 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 11:58:01,139 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 11:58:01,139 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 11:58:01,140 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 11:58:01,140 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 11:58:01,140 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 11:58:01,140 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 11:58:01,140 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 11:58:01,140 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 11:58:01,140 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 11:58:01,140 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 11:58:01,141 INFO L273 TraceCheckUtils]: 70: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 11:58:01,141 INFO L273 TraceCheckUtils]: 71: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 11:58:01,141 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 11:58:01,141 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 11:58:01,141 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 11:58:01,141 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 11:58:01,141 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 11:58:01,141 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 11:58:01,141 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 11:58:01,142 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 11:58:01,142 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 11:58:01,142 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 11:58:01,142 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 11:58:01,142 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 11:58:01,142 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 11:58:01,142 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 11:58:01,142 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 11:58:01,142 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 11:58:01,143 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 11:58:01,143 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 11:58:01,143 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 11:58:01,143 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 11:58:01,143 INFO L273 TraceCheckUtils]: 92: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 11:58:01,143 INFO L273 TraceCheckUtils]: 93: Hoare triple {12805#false} havoc ~x~0;~x~0 := 0; {12805#false} is VALID [2018-11-23 11:58:01,143 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 11:58:01,143 INFO L256 TraceCheckUtils]: 95: Hoare triple {12805#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {12805#false} is VALID [2018-11-23 11:58:01,144 INFO L273 TraceCheckUtils]: 96: Hoare triple {12805#false} ~cond := #in~cond; {12805#false} is VALID [2018-11-23 11:58:01,144 INFO L273 TraceCheckUtils]: 97: Hoare triple {12805#false} assume 0 == ~cond; {12805#false} is VALID [2018-11-23 11:58:01,144 INFO L273 TraceCheckUtils]: 98: Hoare triple {12805#false} assume !false; {12805#false} is VALID [2018-11-23 11:58:01,148 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 11:58:01,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:01,148 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 11:58:01,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:01,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:01,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:01,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:01,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {12804#true} call ULTIMATE.init(); {12804#true} is VALID [2018-11-23 11:58:01,628 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 11:58:01,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {12804#true} assume true; {12804#true} is VALID [2018-11-23 11:58:01,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12804#true} {12804#true} #87#return; {12804#true} is VALID [2018-11-23 11:58:01,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {12804#true} call #t~ret2 := main(); {12804#true} is VALID [2018-11-23 11:58:01,629 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 11:58:01,631 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 11:58:01,631 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 11:58:01,632 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 11:58:01,634 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 11:58:01,635 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 11:58:01,636 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 11:58:01,637 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 11:58:01,638 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 11:58:01,639 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 11:58:01,639 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 11:58:01,640 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 11:58:01,641 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 11:58:01,642 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 11:58:01,644 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 11:58:01,645 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 11:58:01,646 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 11:58:01,647 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 11:58:01,650 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 11:58:01,651 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 11:58:01,652 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 11:58:01,654 INFO L273 TraceCheckUtils]: 26: Hoare triple {12826#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 11:58:01,654 INFO L273 TraceCheckUtils]: 27: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 11:58:01,654 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 11:58:01,654 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 11:58:01,654 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 11:58:01,654 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 11:58:01,654 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 11:58:01,655 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 11:58:01,655 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 11:58:01,655 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 11:58:01,655 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 11:58:01,655 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 11:58:01,655 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 11:58:01,655 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 11:58:01,655 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 11:58:01,655 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 11:58:01,656 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 11:58:01,656 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 11:58:01,656 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 11:58:01,656 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 11:58:01,656 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 11:58:01,656 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 11:58:01,656 INFO L273 TraceCheckUtils]: 48: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 11:58:01,656 INFO L273 TraceCheckUtils]: 49: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 11:58:01,656 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 11:58:01,657 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 11:58:01,657 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 11:58:01,657 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 11:58:01,657 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 11:58:01,657 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 11:58:01,657 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 11:58:01,657 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 11:58:01,657 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 11:58:01,658 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 11:58:01,658 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 11:58:01,658 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 11:58:01,658 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 11:58:01,658 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 11:58:01,658 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 11:58:01,658 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 11:58:01,658 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 11:58:01,658 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 11:58:01,659 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 11:58:01,659 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 11:58:01,659 INFO L273 TraceCheckUtils]: 70: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 11:58:01,659 INFO L273 TraceCheckUtils]: 71: Hoare triple {12805#false} ~i~0 := 0; {12805#false} is VALID [2018-11-23 11:58:01,659 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 11:58:01,659 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 11:58:01,659 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 11:58:01,659 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 11:58:01,659 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 11:58:01,660 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 11:58:01,660 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 11:58:01,660 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 11:58:01,660 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 11:58:01,660 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 11:58:01,660 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 11:58:01,660 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 11:58:01,660 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 11:58:01,660 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 11:58:01,661 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 11:58:01,661 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 11:58:01,661 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 11:58:01,661 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 11:58:01,661 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 11:58:01,661 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 11:58:01,661 INFO L273 TraceCheckUtils]: 92: Hoare triple {12805#false} assume !(~i~0 < 100000); {12805#false} is VALID [2018-11-23 11:58:01,661 INFO L273 TraceCheckUtils]: 93: Hoare triple {12805#false} havoc ~x~0;~x~0 := 0; {12805#false} is VALID [2018-11-23 11:58:01,662 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 11:58:01,662 INFO L256 TraceCheckUtils]: 95: Hoare triple {12805#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {12805#false} is VALID [2018-11-23 11:58:01,662 INFO L273 TraceCheckUtils]: 96: Hoare triple {12805#false} ~cond := #in~cond; {12805#false} is VALID [2018-11-23 11:58:01,662 INFO L273 TraceCheckUtils]: 97: Hoare triple {12805#false} assume 0 == ~cond; {12805#false} is VALID [2018-11-23 11:58:01,662 INFO L273 TraceCheckUtils]: 98: Hoare triple {12805#false} assume !false; {12805#false} is VALID [2018-11-23 11:58:01,666 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 11:58:01,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:01,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 11:58:01,687 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2018-11-23 11:58:01,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:01,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:58:01,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:01,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:58:01,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:58:01,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:58:01,731 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 24 states. [2018-11-23 11:58:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:04,241 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2018-11-23 11:58:04,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:58:04,242 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2018-11-23 11:58:04,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:58:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 136 transitions. [2018-11-23 11:58:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:58:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 136 transitions. [2018-11-23 11:58:04,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 136 transitions. [2018-11-23 11:58:04,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:04,655 INFO L225 Difference]: With dead ends: 185 [2018-11-23 11:58:04,655 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 11:58:04,656 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 11:58:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 11:58:04,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-23 11:58:04,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:04,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 108 states. [2018-11-23 11:58:04,750 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2018-11-23 11:58:04,751 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2018-11-23 11:58:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:04,753 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 11:58:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 11:58:04,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:04,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:04,753 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2018-11-23 11:58:04,753 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2018-11-23 11:58:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:04,755 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 11:58:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 11:58:04,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:04,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:04,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:04,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 11:58:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-11-23 11:58:04,757 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 99 [2018-11-23 11:58:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:04,757 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-11-23 11:58:04,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:58:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 11:58:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:58:04,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:04,758 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 11:58:04,758 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:04,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:04,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1797411636, now seen corresponding path program 21 times [2018-11-23 11:58:04,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:04,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:04,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:04,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:04,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:05,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {13889#true} call ULTIMATE.init(); {13889#true} is VALID [2018-11-23 11:58:05,765 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 11:58:05,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {13889#true} assume true; {13889#true} is VALID [2018-11-23 11:58:05,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13889#true} {13889#true} #87#return; {13889#true} is VALID [2018-11-23 11:58:05,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {13889#true} call #t~ret2 := main(); {13889#true} is VALID [2018-11-23 11:58:05,766 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 11:58:05,767 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 11:58:05,768 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 11:58:05,768 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 11:58:05,769 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 11:58:05,770 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 11:58:05,770 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 11:58:05,771 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 11:58:05,772 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 11:58:05,773 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 11:58:05,774 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 11:58:05,775 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 11:58:05,776 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 11:58:05,777 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 11:58:05,778 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 11:58:05,779 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 11:58:05,780 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 11:58:05,781 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 11:58:05,782 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 11:58:05,783 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 11:58:05,784 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 11:58:05,785 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 11:58:05,785 INFO L273 TraceCheckUtils]: 27: Hoare triple {13912#(<= main_~i~0 21)} assume !(~i~0 < 100000); {13890#false} is VALID [2018-11-23 11:58:05,786 INFO L273 TraceCheckUtils]: 28: Hoare triple {13890#false} ~i~0 := 0; {13890#false} is VALID [2018-11-23 11:58:05,786 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 11:58:05,786 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 11:58:05,786 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 11:58:05,786 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 11:58:05,787 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 11:58:05,787 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 11:58:05,787 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 11:58:05,787 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 11:58:05,787 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 11:58:05,788 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 11:58:05,788 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 11:58:05,788 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 11:58:05,788 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 11:58:05,788 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 11:58:05,788 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 11:58:05,788 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 11:58:05,789 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 11:58:05,789 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 11:58:05,789 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 11:58:05,789 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 11:58:05,789 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 11:58:05,789 INFO L273 TraceCheckUtils]: 50: Hoare triple {13890#false} assume !(~i~0 < 100000); {13890#false} is VALID [2018-11-23 11:58:05,789 INFO L273 TraceCheckUtils]: 51: Hoare triple {13890#false} ~i~0 := 0; {13890#false} is VALID [2018-11-23 11:58:05,789 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 11:58:05,789 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 11:58:05,790 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 11:58:05,790 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 11:58:05,790 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 11:58:05,790 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 11:58:05,790 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 11:58:05,790 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 11:58:05,790 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 11:58:05,790 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 11:58:05,790 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 11:58:05,791 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 11:58:05,791 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 11:58:05,791 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 11:58:05,791 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 11:58:05,791 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 11:58:05,791 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 11:58:05,791 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 11:58:05,791 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 11:58:05,792 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 11:58:05,792 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 11:58:05,792 INFO L273 TraceCheckUtils]: 73: Hoare triple {13890#false} assume !(~i~0 < 100000); {13890#false} is VALID [2018-11-23 11:58:05,792 INFO L273 TraceCheckUtils]: 74: Hoare triple {13890#false} ~i~0 := 0; {13890#false} is VALID [2018-11-23 11:58:05,792 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 11:58:05,792 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 11:58:05,792 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 11:58:05,792 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 11:58:05,792 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 11:58:05,793 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 11:58:05,793 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 11:58:05,793 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 11:58:05,793 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 11:58:05,793 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 11:58:05,793 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 11:58:05,793 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 11:58:05,793 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 11:58:05,793 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 11:58:05,794 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 11:58:05,794 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 11:58:05,794 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 11:58:05,794 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 11:58:05,794 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 11:58:05,794 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 11:58:05,794 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 11:58:05,794 INFO L273 TraceCheckUtils]: 96: Hoare triple {13890#false} assume !(~i~0 < 100000); {13890#false} is VALID [2018-11-23 11:58:05,795 INFO L273 TraceCheckUtils]: 97: Hoare triple {13890#false} havoc ~x~0;~x~0 := 0; {13890#false} is VALID [2018-11-23 11:58:05,795 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 11:58:05,795 INFO L256 TraceCheckUtils]: 99: Hoare triple {13890#false} call __VERIFIER_assert((if 46 == #t~mem1 then 1 else 0)); {13890#false} is VALID [2018-11-23 11:58:05,795 INFO L273 TraceCheckUtils]: 100: Hoare triple {13890#false} ~cond := #in~cond; {13890#false} is VALID [2018-11-23 11:58:05,795 INFO L273 TraceCheckUtils]: 101: Hoare triple {13890#false} assume 0 == ~cond; {13890#false} is VALID [2018-11-23 11:58:05,795 INFO L273 TraceCheckUtils]: 102: Hoare triple {13890#false} assume !false; {13890#false} is VALID [2018-11-23 11:58:05,800 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 11:58:05,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:05,800 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 11:58:05,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2