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-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:09:50,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:09:50,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:09:50,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:09:50,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:09:50,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:09:50,133 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:09:50,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:09:50,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:09:50,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:09:50,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:09:50,139 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:09:50,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:09:50,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:09:50,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:09:50,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:09:50,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:09:50,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:09:50,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:09:50,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:09:50,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:09:50,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:09:50,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:09:50,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:09:50,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:09:50,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:09:50,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:09:50,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:09:50,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:09:50,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:09:50,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:09:50,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:09:50,167 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:09:50,167 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:09:50,170 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:09:50,171 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:09:50,172 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:09:50,197 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:09:50,198 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:09:50,199 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:09:50,199 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:09:50,200 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:09:50,200 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:09:50,200 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:09:50,204 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:09:50,204 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:09:50,204 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:09:50,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:09:50,205 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:09:50,205 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:09:50,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:09:50,205 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:09:50,205 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:09:50,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:09:50,206 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:09:50,206 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:09:50,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:09:50,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:09:50,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:09:50,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:09:50,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:09:50,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:09:50,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:09:50,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:09:50,209 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:09:50,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:09:50,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:09:50,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:09:50,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:09:50,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:09:50,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:09:50,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:09:50,287 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:09:50,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-23 12:09:50,340 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1ec0020/75d31c7369bb41b5aadec732d1e9e717/FLAGb18543a82 [2018-11-23 12:09:50,795 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:09:50,796 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-23 12:09:50,802 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1ec0020/75d31c7369bb41b5aadec732d1e9e717/FLAGb18543a82 [2018-11-23 12:09:51,123 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e1ec0020/75d31c7369bb41b5aadec732d1e9e717 [2018-11-23 12:09:51,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:09:51,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:09:51,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:51,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:09:51,138 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:09:51,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d13d574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51, skipping insertion in model container [2018-11-23 12:09:51,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:09:51,172 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:09:51,407 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:51,411 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:09:51,436 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:51,462 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:09:51,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51 WrapperNode [2018-11-23 12:09:51,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:51,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:51,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:09:51,464 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:09:51,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:51,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:09:51,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:09:51,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:09:51,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... [2018-11-23 12:09:51,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:09:51,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:09:51,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:09:51,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:09:51,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:09:51,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:09:51,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:09:51,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:09:51,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:09:51,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:09:51,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:09:51,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:09:51,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:09:51,686 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:09:51,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:09:51,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:09:51,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:09:52,197 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:09:52,197 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:09:52,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:52 BoogieIcfgContainer [2018-11-23 12:09:52,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:09:52,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:09:52,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:09:52,203 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:09:52,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:09:51" (1/3) ... [2018-11-23 12:09:52,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128594a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:52, skipping insertion in model container [2018-11-23 12:09:52,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:51" (2/3) ... [2018-11-23 12:09:52,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128594a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:52, skipping insertion in model container [2018-11-23 12:09:52,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:52" (3/3) ... [2018-11-23 12:09:52,206 INFO L112 eAbstractionObserver]: Analyzing ICFG array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-23 12:09:52,217 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:09:52,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:09:52,245 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:09:52,277 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:09:52,278 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:09:52,278 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:09:52,278 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:09:52,278 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:09:52,279 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:09:52,279 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:09:52,279 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:09:52,279 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:09:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:09:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:09:52,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:52,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:52,310 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:52,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash -423135907, now seen corresponding path program 1 times [2018-11-23 12:09:52,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:52,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:52,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:52,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:52,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:52,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:09:52,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 12:09:52,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:09:52,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #54#return; {28#true} is VALID [2018-11-23 12:09:52,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret3 := main(); {28#true} is VALID [2018-11-23 12:09:52,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {28#true} is VALID [2018-11-23 12:09:52,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 12:09:52,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2018-11-23 12:09:52,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29#false} is VALID [2018-11-23 12:09:52,495 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {29#false} is VALID [2018-11-23 12:09:52,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 12:09:52,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 12:09:52,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:09:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:52,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:52,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:09:52,507 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:09:52,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:52,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:09:52,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:52,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:09:52,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:09:52,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:09:52,587 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 12:09:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:52,783 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 12:09:52,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:09:52,784 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:09:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:09:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 12:09:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:09:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 12:09:52,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 12:09:53,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:53,167 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:09:53,168 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:09:53,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:09:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:09:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:09:53,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:53,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:53,217 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:53,217 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:53,221 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:09:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:09:53,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:53,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:53,222 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:53,222 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:09:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:53,226 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:09:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:09:53,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:53,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:53,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:53,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:09:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:09:53,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 12:09:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:53,232 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:09:53,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:09:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:09:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:09:53,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:53,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:53,233 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:53,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:53,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1453190697, now seen corresponding path program 1 times [2018-11-23 12:09:53,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:53,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:53,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:53,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:53,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:53,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {153#true} call ULTIMATE.init(); {153#true} is VALID [2018-11-23 12:09:53,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {153#true} is VALID [2018-11-23 12:09:53,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#true} assume true; {153#true} is VALID [2018-11-23 12:09:53,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} #54#return; {153#true} is VALID [2018-11-23 12:09:53,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {153#true} call #t~ret3 := main(); {153#true} is VALID [2018-11-23 12:09:53,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {155#(= main_~i~0 0)} is VALID [2018-11-23 12:09:53,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {155#(= main_~i~0 0)} assume !(~i~0 < 100000); {154#false} is VALID [2018-11-23 12:09:53,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {154#false} ~i~0 := 0; {154#false} is VALID [2018-11-23 12:09:53,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {154#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {154#false} is VALID [2018-11-23 12:09:53,313 INFO L256 TraceCheckUtils]: 9: Hoare triple {154#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {154#false} is VALID [2018-11-23 12:09:53,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {154#false} ~cond := #in~cond; {154#false} is VALID [2018-11-23 12:09:53,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {154#false} assume 0 == ~cond; {154#false} is VALID [2018-11-23 12:09:53,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {154#false} assume !false; {154#false} is VALID [2018-11-23 12:09:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:53,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:53,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:09:53,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:09:53,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:53,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:09:53,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:53,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:09:53,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:09:53,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:53,349 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 12:09:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:53,600 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 12:09:53,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:09:53,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:09:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:09:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:09:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:09:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:09:53,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:09:53,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:53,702 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:09:53,702 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:09:53,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:09:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:09:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 12:09:53,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:53,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2018-11-23 12:09:53,724 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2018-11-23 12:09:53,724 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2018-11-23 12:09:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:53,728 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:09:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:09:53,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:53,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:53,730 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2018-11-23 12:09:53,730 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2018-11-23 12:09:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:53,733 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 12:09:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 12:09:53,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:53,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:53,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:53,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:09:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 12:09:53,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 13 [2018-11-23 12:09:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:53,739 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 12:09:53,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:09:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:09:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:09:53,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:53,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:53,741 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:53,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:53,741 INFO L82 PathProgramCache]: Analyzing trace with hash -769700427, now seen corresponding path program 1 times [2018-11-23 12:09:53,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:53,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:53,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:53,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:53,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:54,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 12:09:54,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {301#true} is VALID [2018-11-23 12:09:54,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 12:09:54,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #54#return; {301#true} is VALID [2018-11-23 12:09:54,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret3 := main(); {301#true} is VALID [2018-11-23 12:09:54,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {303#(= main_~i~0 0)} is VALID [2018-11-23 12:09:54,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {303#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {303#(= main_~i~0 0)} is VALID [2018-11-23 12:09:54,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {303#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {304#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:54,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~i~0 1)} assume !(~i~0 < 100000); {302#false} is VALID [2018-11-23 12:09:54,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {302#false} ~i~0 := 0; {302#false} is VALID [2018-11-23 12:09:54,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {302#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {302#false} is VALID [2018-11-23 12:09:54,179 INFO L256 TraceCheckUtils]: 11: Hoare triple {302#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {302#false} is VALID [2018-11-23 12:09:54,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {302#false} ~cond := #in~cond; {302#false} is VALID [2018-11-23 12:09:54,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {302#false} assume 0 == ~cond; {302#false} is VALID [2018-11-23 12:09:54,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 12:09:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:54,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:54,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:54,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:54,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:54,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 12:09:54,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {301#true} is VALID [2018-11-23 12:09:54,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 12:09:54,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #54#return; {301#true} is VALID [2018-11-23 12:09:54,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret3 := main(); {301#true} is VALID [2018-11-23 12:09:54,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {323#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:54,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {323#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {323#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:54,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {323#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {304#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:54,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {304#(<= main_~i~0 1)} assume !(~i~0 < 100000); {302#false} is VALID [2018-11-23 12:09:54,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {302#false} ~i~0 := 0; {302#false} is VALID [2018-11-23 12:09:54,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {302#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {302#false} is VALID [2018-11-23 12:09:54,351 INFO L256 TraceCheckUtils]: 11: Hoare triple {302#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {302#false} is VALID [2018-11-23 12:09:54,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {302#false} ~cond := #in~cond; {302#false} is VALID [2018-11-23 12:09:54,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {302#false} assume 0 == ~cond; {302#false} is VALID [2018-11-23 12:09:54,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 12:09:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:54,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:54,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:09:54,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 12:09:54,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:54,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:09:54,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:54,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:09:54,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:09:54,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:09:54,415 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-23 12:09:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:54,887 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 12:09:54,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:09:54,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 12:09:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:09:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-11-23 12:09:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:09:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-11-23 12:09:54,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 53 transitions. [2018-11-23 12:09:55,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:55,013 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:09:55,013 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:09:55,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:09:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:09:55,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 12:09:55,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:55,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 12:09:55,042 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 12:09:55,042 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 12:09:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:55,046 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:09:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:09:55,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:55,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:55,047 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 12:09:55,047 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 12:09:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:55,050 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:09:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:09:55,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:55,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:55,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:55,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:09:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 12:09:55,055 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 15 [2018-11-23 12:09:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:55,055 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 12:09:55,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:09:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:09:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:09:55,056 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:55,057 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:55,057 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:55,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:55,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1065547245, now seen corresponding path program 2 times [2018-11-23 12:09:55,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:55,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:55,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:55,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2018-11-23 12:09:55,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {533#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {533#true} is VALID [2018-11-23 12:09:55,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-23 12:09:55,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #54#return; {533#true} is VALID [2018-11-23 12:09:55,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret3 := main(); {533#true} is VALID [2018-11-23 12:09:55,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {533#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {535#(= main_~i~0 0)} is VALID [2018-11-23 12:09:55,201 INFO L273 TraceCheckUtils]: 6: Hoare triple {535#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {535#(= main_~i~0 0)} is VALID [2018-11-23 12:09:55,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {535#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {536#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:55,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {536#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {536#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:55,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {536#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {537#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:55,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {537#(<= main_~i~0 2)} assume !(~i~0 < 100000); {534#false} is VALID [2018-11-23 12:09:55,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {534#false} ~i~0 := 0; {534#false} is VALID [2018-11-23 12:09:55,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {534#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {534#false} is VALID [2018-11-23 12:09:55,214 INFO L256 TraceCheckUtils]: 13: Hoare triple {534#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {534#false} is VALID [2018-11-23 12:09:55,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {534#false} ~cond := #in~cond; {534#false} is VALID [2018-11-23 12:09:55,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {534#false} assume 0 == ~cond; {534#false} is VALID [2018-11-23 12:09:55,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {534#false} assume !false; {534#false} is VALID [2018-11-23 12:09:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:55,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:55,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:09:55,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:09:55,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:55,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:55,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2018-11-23 12:09:55,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {533#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {533#true} is VALID [2018-11-23 12:09:55,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2018-11-23 12:09:55,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #54#return; {533#true} is VALID [2018-11-23 12:09:55,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret3 := main(); {533#true} is VALID [2018-11-23 12:09:55,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {533#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {556#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:55,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {556#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {556#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:55,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {556#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {536#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:55,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {536#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {536#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:55,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {536#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {537#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:55,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {537#(<= main_~i~0 2)} assume !(~i~0 < 100000); {534#false} is VALID [2018-11-23 12:09:55,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {534#false} ~i~0 := 0; {534#false} is VALID [2018-11-23 12:09:55,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {534#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {534#false} is VALID [2018-11-23 12:09:55,443 INFO L256 TraceCheckUtils]: 13: Hoare triple {534#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {534#false} is VALID [2018-11-23 12:09:55,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {534#false} ~cond := #in~cond; {534#false} is VALID [2018-11-23 12:09:55,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {534#false} assume 0 == ~cond; {534#false} is VALID [2018-11-23 12:09:55,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {534#false} assume !false; {534#false} is VALID [2018-11-23 12:09:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:55,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:55,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:09:55,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:09:55,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:55,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:09:55,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:55,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:09:55,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:09:55,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:09:55,498 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-11-23 12:09:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:55,752 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-23 12:09:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:09:55,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:09:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:09:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 12:09:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:09:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 12:09:55,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2018-11-23 12:09:55,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:55,844 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:09:55,845 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:09:55,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:09:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:09:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 12:09:55,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:55,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-23 12:09:55,883 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-23 12:09:55,883 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-23 12:09:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:55,888 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:09:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:09:55,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:55,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:55,889 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-23 12:09:55,890 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-23 12:09:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:55,893 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 12:09:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:09:55,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:55,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:55,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:55,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:09:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-23 12:09:55,898 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 17 [2018-11-23 12:09:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:55,898 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-23 12:09:55,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:09:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 12:09:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:09:55,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:55,899 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:55,900 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:55,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:55,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1906497807, now seen corresponding path program 3 times [2018-11-23 12:09:55,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:55,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:55,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:56,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {813#true} call ULTIMATE.init(); {813#true} is VALID [2018-11-23 12:09:56,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {813#true} is VALID [2018-11-23 12:09:56,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {813#true} assume true; {813#true} is VALID [2018-11-23 12:09:56,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} #54#return; {813#true} is VALID [2018-11-23 12:09:56,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {813#true} call #t~ret3 := main(); {813#true} is VALID [2018-11-23 12:09:56,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {813#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {815#(= main_~i~0 0)} is VALID [2018-11-23 12:09:56,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {815#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {815#(= main_~i~0 0)} is VALID [2018-11-23 12:09:56,018 INFO L273 TraceCheckUtils]: 7: Hoare triple {815#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {816#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:56,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {816#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {816#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:56,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {816#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {817#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:56,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {817#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {817#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:56,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {817#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {818#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:56,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {818#(<= main_~i~0 3)} assume !(~i~0 < 100000); {814#false} is VALID [2018-11-23 12:09:56,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {814#false} ~i~0 := 0; {814#false} is VALID [2018-11-23 12:09:56,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {814#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {814#false} is VALID [2018-11-23 12:09:56,028 INFO L256 TraceCheckUtils]: 15: Hoare triple {814#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {814#false} is VALID [2018-11-23 12:09:56,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {814#false} ~cond := #in~cond; {814#false} is VALID [2018-11-23 12:09:56,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {814#false} assume 0 == ~cond; {814#false} is VALID [2018-11-23 12:09:56,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {814#false} assume !false; {814#false} is VALID [2018-11-23 12:09:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:56,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:56,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:56,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:09:56,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:09:56,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:56,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:56,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {813#true} call ULTIMATE.init(); {813#true} is VALID [2018-11-23 12:09:56,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {813#true} is VALID [2018-11-23 12:09:56,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {813#true} assume true; {813#true} is VALID [2018-11-23 12:09:56,234 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} #54#return; {813#true} is VALID [2018-11-23 12:09:56,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {813#true} call #t~ret3 := main(); {813#true} is VALID [2018-11-23 12:09:56,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {813#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {837#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:56,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {837#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {837#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:56,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {837#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {816#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:56,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {816#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {816#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:56,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {816#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {817#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:56,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {817#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {817#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:56,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {817#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {818#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:56,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {818#(<= main_~i~0 3)} assume !(~i~0 < 100000); {814#false} is VALID [2018-11-23 12:09:56,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {814#false} ~i~0 := 0; {814#false} is VALID [2018-11-23 12:09:56,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {814#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {814#false} is VALID [2018-11-23 12:09:56,257 INFO L256 TraceCheckUtils]: 15: Hoare triple {814#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {814#false} is VALID [2018-11-23 12:09:56,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {814#false} ~cond := #in~cond; {814#false} is VALID [2018-11-23 12:09:56,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {814#false} assume 0 == ~cond; {814#false} is VALID [2018-11-23 12:09:56,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {814#false} assume !false; {814#false} is VALID [2018-11-23 12:09:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:56,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:09:56,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:09:56,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:56,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:09:56,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:56,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:09:56,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:09:56,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:09:56,312 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-11-23 12:09:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:56,556 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-11-23 12:09:56,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:09:56,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:09:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:09:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:09:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:09:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-23 12:09:56,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2018-11-23 12:09:56,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:56,745 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:09:56,745 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:09:56,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:09:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:09:56,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 12:09:56,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:56,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2018-11-23 12:09:56,805 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2018-11-23 12:09:56,805 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2018-11-23 12:09:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:56,809 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:09:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:09:56,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:56,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:56,810 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2018-11-23 12:09:56,810 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2018-11-23 12:09:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:56,814 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:09:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:09:56,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:56,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:56,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:56,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:09:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 12:09:56,819 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 19 [2018-11-23 12:09:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:56,819 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 12:09:56,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:09:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 12:09:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:09:56,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:56,820 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:56,821 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:56,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1688831055, now seen corresponding path program 4 times [2018-11-23 12:09:56,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:56,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:56,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:56,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:56,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:56,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {1141#true} call ULTIMATE.init(); {1141#true} is VALID [2018-11-23 12:09:56,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {1141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1141#true} is VALID [2018-11-23 12:09:56,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {1141#true} assume true; {1141#true} is VALID [2018-11-23 12:09:56,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1141#true} {1141#true} #54#return; {1141#true} is VALID [2018-11-23 12:09:56,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {1141#true} call #t~ret3 := main(); {1141#true} is VALID [2018-11-23 12:09:56,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {1141#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1143#(= main_~i~0 0)} is VALID [2018-11-23 12:09:56,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {1143#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1143#(= main_~i~0 0)} is VALID [2018-11-23 12:09:56,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {1143#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1144#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:56,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {1144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1144#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:56,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {1144#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1145#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:56,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {1145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1145#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:56,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {1145#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1146#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:56,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {1146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1146#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:56,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {1146#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1147#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:56,974 INFO L273 TraceCheckUtils]: 14: Hoare triple {1147#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1142#false} is VALID [2018-11-23 12:09:56,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {1142#false} ~i~0 := 0; {1142#false} is VALID [2018-11-23 12:09:56,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {1142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1142#false} is VALID [2018-11-23 12:09:56,975 INFO L256 TraceCheckUtils]: 17: Hoare triple {1142#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {1142#false} is VALID [2018-11-23 12:09:56,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {1142#false} ~cond := #in~cond; {1142#false} is VALID [2018-11-23 12:09:56,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {1142#false} assume 0 == ~cond; {1142#false} is VALID [2018-11-23 12:09:56,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {1142#false} assume !false; {1142#false} is VALID [2018-11-23 12:09:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:56,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:56,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:56,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:09:57,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:09:57,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:57,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:57,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {1141#true} call ULTIMATE.init(); {1141#true} is VALID [2018-11-23 12:09:57,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {1141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1141#true} is VALID [2018-11-23 12:09:57,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {1141#true} assume true; {1141#true} is VALID [2018-11-23 12:09:57,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1141#true} {1141#true} #54#return; {1141#true} is VALID [2018-11-23 12:09:57,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {1141#true} call #t~ret3 := main(); {1141#true} is VALID [2018-11-23 12:09:57,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {1141#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1166#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:57,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {1166#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1166#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:57,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {1166#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1144#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:57,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {1144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1144#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:57,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {1144#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1145#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:57,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {1145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1145#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:57,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {1145#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1146#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:57,216 INFO L273 TraceCheckUtils]: 12: Hoare triple {1146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1146#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:57,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {1146#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1147#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:57,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {1147#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1142#false} is VALID [2018-11-23 12:09:57,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {1142#false} ~i~0 := 0; {1142#false} is VALID [2018-11-23 12:09:57,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {1142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1142#false} is VALID [2018-11-23 12:09:57,219 INFO L256 TraceCheckUtils]: 17: Hoare triple {1142#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {1142#false} is VALID [2018-11-23 12:09:57,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {1142#false} ~cond := #in~cond; {1142#false} is VALID [2018-11-23 12:09:57,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {1142#false} assume 0 == ~cond; {1142#false} is VALID [2018-11-23 12:09:57,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {1142#false} assume !false; {1142#false} is VALID [2018-11-23 12:09:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:57,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:57,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:09:57,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 12:09:57,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:57,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:09:57,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:57,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:09:57,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:09:57,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:09:57,269 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 8 states. [2018-11-23 12:09:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:57,581 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-11-23 12:09:57,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:09:57,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 12:09:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:09:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 12:09:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:09:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 12:09:57,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2018-11-23 12:09:57,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:57,740 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:09:57,740 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:09:57,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:09:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:09:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-23 12:09:57,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:57,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 53 states. [2018-11-23 12:09:57,784 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 53 states. [2018-11-23 12:09:57,784 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 53 states. [2018-11-23 12:09:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:57,787 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:09:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:09:57,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:57,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:57,789 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 55 states. [2018-11-23 12:09:57,789 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 55 states. [2018-11-23 12:09:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:57,792 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:09:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:09:57,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:57,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:57,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:57,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:09:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-23 12:09:57,797 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 21 [2018-11-23 12:09:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:57,797 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-23 12:09:57,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:09:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 12:09:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:09:57,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:57,798 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:57,799 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:57,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:57,799 INFO L82 PathProgramCache]: Analyzing trace with hash -648805843, now seen corresponding path program 5 times [2018-11-23 12:09:57,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:57,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:57,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:57,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {1517#true} call ULTIMATE.init(); {1517#true} is VALID [2018-11-23 12:09:57,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {1517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1517#true} is VALID [2018-11-23 12:09:57,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {1517#true} assume true; {1517#true} is VALID [2018-11-23 12:09:57,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1517#true} {1517#true} #54#return; {1517#true} is VALID [2018-11-23 12:09:57,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {1517#true} call #t~ret3 := main(); {1517#true} is VALID [2018-11-23 12:09:57,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {1517#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1519#(= main_~i~0 0)} is VALID [2018-11-23 12:09:57,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {1519#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1519#(= main_~i~0 0)} is VALID [2018-11-23 12:09:57,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {1519#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1520#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:57,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {1520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1520#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:57,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {1520#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1521#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:57,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {1521#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1521#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:57,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {1521#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1522#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:57,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {1522#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1522#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:57,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {1522#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1523#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:57,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {1523#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1523#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:57,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {1523#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1524#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:57,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {1524#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1518#false} is VALID [2018-11-23 12:09:57,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {1518#false} ~i~0 := 0; {1518#false} is VALID [2018-11-23 12:09:57,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {1518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1518#false} is VALID [2018-11-23 12:09:57,962 INFO L256 TraceCheckUtils]: 19: Hoare triple {1518#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {1518#false} is VALID [2018-11-23 12:09:57,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {1518#false} ~cond := #in~cond; {1518#false} is VALID [2018-11-23 12:09:57,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {1518#false} assume 0 == ~cond; {1518#false} is VALID [2018-11-23 12:09:57,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2018-11-23 12:09:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:57,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:57,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:09:57,996 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:09:57,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:58,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:58,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {1517#true} call ULTIMATE.init(); {1517#true} is VALID [2018-11-23 12:09:58,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {1517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1517#true} is VALID [2018-11-23 12:09:58,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {1517#true} assume true; {1517#true} is VALID [2018-11-23 12:09:58,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1517#true} {1517#true} #54#return; {1517#true} is VALID [2018-11-23 12:09:58,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {1517#true} call #t~ret3 := main(); {1517#true} is VALID [2018-11-23 12:09:58,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {1517#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1543#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:58,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {1543#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1543#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:58,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {1543#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1520#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:58,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {1520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1520#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:58,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {1520#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1521#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:58,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {1521#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1521#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:58,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {1521#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1522#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:58,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {1522#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1522#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:58,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {1522#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1523#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:58,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {1523#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1523#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:58,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {1523#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1524#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:58,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {1524#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1518#false} is VALID [2018-11-23 12:09:58,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {1518#false} ~i~0 := 0; {1518#false} is VALID [2018-11-23 12:09:58,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {1518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1518#false} is VALID [2018-11-23 12:09:58,142 INFO L256 TraceCheckUtils]: 19: Hoare triple {1518#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {1518#false} is VALID [2018-11-23 12:09:58,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {1518#false} ~cond := #in~cond; {1518#false} is VALID [2018-11-23 12:09:58,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {1518#false} assume 0 == ~cond; {1518#false} is VALID [2018-11-23 12:09:58,143 INFO L273 TraceCheckUtils]: 22: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2018-11-23 12:09:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:58,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:58,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:09:58,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 12:09:58,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:58,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:09:58,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:58,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:09:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:09:58,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:09:58,210 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 9 states. [2018-11-23 12:09:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:58,973 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2018-11-23 12:09:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:09:58,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 12:09:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:09:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-11-23 12:09:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:09:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2018-11-23 12:09:58,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 85 transitions. [2018-11-23 12:09:59,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:59,087 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:09:59,087 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:09:59,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:09:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:09:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-23 12:09:59,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:59,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-23 12:09:59,281 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-23 12:09:59,281 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-23 12:09:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:59,284 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:09:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 12:09:59,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:59,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:59,285 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-23 12:09:59,285 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-23 12:09:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:59,289 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:09:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 12:09:59,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:59,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:59,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:59,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:09:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-11-23 12:09:59,293 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 23 [2018-11-23 12:09:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:59,293 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-23 12:09:59,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:09:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-23 12:09:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:09:59,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:59,295 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:59,295 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:59,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash -849969013, now seen corresponding path program 6 times [2018-11-23 12:09:59,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:59,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:59,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:59,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2018-11-23 12:09:59,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1941#true} is VALID [2018-11-23 12:09:59,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {1941#true} assume true; {1941#true} is VALID [2018-11-23 12:09:59,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1941#true} {1941#true} #54#return; {1941#true} is VALID [2018-11-23 12:09:59,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {1941#true} call #t~ret3 := main(); {1941#true} is VALID [2018-11-23 12:09:59,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {1941#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1943#(= main_~i~0 0)} is VALID [2018-11-23 12:09:59,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {1943#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1943#(= main_~i~0 0)} is VALID [2018-11-23 12:09:59,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {1943#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1944#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:59,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {1944#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1944#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:59,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {1944#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1945#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:59,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {1945#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1945#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:59,487 INFO L273 TraceCheckUtils]: 11: Hoare triple {1945#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1946#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:59,488 INFO L273 TraceCheckUtils]: 12: Hoare triple {1946#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1946#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:59,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {1946#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1947#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:59,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {1947#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1947#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:59,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {1947#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1948#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:59,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {1948#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1948#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:59,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {1948#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1949#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:59,494 INFO L273 TraceCheckUtils]: 18: Hoare triple {1949#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1942#false} is VALID [2018-11-23 12:09:59,494 INFO L273 TraceCheckUtils]: 19: Hoare triple {1942#false} ~i~0 := 0; {1942#false} is VALID [2018-11-23 12:09:59,494 INFO L273 TraceCheckUtils]: 20: Hoare triple {1942#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1942#false} is VALID [2018-11-23 12:09:59,495 INFO L256 TraceCheckUtils]: 21: Hoare triple {1942#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {1942#false} is VALID [2018-11-23 12:09:59,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2018-11-23 12:09:59,495 INFO L273 TraceCheckUtils]: 23: Hoare triple {1942#false} assume 0 == ~cond; {1942#false} is VALID [2018-11-23 12:09:59,496 INFO L273 TraceCheckUtils]: 24: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2018-11-23 12:09:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:59,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:59,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:59,509 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:09:59,574 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:09:59,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:59,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:59,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2018-11-23 12:09:59,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1941#true} is VALID [2018-11-23 12:09:59,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {1941#true} assume true; {1941#true} is VALID [2018-11-23 12:09:59,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1941#true} {1941#true} #54#return; {1941#true} is VALID [2018-11-23 12:09:59,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {1941#true} call #t~ret3 := main(); {1941#true} is VALID [2018-11-23 12:09:59,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {1941#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1968#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:59,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {1968#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1968#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:59,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {1968#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1944#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:59,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {1944#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1944#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:59,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {1944#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1945#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:59,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {1945#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1945#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:59,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {1945#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1946#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:59,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {1946#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1946#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:59,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {1946#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1947#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:59,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {1947#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1947#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:59,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {1947#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1948#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:59,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {1948#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1948#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:59,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {1948#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1949#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:59,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {1949#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1942#false} is VALID [2018-11-23 12:09:59,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {1942#false} ~i~0 := 0; {1942#false} is VALID [2018-11-23 12:09:59,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {1942#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1942#false} is VALID [2018-11-23 12:09:59,745 INFO L256 TraceCheckUtils]: 21: Hoare triple {1942#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {1942#false} is VALID [2018-11-23 12:09:59,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2018-11-23 12:09:59,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {1942#false} assume 0 == ~cond; {1942#false} is VALID [2018-11-23 12:09:59,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2018-11-23 12:09:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:59,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:59,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:09:59,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 12:09:59,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:59,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:09:59,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:59,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:09:59,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:09:59,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:09:59,802 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 10 states. [2018-11-23 12:10:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:00,451 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2018-11-23 12:10:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:10:00,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 12:10:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:10:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2018-11-23 12:10:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:10:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2018-11-23 12:10:00,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 93 transitions. [2018-11-23 12:10:00,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:00,628 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:10:00,628 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:10:00,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:10:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:10:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:10:00,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:00,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:10:00,664 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:10:00,664 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:10:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:00,668 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-23 12:10:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-23 12:10:00,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:00,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:00,669 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:10:00,669 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:10:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:00,672 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-23 12:10:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-23 12:10:00,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:00,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:00,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:00,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:10:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2018-11-23 12:10:00,676 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 25 [2018-11-23 12:10:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:00,676 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2018-11-23 12:10:00,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:10:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-23 12:10:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:10:00,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:00,677 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:00,678 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:00,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:00,678 INFO L82 PathProgramCache]: Analyzing trace with hash -894247063, now seen corresponding path program 7 times [2018-11-23 12:10:00,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:00,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:00,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:00,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:00,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:00,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {2413#true} call ULTIMATE.init(); {2413#true} is VALID [2018-11-23 12:10:00,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {2413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2413#true} is VALID [2018-11-23 12:10:00,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {2413#true} assume true; {2413#true} is VALID [2018-11-23 12:10:00,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2413#true} {2413#true} #54#return; {2413#true} is VALID [2018-11-23 12:10:00,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {2413#true} call #t~ret3 := main(); {2413#true} is VALID [2018-11-23 12:10:00,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {2413#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2415#(= main_~i~0 0)} is VALID [2018-11-23 12:10:00,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {2415#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2415#(= main_~i~0 0)} is VALID [2018-11-23 12:10:00,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {2415#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2416#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:00,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {2416#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2416#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:00,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {2416#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2417#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:00,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {2417#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2417#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:00,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {2417#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2418#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:00,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {2418#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2418#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:00,835 INFO L273 TraceCheckUtils]: 13: Hoare triple {2418#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2419#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:00,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {2419#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2419#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:00,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {2419#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2420#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:00,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {2420#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2420#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:00,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {2420#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2421#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:00,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {2421#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2421#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:00,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {2421#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2422#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:00,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {2422#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2414#false} is VALID [2018-11-23 12:10:00,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {2414#false} ~i~0 := 0; {2414#false} is VALID [2018-11-23 12:10:00,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {2414#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2414#false} is VALID [2018-11-23 12:10:00,843 INFO L256 TraceCheckUtils]: 23: Hoare triple {2414#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {2414#false} is VALID [2018-11-23 12:10:00,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {2414#false} ~cond := #in~cond; {2414#false} is VALID [2018-11-23 12:10:00,843 INFO L273 TraceCheckUtils]: 25: Hoare triple {2414#false} assume 0 == ~cond; {2414#false} is VALID [2018-11-23 12:10:00,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {2414#false} assume !false; {2414#false} is VALID [2018-11-23 12:10:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:00,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:00,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:00,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:00,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:01,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {2413#true} call ULTIMATE.init(); {2413#true} is VALID [2018-11-23 12:10:01,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {2413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2413#true} is VALID [2018-11-23 12:10:01,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {2413#true} assume true; {2413#true} is VALID [2018-11-23 12:10:01,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2413#true} {2413#true} #54#return; {2413#true} is VALID [2018-11-23 12:10:01,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {2413#true} call #t~ret3 := main(); {2413#true} is VALID [2018-11-23 12:10:01,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {2413#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2441#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:01,048 INFO L273 TraceCheckUtils]: 6: Hoare triple {2441#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2441#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:01,049 INFO L273 TraceCheckUtils]: 7: Hoare triple {2441#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2416#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:01,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {2416#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2416#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:01,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {2416#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2417#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:01,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {2417#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2417#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:01,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {2417#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2418#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:01,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {2418#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2418#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:01,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {2418#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2419#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:01,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {2419#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2419#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:01,053 INFO L273 TraceCheckUtils]: 15: Hoare triple {2419#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2420#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:01,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {2420#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2420#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:01,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {2420#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2421#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:01,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {2421#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2421#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:01,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {2421#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2422#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:01,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {2422#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2414#false} is VALID [2018-11-23 12:10:01,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {2414#false} ~i~0 := 0; {2414#false} is VALID [2018-11-23 12:10:01,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {2414#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2414#false} is VALID [2018-11-23 12:10:01,059 INFO L256 TraceCheckUtils]: 23: Hoare triple {2414#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {2414#false} is VALID [2018-11-23 12:10:01,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {2414#false} ~cond := #in~cond; {2414#false} is VALID [2018-11-23 12:10:01,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {2414#false} assume 0 == ~cond; {2414#false} is VALID [2018-11-23 12:10:01,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {2414#false} assume !false; {2414#false} is VALID [2018-11-23 12:10:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:01,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:01,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:10:01,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 12:10:01,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:01,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:10:01,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:01,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:10:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:10:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:10:01,122 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 11 states. [2018-11-23 12:10:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:01,648 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-11-23 12:10:01,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:10:01,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 12:10:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:10:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2018-11-23 12:10:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:10:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2018-11-23 12:10:01,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 101 transitions. [2018-11-23 12:10:01,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:01,762 INFO L225 Difference]: With dead ends: 122 [2018-11-23 12:10:01,762 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:10:01,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 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 12:10:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:10:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-23 12:10:01,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:01,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-23 12:10:01,800 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-23 12:10:01,801 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-23 12:10:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:01,806 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-11-23 12:10:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-11-23 12:10:01,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:01,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:01,807 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-23 12:10:01,807 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-23 12:10:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:01,809 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-11-23 12:10:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-11-23 12:10:01,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:01,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:01,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:01,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:10:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-11-23 12:10:01,813 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 27 [2018-11-23 12:10:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:01,813 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-11-23 12:10:01,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:10:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-11-23 12:10:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:10:01,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:01,814 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:01,814 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:01,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash -495780153, now seen corresponding path program 8 times [2018-11-23 12:10:01,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:01,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:01,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:02,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {2933#true} call ULTIMATE.init(); {2933#true} is VALID [2018-11-23 12:10:02,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {2933#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2933#true} is VALID [2018-11-23 12:10:02,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {2933#true} assume true; {2933#true} is VALID [2018-11-23 12:10:02,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2933#true} {2933#true} #54#return; {2933#true} is VALID [2018-11-23 12:10:02,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {2933#true} call #t~ret3 := main(); {2933#true} is VALID [2018-11-23 12:10:02,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {2933#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2935#(= main_~i~0 0)} is VALID [2018-11-23 12:10:02,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {2935#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2935#(= main_~i~0 0)} is VALID [2018-11-23 12:10:02,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {2935#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2936#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:02,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {2936#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2936#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:02,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {2936#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2937#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:02,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {2937#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2937#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:02,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {2937#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2938#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:02,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {2938#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2938#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:02,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {2938#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2939#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:02,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {2939#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2939#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:02,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {2939#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2940#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:02,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {2940#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2940#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:02,049 INFO L273 TraceCheckUtils]: 17: Hoare triple {2940#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2941#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:02,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {2941#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2941#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:02,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {2941#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2942#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:02,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {2942#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2942#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:02,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {2942#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2943#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:02,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {2943#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2934#false} is VALID [2018-11-23 12:10:02,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {2934#false} ~i~0 := 0; {2934#false} is VALID [2018-11-23 12:10:02,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {2934#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2934#false} is VALID [2018-11-23 12:10:02,054 INFO L256 TraceCheckUtils]: 25: Hoare triple {2934#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {2934#false} is VALID [2018-11-23 12:10:02,054 INFO L273 TraceCheckUtils]: 26: Hoare triple {2934#false} ~cond := #in~cond; {2934#false} is VALID [2018-11-23 12:10:02,054 INFO L273 TraceCheckUtils]: 27: Hoare triple {2934#false} assume 0 == ~cond; {2934#false} is VALID [2018-11-23 12:10:02,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {2934#false} assume !false; {2934#false} is VALID [2018-11-23 12:10:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:02,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:02,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:02,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:10:02,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:10:02,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:02,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:02,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {2933#true} call ULTIMATE.init(); {2933#true} is VALID [2018-11-23 12:10:02,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {2933#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2933#true} is VALID [2018-11-23 12:10:02,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {2933#true} assume true; {2933#true} is VALID [2018-11-23 12:10:02,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2933#true} {2933#true} #54#return; {2933#true} is VALID [2018-11-23 12:10:02,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {2933#true} call #t~ret3 := main(); {2933#true} is VALID [2018-11-23 12:10:02,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {2933#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2962#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:02,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {2962#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2962#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:02,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {2962#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2936#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:02,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {2936#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2936#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:02,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {2936#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2937#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:02,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {2937#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2937#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:02,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {2937#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2938#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:02,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {2938#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2938#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:02,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {2938#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2939#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:02,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {2939#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2939#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:02,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {2939#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2940#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:02,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {2940#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2940#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:02,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {2940#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2941#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:02,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {2941#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2941#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:02,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {2941#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2942#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:02,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {2942#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2942#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:02,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {2942#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2943#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:02,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {2943#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2934#false} is VALID [2018-11-23 12:10:02,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {2934#false} ~i~0 := 0; {2934#false} is VALID [2018-11-23 12:10:02,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {2934#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2934#false} is VALID [2018-11-23 12:10:02,504 INFO L256 TraceCheckUtils]: 25: Hoare triple {2934#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {2934#false} is VALID [2018-11-23 12:10:02,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {2934#false} ~cond := #in~cond; {2934#false} is VALID [2018-11-23 12:10:02,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {2934#false} assume 0 == ~cond; {2934#false} is VALID [2018-11-23 12:10:02,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {2934#false} assume !false; {2934#false} is VALID [2018-11-23 12:10:02,507 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:02,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:02,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:10:02,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 12:10:02,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:02,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:10:02,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:02,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:10:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:10:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:10:02,558 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 12 states. [2018-11-23 12:10:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:03,086 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2018-11-23 12:10:03,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:10:03,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 12:10:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:10:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2018-11-23 12:10:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:10:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2018-11-23 12:10:03,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 109 transitions. [2018-11-23 12:10:03,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:03,222 INFO L225 Difference]: With dead ends: 134 [2018-11-23 12:10:03,223 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:10:03,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:10:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:10:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:10:03,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:03,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:10:03,368 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:10:03,368 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:10:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:03,371 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-23 12:10:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-11-23 12:10:03,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:03,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:03,372 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:10:03,372 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:10:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:03,374 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-23 12:10:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-11-23 12:10:03,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:03,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:03,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:03,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:10:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2018-11-23 12:10:03,378 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 29 [2018-11-23 12:10:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:03,378 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2018-11-23 12:10:03,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:10:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2018-11-23 12:10:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:10:03,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:03,379 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:03,379 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:03,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:03,380 INFO L82 PathProgramCache]: Analyzing trace with hash 178831013, now seen corresponding path program 9 times [2018-11-23 12:10:03,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:03,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:03,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:03,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:03,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:03,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {3501#true} call ULTIMATE.init(); {3501#true} is VALID [2018-11-23 12:10:03,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {3501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3501#true} is VALID [2018-11-23 12:10:03,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {3501#true} assume true; {3501#true} is VALID [2018-11-23 12:10:03,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3501#true} {3501#true} #54#return; {3501#true} is VALID [2018-11-23 12:10:03,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {3501#true} call #t~ret3 := main(); {3501#true} is VALID [2018-11-23 12:10:03,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {3501#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3503#(= main_~i~0 0)} is VALID [2018-11-23 12:10:03,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {3503#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3503#(= main_~i~0 0)} is VALID [2018-11-23 12:10:03,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {3503#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3504#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:03,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {3504#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3504#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:03,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {3504#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3505#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:03,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {3505#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3505#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:03,644 INFO L273 TraceCheckUtils]: 11: Hoare triple {3505#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3506#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:03,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {3506#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3506#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:03,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {3506#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3507#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:03,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {3507#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3507#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:03,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {3507#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3508#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:03,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {3508#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3508#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:03,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {3508#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3509#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:03,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {3509#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3509#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:03,649 INFO L273 TraceCheckUtils]: 19: Hoare triple {3509#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3510#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:03,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {3510#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3510#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:03,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {3510#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3511#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:03,651 INFO L273 TraceCheckUtils]: 22: Hoare triple {3511#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3511#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:03,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {3511#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3512#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:03,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {3512#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3502#false} is VALID [2018-11-23 12:10:03,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {3502#false} ~i~0 := 0; {3502#false} is VALID [2018-11-23 12:10:03,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {3502#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3502#false} is VALID [2018-11-23 12:10:03,653 INFO L256 TraceCheckUtils]: 27: Hoare triple {3502#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {3502#false} is VALID [2018-11-23 12:10:03,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {3502#false} ~cond := #in~cond; {3502#false} is VALID [2018-11-23 12:10:03,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {3502#false} assume 0 == ~cond; {3502#false} is VALID [2018-11-23 12:10:03,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {3502#false} assume !false; {3502#false} is VALID [2018-11-23 12:10:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:03,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:03,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:03,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:10:03,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:10:03,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:03,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:03,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {3501#true} call ULTIMATE.init(); {3501#true} is VALID [2018-11-23 12:10:03,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {3501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3501#true} is VALID [2018-11-23 12:10:03,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {3501#true} assume true; {3501#true} is VALID [2018-11-23 12:10:03,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3501#true} {3501#true} #54#return; {3501#true} is VALID [2018-11-23 12:10:03,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {3501#true} call #t~ret3 := main(); {3501#true} is VALID [2018-11-23 12:10:03,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {3501#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3531#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:03,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {3531#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3531#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:03,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {3531#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3504#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:03,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {3504#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3504#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:03,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {3504#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3505#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:03,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {3505#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3505#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:03,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {3505#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3506#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:03,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {3506#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3506#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:03,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {3506#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3507#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:03,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {3507#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3507#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:03,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {3507#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3508#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:03,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {3508#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3508#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:04,000 INFO L273 TraceCheckUtils]: 17: Hoare triple {3508#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3509#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:04,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {3509#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3509#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:04,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {3509#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3510#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:04,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {3510#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3510#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:04,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {3510#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3511#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:04,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {3511#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3511#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:04,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {3511#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3512#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:04,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {3512#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3502#false} is VALID [2018-11-23 12:10:04,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {3502#false} ~i~0 := 0; {3502#false} is VALID [2018-11-23 12:10:04,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {3502#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3502#false} is VALID [2018-11-23 12:10:04,019 INFO L256 TraceCheckUtils]: 27: Hoare triple {3502#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {3502#false} is VALID [2018-11-23 12:10:04,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {3502#false} ~cond := #in~cond; {3502#false} is VALID [2018-11-23 12:10:04,020 INFO L273 TraceCheckUtils]: 29: Hoare triple {3502#false} assume 0 == ~cond; {3502#false} is VALID [2018-11-23 12:10:04,020 INFO L273 TraceCheckUtils]: 30: Hoare triple {3502#false} assume !false; {3502#false} is VALID [2018-11-23 12:10:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:04,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:04,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:10:04,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-23 12:10:04,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:04,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:10:04,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:04,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:10:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:10:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:10:04,073 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 13 states. [2018-11-23 12:10:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:04,593 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2018-11-23 12:10:04,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:10:04,593 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-23 12:10:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:10:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2018-11-23 12:10:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:10:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2018-11-23 12:10:04,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 117 transitions. [2018-11-23 12:10:04,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:04,763 INFO L225 Difference]: With dead ends: 146 [2018-11-23 12:10:04,763 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:10:04,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:10:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:10:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 12:10:04,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:04,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-23 12:10:04,805 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-23 12:10:04,805 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-23 12:10:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:04,807 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2018-11-23 12:10:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-11-23 12:10:04,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:04,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:04,808 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-23 12:10:04,808 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-23 12:10:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:04,811 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2018-11-23 12:10:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-11-23 12:10:04,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:04,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:04,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:04,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:10:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-11-23 12:10:04,814 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 31 [2018-11-23 12:10:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:04,815 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-11-23 12:10:04,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:10:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-11-23 12:10:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:10:04,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:04,816 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:04,816 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:04,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:04,816 INFO L82 PathProgramCache]: Analyzing trace with hash -59900157, now seen corresponding path program 10 times [2018-11-23 12:10:04,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:04,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:04,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:04,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:05,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {4117#true} call ULTIMATE.init(); {4117#true} is VALID [2018-11-23 12:10:05,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {4117#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4117#true} is VALID [2018-11-23 12:10:05,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {4117#true} assume true; {4117#true} is VALID [2018-11-23 12:10:05,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4117#true} {4117#true} #54#return; {4117#true} is VALID [2018-11-23 12:10:05,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {4117#true} call #t~ret3 := main(); {4117#true} is VALID [2018-11-23 12:10:05,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {4117#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4119#(= main_~i~0 0)} is VALID [2018-11-23 12:10:05,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {4119#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4119#(= main_~i~0 0)} is VALID [2018-11-23 12:10:05,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {4119#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4120#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:05,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {4120#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4120#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:05,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {4120#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4121#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:05,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {4121#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4121#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:05,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {4121#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4122#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:05,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {4122#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:05,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {4122#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4123#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:05,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {4123#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4123#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:05,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {4123#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:05,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4124#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:05,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4125#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:05,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:05,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4126#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:05,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {4126#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:05,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4127#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:05,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {4127#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:05,886 INFO L273 TraceCheckUtils]: 23: Hoare triple {4127#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4128#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:05,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {4128#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:05,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {4128#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4129#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:05,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {4129#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4118#false} is VALID [2018-11-23 12:10:05,889 INFO L273 TraceCheckUtils]: 27: Hoare triple {4118#false} ~i~0 := 0; {4118#false} is VALID [2018-11-23 12:10:05,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {4118#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4118#false} is VALID [2018-11-23 12:10:05,889 INFO L256 TraceCheckUtils]: 29: Hoare triple {4118#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {4118#false} is VALID [2018-11-23 12:10:05,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {4118#false} ~cond := #in~cond; {4118#false} is VALID [2018-11-23 12:10:05,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {4118#false} assume 0 == ~cond; {4118#false} is VALID [2018-11-23 12:10:05,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {4118#false} assume !false; {4118#false} is VALID [2018-11-23 12:10:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:05,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:05,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:05,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:10:05,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:10:05,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:05,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:06,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {4117#true} call ULTIMATE.init(); {4117#true} is VALID [2018-11-23 12:10:06,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {4117#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4117#true} is VALID [2018-11-23 12:10:06,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {4117#true} assume true; {4117#true} is VALID [2018-11-23 12:10:06,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4117#true} {4117#true} #54#return; {4117#true} is VALID [2018-11-23 12:10:06,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {4117#true} call #t~ret3 := main(); {4117#true} is VALID [2018-11-23 12:10:06,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {4117#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4148#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:06,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {4148#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4148#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:06,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {4148#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4120#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:06,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {4120#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4120#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:06,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {4120#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4121#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:06,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {4121#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4121#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:06,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {4121#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4122#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:06,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {4122#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4122#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:06,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {4122#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4123#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:06,090 INFO L273 TraceCheckUtils]: 14: Hoare triple {4123#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4123#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:06,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {4123#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4124#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:06,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4124#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:06,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4125#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:06,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4125#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:06,094 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4126#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:06,095 INFO L273 TraceCheckUtils]: 20: Hoare triple {4126#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4126#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:06,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4127#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:06,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {4127#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4127#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:06,098 INFO L273 TraceCheckUtils]: 23: Hoare triple {4127#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4128#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:06,098 INFO L273 TraceCheckUtils]: 24: Hoare triple {4128#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4128#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:06,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {4128#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4129#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:06,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {4129#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4118#false} is VALID [2018-11-23 12:10:06,100 INFO L273 TraceCheckUtils]: 27: Hoare triple {4118#false} ~i~0 := 0; {4118#false} is VALID [2018-11-23 12:10:06,101 INFO L273 TraceCheckUtils]: 28: Hoare triple {4118#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4118#false} is VALID [2018-11-23 12:10:06,101 INFO L256 TraceCheckUtils]: 29: Hoare triple {4118#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {4118#false} is VALID [2018-11-23 12:10:06,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {4118#false} ~cond := #in~cond; {4118#false} is VALID [2018-11-23 12:10:06,101 INFO L273 TraceCheckUtils]: 31: Hoare triple {4118#false} assume 0 == ~cond; {4118#false} is VALID [2018-11-23 12:10:06,102 INFO L273 TraceCheckUtils]: 32: Hoare triple {4118#false} assume !false; {4118#false} is VALID [2018-11-23 12:10:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:06,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:06,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:10:06,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 12:10:06,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:06,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:10:06,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:06,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:10:06,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:10:06,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:10:06,163 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 14 states. [2018-11-23 12:10:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:06,769 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2018-11-23 12:10:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:10:06,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 12:10:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:10:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2018-11-23 12:10:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:10:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2018-11-23 12:10:06,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 125 transitions. [2018-11-23 12:10:07,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:07,303 INFO L225 Difference]: With dead ends: 158 [2018-11-23 12:10:07,303 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 12:10:07,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:10:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 12:10:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-11-23 12:10:07,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:07,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 95 states. [2018-11-23 12:10:07,347 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 95 states. [2018-11-23 12:10:07,347 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 95 states. [2018-11-23 12:10:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:07,350 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-11-23 12:10:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-11-23 12:10:07,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:07,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:07,351 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 97 states. [2018-11-23 12:10:07,351 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 97 states. [2018-11-23 12:10:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:07,355 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-11-23 12:10:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-11-23 12:10:07,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:07,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:07,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:07,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:10:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2018-11-23 12:10:07,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 33 [2018-11-23 12:10:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:07,360 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2018-11-23 12:10:07,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:10:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2018-11-23 12:10:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:10:07,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:07,361 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:07,362 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:07,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1847287839, now seen corresponding path program 11 times [2018-11-23 12:10:07,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:07,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:07,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:07,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {4781#true} call ULTIMATE.init(); {4781#true} is VALID [2018-11-23 12:10:07,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {4781#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4781#true} is VALID [2018-11-23 12:10:07,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {4781#true} assume true; {4781#true} is VALID [2018-11-23 12:10:07,954 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4781#true} {4781#true} #54#return; {4781#true} is VALID [2018-11-23 12:10:07,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {4781#true} call #t~ret3 := main(); {4781#true} is VALID [2018-11-23 12:10:07,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {4781#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4783#(= main_~i~0 0)} is VALID [2018-11-23 12:10:07,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {4783#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4783#(= main_~i~0 0)} is VALID [2018-11-23 12:10:07,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {4783#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4784#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:07,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {4784#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4784#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:07,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {4784#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4785#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:07,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {4785#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4785#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:07,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {4785#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4786#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:07,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {4786#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4786#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:07,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {4786#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4787#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:07,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {4787#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4787#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:07,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {4787#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4788#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:07,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {4788#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4788#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:07,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {4788#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4789#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:07,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {4789#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4789#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:07,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {4789#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4790#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:07,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {4790#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4790#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:07,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {4790#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4791#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:07,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {4791#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4791#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:07,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {4791#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4792#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:07,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {4792#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4792#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:07,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {4792#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4793#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:07,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {4793#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4793#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:07,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {4793#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4794#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:07,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {4794#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4782#false} is VALID [2018-11-23 12:10:07,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {4782#false} ~i~0 := 0; {4782#false} is VALID [2018-11-23 12:10:07,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {4782#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4782#false} is VALID [2018-11-23 12:10:07,987 INFO L256 TraceCheckUtils]: 31: Hoare triple {4782#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {4782#false} is VALID [2018-11-23 12:10:07,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {4782#false} ~cond := #in~cond; {4782#false} is VALID [2018-11-23 12:10:07,988 INFO L273 TraceCheckUtils]: 33: Hoare triple {4782#false} assume 0 == ~cond; {4782#false} is VALID [2018-11-23 12:10:07,988 INFO L273 TraceCheckUtils]: 34: Hoare triple {4782#false} assume !false; {4782#false} is VALID [2018-11-23 12:10:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:07,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:07,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:08,001 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:10:08,049 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:10:08,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:08,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:08,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {4781#true} call ULTIMATE.init(); {4781#true} is VALID [2018-11-23 12:10:08,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {4781#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4781#true} is VALID [2018-11-23 12:10:08,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {4781#true} assume true; {4781#true} is VALID [2018-11-23 12:10:08,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4781#true} {4781#true} #54#return; {4781#true} is VALID [2018-11-23 12:10:08,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {4781#true} call #t~ret3 := main(); {4781#true} is VALID [2018-11-23 12:10:08,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {4781#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4813#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:08,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {4813#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4813#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:08,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {4813#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4784#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:08,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {4784#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4784#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:08,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {4784#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4785#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:08,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {4785#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4785#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:08,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {4785#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4786#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:08,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {4786#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4786#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:08,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {4786#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4787#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:08,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {4787#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4787#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:08,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {4787#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4788#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:08,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {4788#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4788#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:08,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {4788#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4789#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:08,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {4789#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4789#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:08,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {4789#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4790#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:08,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {4790#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4790#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:08,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {4790#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4791#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:08,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {4791#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4791#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:08,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {4791#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4792#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:08,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {4792#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4792#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:08,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {4792#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4793#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:08,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {4793#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4793#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:08,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {4793#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4794#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:08,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {4794#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4782#false} is VALID [2018-11-23 12:10:08,235 INFO L273 TraceCheckUtils]: 29: Hoare triple {4782#false} ~i~0 := 0; {4782#false} is VALID [2018-11-23 12:10:08,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {4782#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4782#false} is VALID [2018-11-23 12:10:08,235 INFO L256 TraceCheckUtils]: 31: Hoare triple {4782#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {4782#false} is VALID [2018-11-23 12:10:08,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {4782#false} ~cond := #in~cond; {4782#false} is VALID [2018-11-23 12:10:08,236 INFO L273 TraceCheckUtils]: 33: Hoare triple {4782#false} assume 0 == ~cond; {4782#false} is VALID [2018-11-23 12:10:08,236 INFO L273 TraceCheckUtils]: 34: Hoare triple {4782#false} assume !false; {4782#false} is VALID [2018-11-23 12:10:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:08,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:08,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:10:08,259 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-23 12:10:08,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:08,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:10:08,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:08,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:10:08,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:10:08,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:10:08,318 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand 15 states. [2018-11-23 12:10:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:09,339 INFO L93 Difference]: Finished difference Result 170 states and 198 transitions. [2018-11-23 12:10:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:10:09,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-23 12:10:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:10:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 133 transitions. [2018-11-23 12:10:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:10:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 133 transitions. [2018-11-23 12:10:09,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 133 transitions. [2018-11-23 12:10:09,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:09,872 INFO L225 Difference]: With dead ends: 170 [2018-11-23 12:10:09,872 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:10:09,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:10:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:10:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-23 12:10:09,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:09,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-23 12:10:09,910 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-23 12:10:09,911 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-23 12:10:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:09,915 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-11-23 12:10:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-11-23 12:10:09,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:09,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:09,916 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-23 12:10:09,916 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-23 12:10:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:09,919 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-11-23 12:10:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-11-23 12:10:09,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:09,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:09,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:09,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:10:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-11-23 12:10:09,923 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 35 [2018-11-23 12:10:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:09,924 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-11-23 12:10:09,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:10:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-11-23 12:10:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:10:09,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:09,925 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:09,925 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:09,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1539931841, now seen corresponding path program 12 times [2018-11-23 12:10:09,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:09,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:09,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:09,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:09,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:10,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {5493#true} call ULTIMATE.init(); {5493#true} is VALID [2018-11-23 12:10:10,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {5493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5493#true} is VALID [2018-11-23 12:10:10,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {5493#true} assume true; {5493#true} is VALID [2018-11-23 12:10:10,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5493#true} {5493#true} #54#return; {5493#true} is VALID [2018-11-23 12:10:10,220 INFO L256 TraceCheckUtils]: 4: Hoare triple {5493#true} call #t~ret3 := main(); {5493#true} is VALID [2018-11-23 12:10:10,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {5493#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5495#(= main_~i~0 0)} is VALID [2018-11-23 12:10:10,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {5495#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5495#(= main_~i~0 0)} is VALID [2018-11-23 12:10:10,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {5495#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5496#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:10,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {5496#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5496#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:10,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {5496#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5497#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:10,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {5497#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5497#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:10,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {5497#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5498#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:10,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {5498#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5498#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:10,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {5498#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5499#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:10,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {5499#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5499#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:10,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {5499#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5500#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:10,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {5500#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5500#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:10,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {5500#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5501#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:10,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {5501#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5501#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:10,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {5501#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5502#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:10,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {5502#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5502#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:10,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {5502#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5503#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:10,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {5503#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5503#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:10,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {5503#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5504#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:10,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {5504#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5504#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:10,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {5504#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5505#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:10,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {5505#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5505#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:10,241 INFO L273 TraceCheckUtils]: 27: Hoare triple {5505#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5506#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:10,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {5506#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5506#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:10,243 INFO L273 TraceCheckUtils]: 29: Hoare triple {5506#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5507#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:10,244 INFO L273 TraceCheckUtils]: 30: Hoare triple {5507#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5494#false} is VALID [2018-11-23 12:10:10,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {5494#false} ~i~0 := 0; {5494#false} is VALID [2018-11-23 12:10:10,244 INFO L273 TraceCheckUtils]: 32: Hoare triple {5494#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5494#false} is VALID [2018-11-23 12:10:10,244 INFO L256 TraceCheckUtils]: 33: Hoare triple {5494#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {5494#false} is VALID [2018-11-23 12:10:10,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {5494#false} ~cond := #in~cond; {5494#false} is VALID [2018-11-23 12:10:10,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {5494#false} assume 0 == ~cond; {5494#false} is VALID [2018-11-23 12:10:10,245 INFO L273 TraceCheckUtils]: 36: Hoare triple {5494#false} assume !false; {5494#false} is VALID [2018-11-23 12:10:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:10,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:10,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 12:10:10,260 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:10:10,322 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:10:10,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:10,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:10,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {5493#true} call ULTIMATE.init(); {5493#true} is VALID [2018-11-23 12:10:10,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {5493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5493#true} is VALID [2018-11-23 12:10:10,493 INFO L273 TraceCheckUtils]: 2: Hoare triple {5493#true} assume true; {5493#true} is VALID [2018-11-23 12:10:10,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5493#true} {5493#true} #54#return; {5493#true} is VALID [2018-11-23 12:10:10,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {5493#true} call #t~ret3 := main(); {5493#true} is VALID [2018-11-23 12:10:10,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {5493#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5526#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:10,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {5526#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5526#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:10,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {5526#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5496#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:10,496 INFO L273 TraceCheckUtils]: 8: Hoare triple {5496#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5496#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:10,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {5496#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5497#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:10,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {5497#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5497#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:10,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {5497#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5498#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:10,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {5498#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5498#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:10,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {5498#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5499#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:10,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {5499#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5499#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:10,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {5499#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5500#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:10,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {5500#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5500#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:10,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {5500#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5501#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:10,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {5501#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5501#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:10,502 INFO L273 TraceCheckUtils]: 19: Hoare triple {5501#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5502#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:10,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {5502#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5502#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:10,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {5502#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5503#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:10,504 INFO L273 TraceCheckUtils]: 22: Hoare triple {5503#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5503#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:10,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {5503#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5504#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:10,505 INFO L273 TraceCheckUtils]: 24: Hoare triple {5504#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5504#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:10,506 INFO L273 TraceCheckUtils]: 25: Hoare triple {5504#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5505#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:10,506 INFO L273 TraceCheckUtils]: 26: Hoare triple {5505#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5505#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:10,507 INFO L273 TraceCheckUtils]: 27: Hoare triple {5505#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5506#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:10,508 INFO L273 TraceCheckUtils]: 28: Hoare triple {5506#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5506#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:10,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {5506#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5507#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:10,509 INFO L273 TraceCheckUtils]: 30: Hoare triple {5507#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5494#false} is VALID [2018-11-23 12:10:10,509 INFO L273 TraceCheckUtils]: 31: Hoare triple {5494#false} ~i~0 := 0; {5494#false} is VALID [2018-11-23 12:10:10,510 INFO L273 TraceCheckUtils]: 32: Hoare triple {5494#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5494#false} is VALID [2018-11-23 12:10:10,510 INFO L256 TraceCheckUtils]: 33: Hoare triple {5494#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {5494#false} is VALID [2018-11-23 12:10:10,510 INFO L273 TraceCheckUtils]: 34: Hoare triple {5494#false} ~cond := #in~cond; {5494#false} is VALID [2018-11-23 12:10:10,510 INFO L273 TraceCheckUtils]: 35: Hoare triple {5494#false} assume 0 == ~cond; {5494#false} is VALID [2018-11-23 12:10:10,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {5494#false} assume !false; {5494#false} is VALID [2018-11-23 12:10:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:10,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:10,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:10:10,532 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-23 12:10:10,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:10,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:10:10,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:10,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:10:10,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:10:10,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:10:10,571 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 16 states. [2018-11-23 12:10:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:11,102 INFO L93 Difference]: Finished difference Result 182 states and 212 transitions. [2018-11-23 12:10:11,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:10:11,103 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-23 12:10:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:10:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2018-11-23 12:10:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:10:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2018-11-23 12:10:11,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 141 transitions. [2018-11-23 12:10:11,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:11,600 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:10:11,600 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 12:10:11,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:10:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 12:10:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-23 12:10:11,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:11,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 109 states. [2018-11-23 12:10:11,665 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 109 states. [2018-11-23 12:10:11,666 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 109 states. [2018-11-23 12:10:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:11,670 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-11-23 12:10:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2018-11-23 12:10:11,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:11,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:11,671 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 111 states. [2018-11-23 12:10:11,671 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 111 states. [2018-11-23 12:10:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:11,674 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-11-23 12:10:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2018-11-23 12:10:11,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:11,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:11,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:11,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 12:10:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2018-11-23 12:10:11,679 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 37 [2018-11-23 12:10:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:11,679 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2018-11-23 12:10:11,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:10:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2018-11-23 12:10:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:10:11,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:11,680 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:11,680 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:11,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1771406109, now seen corresponding path program 13 times [2018-11-23 12:10:11,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:11,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:11,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:12,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {6253#true} call ULTIMATE.init(); {6253#true} is VALID [2018-11-23 12:10:12,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {6253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6253#true} is VALID [2018-11-23 12:10:12,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {6253#true} assume true; {6253#true} is VALID [2018-11-23 12:10:12,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6253#true} {6253#true} #54#return; {6253#true} is VALID [2018-11-23 12:10:12,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {6253#true} call #t~ret3 := main(); {6253#true} is VALID [2018-11-23 12:10:12,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {6253#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6255#(= main_~i~0 0)} is VALID [2018-11-23 12:10:12,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {6255#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6255#(= main_~i~0 0)} is VALID [2018-11-23 12:10:12,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {6255#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6256#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:12,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {6256#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6256#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:12,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {6256#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6257#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:12,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {6257#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6257#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:12,389 INFO L273 TraceCheckUtils]: 11: Hoare triple {6257#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6258#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:12,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {6258#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6258#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:12,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {6258#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6259#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:12,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {6259#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6259#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:12,391 INFO L273 TraceCheckUtils]: 15: Hoare triple {6259#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6260#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:12,391 INFO L273 TraceCheckUtils]: 16: Hoare triple {6260#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6260#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:12,392 INFO L273 TraceCheckUtils]: 17: Hoare triple {6260#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6261#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:12,392 INFO L273 TraceCheckUtils]: 18: Hoare triple {6261#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6261#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:12,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {6261#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6262#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:12,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {6262#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6262#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:12,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {6262#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6263#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:12,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {6263#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6263#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:12,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {6263#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6264#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:12,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {6264#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6264#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:12,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {6264#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6265#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:12,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {6265#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6265#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:12,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {6265#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6266#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:12,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {6266#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6266#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:12,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {6266#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6267#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:12,400 INFO L273 TraceCheckUtils]: 30: Hoare triple {6267#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6267#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:12,401 INFO L273 TraceCheckUtils]: 31: Hoare triple {6267#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6268#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:12,402 INFO L273 TraceCheckUtils]: 32: Hoare triple {6268#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6254#false} is VALID [2018-11-23 12:10:12,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {6254#false} ~i~0 := 0; {6254#false} is VALID [2018-11-23 12:10:12,402 INFO L273 TraceCheckUtils]: 34: Hoare triple {6254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6254#false} is VALID [2018-11-23 12:10:12,402 INFO L256 TraceCheckUtils]: 35: Hoare triple {6254#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {6254#false} is VALID [2018-11-23 12:10:12,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {6254#false} ~cond := #in~cond; {6254#false} is VALID [2018-11-23 12:10:12,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {6254#false} assume 0 == ~cond; {6254#false} is VALID [2018-11-23 12:10:12,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {6254#false} assume !false; {6254#false} is VALID [2018-11-23 12:10:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:12,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:12,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:12,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:12,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:12,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {6253#true} call ULTIMATE.init(); {6253#true} is VALID [2018-11-23 12:10:12,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {6253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6253#true} is VALID [2018-11-23 12:10:12,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {6253#true} assume true; {6253#true} is VALID [2018-11-23 12:10:12,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6253#true} {6253#true} #54#return; {6253#true} is VALID [2018-11-23 12:10:12,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {6253#true} call #t~ret3 := main(); {6253#true} is VALID [2018-11-23 12:10:12,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {6253#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6287#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:12,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {6287#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6287#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:12,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {6287#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6256#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:12,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {6256#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6256#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:12,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {6256#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6257#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:12,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {6257#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6257#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:12,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {6257#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6258#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:12,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {6258#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6258#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:12,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {6258#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6259#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:12,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {6259#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6259#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:12,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {6259#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6260#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:12,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {6260#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6260#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:12,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {6260#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6261#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:12,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {6261#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6261#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:12,564 INFO L273 TraceCheckUtils]: 19: Hoare triple {6261#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6262#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:12,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {6262#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6262#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:12,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {6262#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6263#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:12,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {6263#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6263#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:12,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {6263#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6264#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:12,566 INFO L273 TraceCheckUtils]: 24: Hoare triple {6264#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6264#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:12,567 INFO L273 TraceCheckUtils]: 25: Hoare triple {6264#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6265#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:12,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {6265#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6265#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:12,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {6265#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6266#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:12,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {6266#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6266#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:12,568 INFO L273 TraceCheckUtils]: 29: Hoare triple {6266#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6267#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:12,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {6267#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6267#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:12,569 INFO L273 TraceCheckUtils]: 31: Hoare triple {6267#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6268#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:12,570 INFO L273 TraceCheckUtils]: 32: Hoare triple {6268#(<= main_~i~0 13)} assume !(~i~0 < 100000); {6254#false} is VALID [2018-11-23 12:10:12,570 INFO L273 TraceCheckUtils]: 33: Hoare triple {6254#false} ~i~0 := 0; {6254#false} is VALID [2018-11-23 12:10:12,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {6254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6254#false} is VALID [2018-11-23 12:10:12,570 INFO L256 TraceCheckUtils]: 35: Hoare triple {6254#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {6254#false} is VALID [2018-11-23 12:10:12,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {6254#false} ~cond := #in~cond; {6254#false} is VALID [2018-11-23 12:10:12,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {6254#false} assume 0 == ~cond; {6254#false} is VALID [2018-11-23 12:10:12,571 INFO L273 TraceCheckUtils]: 38: Hoare triple {6254#false} assume !false; {6254#false} is VALID [2018-11-23 12:10:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:12,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:12,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:10:12,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-23 12:10:12,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:12,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:10:12,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:12,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:10:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:10:12,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:10:12,634 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 17 states. [2018-11-23 12:10:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:14,441 INFO L93 Difference]: Finished difference Result 194 states and 226 transitions. [2018-11-23 12:10:14,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:10:14,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-11-23 12:10:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:10:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 149 transitions. [2018-11-23 12:10:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:10:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 149 transitions. [2018-11-23 12:10:14,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 149 transitions. [2018-11-23 12:10:14,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:14,995 INFO L225 Difference]: With dead ends: 194 [2018-11-23 12:10:14,995 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 12:10:14,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 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 12:10:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 12:10:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-11-23 12:10:15,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:15,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 116 states. [2018-11-23 12:10:15,137 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 116 states. [2018-11-23 12:10:15,137 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 116 states. [2018-11-23 12:10:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:15,142 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2018-11-23 12:10:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2018-11-23 12:10:15,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:15,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:15,143 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 118 states. [2018-11-23 12:10:15,143 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 118 states. [2018-11-23 12:10:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:15,149 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2018-11-23 12:10:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2018-11-23 12:10:15,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:15,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:15,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:15,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 12:10:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-11-23 12:10:15,155 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 39 [2018-11-23 12:10:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:15,155 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-11-23 12:10:15,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:10:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-11-23 12:10:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:10:15,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:15,157 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:15,158 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:15,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:15,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1396409723, now seen corresponding path program 14 times [2018-11-23 12:10:15,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:15,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:15,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:15,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:15,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:15,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {7061#true} call ULTIMATE.init(); {7061#true} is VALID [2018-11-23 12:10:15,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {7061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7061#true} is VALID [2018-11-23 12:10:15,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {7061#true} assume true; {7061#true} is VALID [2018-11-23 12:10:15,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7061#true} {7061#true} #54#return; {7061#true} is VALID [2018-11-23 12:10:15,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {7061#true} call #t~ret3 := main(); {7061#true} is VALID [2018-11-23 12:10:15,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {7061#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7063#(= main_~i~0 0)} is VALID [2018-11-23 12:10:15,507 INFO L273 TraceCheckUtils]: 6: Hoare triple {7063#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7063#(= main_~i~0 0)} is VALID [2018-11-23 12:10:15,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {7063#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7064#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:15,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {7064#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7064#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:15,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {7064#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7065#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:15,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {7065#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7065#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:15,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {7065#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7066#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:15,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {7066#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7066#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:15,510 INFO L273 TraceCheckUtils]: 13: Hoare triple {7066#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7067#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:15,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {7067#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7067#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:15,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {7067#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7068#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:15,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {7068#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7068#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:15,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {7068#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7069#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:15,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {7069#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7069#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:15,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {7069#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7070#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:15,515 INFO L273 TraceCheckUtils]: 20: Hoare triple {7070#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7070#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:15,515 INFO L273 TraceCheckUtils]: 21: Hoare triple {7070#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7071#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:15,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {7071#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7071#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:15,517 INFO L273 TraceCheckUtils]: 23: Hoare triple {7071#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7072#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:15,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {7072#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7072#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:15,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {7072#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7073#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:15,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {7073#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7073#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:15,519 INFO L273 TraceCheckUtils]: 27: Hoare triple {7073#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7074#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:15,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {7074#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7074#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:15,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {7074#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7075#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:15,521 INFO L273 TraceCheckUtils]: 30: Hoare triple {7075#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7075#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:15,522 INFO L273 TraceCheckUtils]: 31: Hoare triple {7075#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7076#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:15,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {7076#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7076#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:15,523 INFO L273 TraceCheckUtils]: 33: Hoare triple {7076#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7077#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:15,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {7077#(<= main_~i~0 14)} assume !(~i~0 < 100000); {7062#false} is VALID [2018-11-23 12:10:15,524 INFO L273 TraceCheckUtils]: 35: Hoare triple {7062#false} ~i~0 := 0; {7062#false} is VALID [2018-11-23 12:10:15,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {7062#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7062#false} is VALID [2018-11-23 12:10:15,525 INFO L256 TraceCheckUtils]: 37: Hoare triple {7062#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {7062#false} is VALID [2018-11-23 12:10:15,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {7062#false} ~cond := #in~cond; {7062#false} is VALID [2018-11-23 12:10:15,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {7062#false} assume 0 == ~cond; {7062#false} is VALID [2018-11-23 12:10:15,525 INFO L273 TraceCheckUtils]: 40: Hoare triple {7062#false} assume !false; {7062#false} is VALID [2018-11-23 12:10:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:15,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:15,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:15,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:10:15,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:10:15,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:15,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:15,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {7061#true} call ULTIMATE.init(); {7061#true} is VALID [2018-11-23 12:10:15,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {7061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7061#true} is VALID [2018-11-23 12:10:15,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {7061#true} assume true; {7061#true} is VALID [2018-11-23 12:10:15,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7061#true} {7061#true} #54#return; {7061#true} is VALID [2018-11-23 12:10:15,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {7061#true} call #t~ret3 := main(); {7061#true} is VALID [2018-11-23 12:10:15,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {7061#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7096#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:15,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {7096#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7096#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:15,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {7096#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7064#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:15,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {7064#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7064#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:15,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {7064#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7065#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:15,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {7065#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7065#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:15,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {7065#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7066#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:15,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {7066#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7066#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:15,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {7066#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7067#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:15,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {7067#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7067#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:15,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {7067#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7068#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:15,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {7068#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7068#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:15,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {7068#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7069#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:15,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {7069#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7069#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:15,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {7069#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7070#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:15,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {7070#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7070#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:15,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {7070#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7071#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:15,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {7071#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7071#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:15,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {7071#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7072#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:15,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {7072#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7072#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:15,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {7072#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7073#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:15,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {7073#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7073#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:15,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {7073#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7074#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:15,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {7074#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7074#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:15,802 INFO L273 TraceCheckUtils]: 29: Hoare triple {7074#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7075#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:15,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {7075#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7075#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:15,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {7075#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7076#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:15,804 INFO L273 TraceCheckUtils]: 32: Hoare triple {7076#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7076#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:15,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {7076#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7077#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:15,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {7077#(<= main_~i~0 14)} assume !(~i~0 < 100000); {7062#false} is VALID [2018-11-23 12:10:15,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {7062#false} ~i~0 := 0; {7062#false} is VALID [2018-11-23 12:10:15,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {7062#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7062#false} is VALID [2018-11-23 12:10:15,806 INFO L256 TraceCheckUtils]: 37: Hoare triple {7062#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {7062#false} is VALID [2018-11-23 12:10:15,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {7062#false} ~cond := #in~cond; {7062#false} is VALID [2018-11-23 12:10:15,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {7062#false} assume 0 == ~cond; {7062#false} is VALID [2018-11-23 12:10:15,806 INFO L273 TraceCheckUtils]: 40: Hoare triple {7062#false} assume !false; {7062#false} is VALID [2018-11-23 12:10:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:15,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:15,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:10:15,827 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 12:10:15,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:15,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:10:15,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:15,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:10:15,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:10:15,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:10:15,871 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 18 states. [2018-11-23 12:10:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:16,548 INFO L93 Difference]: Finished difference Result 206 states and 240 transitions. [2018-11-23 12:10:16,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:10:16,548 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-11-23 12:10:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:10:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 157 transitions. [2018-11-23 12:10:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:10:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 157 transitions. [2018-11-23 12:10:16,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 157 transitions. [2018-11-23 12:10:17,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:17,317 INFO L225 Difference]: With dead ends: 206 [2018-11-23 12:10:17,317 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:10:17,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:10:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:10:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:10:17,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:17,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:10:17,366 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:10:17,366 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:10:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:17,370 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-11-23 12:10:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2018-11-23 12:10:17,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:17,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:17,371 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:10:17,371 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:10:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:17,376 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-11-23 12:10:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2018-11-23 12:10:17,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:17,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:17,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:17,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:10:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2018-11-23 12:10:17,382 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 41 [2018-11-23 12:10:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:17,382 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2018-11-23 12:10:17,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:10:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2018-11-23 12:10:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:10:17,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:17,383 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:17,383 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:17,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:17,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1802135641, now seen corresponding path program 15 times [2018-11-23 12:10:17,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:17,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:17,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:18,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {7917#true} call ULTIMATE.init(); {7917#true} is VALID [2018-11-23 12:10:18,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {7917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7917#true} is VALID [2018-11-23 12:10:18,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {7917#true} assume true; {7917#true} is VALID [2018-11-23 12:10:18,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7917#true} {7917#true} #54#return; {7917#true} is VALID [2018-11-23 12:10:18,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {7917#true} call #t~ret3 := main(); {7917#true} is VALID [2018-11-23 12:10:18,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {7917#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7919#(= main_~i~0 0)} is VALID [2018-11-23 12:10:18,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {7919#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7919#(= main_~i~0 0)} is VALID [2018-11-23 12:10:18,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {7919#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7920#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:18,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {7920#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7920#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:18,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {7920#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7921#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:18,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {7921#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7921#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:18,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {7921#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7922#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:18,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {7922#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7922#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:18,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {7922#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7923#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:18,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {7923#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7923#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:18,277 INFO L273 TraceCheckUtils]: 15: Hoare triple {7923#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7924#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:18,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {7924#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7924#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:18,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {7924#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7925#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:18,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {7925#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7925#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:18,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {7925#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7926#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:18,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {7926#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7926#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:18,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {7926#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7927#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:18,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {7927#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7927#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:18,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {7927#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7928#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:18,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {7928#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7928#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:18,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {7928#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7929#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:18,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {7929#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7929#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:18,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {7929#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7930#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:18,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {7930#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7930#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:18,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {7930#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7931#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:18,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {7931#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7931#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:18,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {7931#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7932#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:18,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {7932#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7932#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:18,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {7932#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7933#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:18,292 INFO L273 TraceCheckUtils]: 34: Hoare triple {7933#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7933#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:18,292 INFO L273 TraceCheckUtils]: 35: Hoare triple {7933#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7934#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:18,293 INFO L273 TraceCheckUtils]: 36: Hoare triple {7934#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7918#false} is VALID [2018-11-23 12:10:18,294 INFO L273 TraceCheckUtils]: 37: Hoare triple {7918#false} ~i~0 := 0; {7918#false} is VALID [2018-11-23 12:10:18,294 INFO L273 TraceCheckUtils]: 38: Hoare triple {7918#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7918#false} is VALID [2018-11-23 12:10:18,294 INFO L256 TraceCheckUtils]: 39: Hoare triple {7918#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {7918#false} is VALID [2018-11-23 12:10:18,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {7918#false} ~cond := #in~cond; {7918#false} is VALID [2018-11-23 12:10:18,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {7918#false} assume 0 == ~cond; {7918#false} is VALID [2018-11-23 12:10:18,295 INFO L273 TraceCheckUtils]: 42: Hoare triple {7918#false} assume !false; {7918#false} is VALID [2018-11-23 12:10:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:18,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:18,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:18,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:10:18,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 12:10:18,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:18,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:18,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {7917#true} call ULTIMATE.init(); {7917#true} is VALID [2018-11-23 12:10:18,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {7917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7917#true} is VALID [2018-11-23 12:10:18,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {7917#true} assume true; {7917#true} is VALID [2018-11-23 12:10:18,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7917#true} {7917#true} #54#return; {7917#true} is VALID [2018-11-23 12:10:18,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {7917#true} call #t~ret3 := main(); {7917#true} is VALID [2018-11-23 12:10:18,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {7917#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7953#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:18,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {7953#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7953#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:18,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {7953#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7920#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:18,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {7920#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7920#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:18,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {7920#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7921#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:18,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {7921#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7921#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:18,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {7921#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7922#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:18,684 INFO L273 TraceCheckUtils]: 12: Hoare triple {7922#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7922#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:18,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {7922#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7923#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:18,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {7923#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7923#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:18,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {7923#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7924#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:18,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {7924#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7924#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:18,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {7924#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7925#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:18,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {7925#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7925#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:18,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {7925#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7926#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:18,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {7926#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7926#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:18,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {7926#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7927#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:18,697 INFO L273 TraceCheckUtils]: 22: Hoare triple {7927#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7927#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:18,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {7927#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7928#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:18,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {7928#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7928#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:18,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {7928#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7929#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:18,703 INFO L273 TraceCheckUtils]: 26: Hoare triple {7929#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7929#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:18,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {7929#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7930#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:18,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {7930#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7930#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:18,706 INFO L273 TraceCheckUtils]: 29: Hoare triple {7930#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7931#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:18,708 INFO L273 TraceCheckUtils]: 30: Hoare triple {7931#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7931#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:18,708 INFO L273 TraceCheckUtils]: 31: Hoare triple {7931#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7932#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:18,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {7932#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7932#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:18,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {7932#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7933#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:18,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {7933#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7933#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:18,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {7933#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7934#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:18,717 INFO L273 TraceCheckUtils]: 36: Hoare triple {7934#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7918#false} is VALID [2018-11-23 12:10:18,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {7918#false} ~i~0 := 0; {7918#false} is VALID [2018-11-23 12:10:18,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {7918#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7918#false} is VALID [2018-11-23 12:10:18,717 INFO L256 TraceCheckUtils]: 39: Hoare triple {7918#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {7918#false} is VALID [2018-11-23 12:10:18,717 INFO L273 TraceCheckUtils]: 40: Hoare triple {7918#false} ~cond := #in~cond; {7918#false} is VALID [2018-11-23 12:10:18,717 INFO L273 TraceCheckUtils]: 41: Hoare triple {7918#false} assume 0 == ~cond; {7918#false} is VALID [2018-11-23 12:10:18,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {7918#false} assume !false; {7918#false} is VALID [2018-11-23 12:10:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:18,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:18,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:10:18,738 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-23 12:10:18,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:18,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:10:18,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:18,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:10:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:10:18,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:10:18,814 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand 19 states. [2018-11-23 12:10:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:19,789 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2018-11-23 12:10:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:10:19,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-11-23 12:10:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:10:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 165 transitions. [2018-11-23 12:10:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:10:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 165 transitions. [2018-11-23 12:10:19,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 165 transitions. [2018-11-23 12:10:20,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:20,335 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:10:20,335 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 12:10:20,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:10:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 12:10:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-23 12:10:20,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:20,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 130 states. [2018-11-23 12:10:20,380 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 130 states. [2018-11-23 12:10:20,380 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 130 states. [2018-11-23 12:10:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:20,386 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2018-11-23 12:10:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2018-11-23 12:10:20,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:20,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:20,387 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 132 states. [2018-11-23 12:10:20,387 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 132 states. [2018-11-23 12:10:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:20,391 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2018-11-23 12:10:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2018-11-23 12:10:20,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:20,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:20,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:20,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 12:10:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-11-23 12:10:20,400 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 43 [2018-11-23 12:10:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:20,400 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-11-23 12:10:20,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:10:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-11-23 12:10:20,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:10:20,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:20,401 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:20,401 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:20,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash 862718903, now seen corresponding path program 16 times [2018-11-23 12:10:20,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:20,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:20,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:20,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:20,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:21,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {8821#true} call ULTIMATE.init(); {8821#true} is VALID [2018-11-23 12:10:21,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {8821#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8821#true} is VALID [2018-11-23 12:10:21,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {8821#true} assume true; {8821#true} is VALID [2018-11-23 12:10:21,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8821#true} {8821#true} #54#return; {8821#true} is VALID [2018-11-23 12:10:21,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {8821#true} call #t~ret3 := main(); {8821#true} is VALID [2018-11-23 12:10:21,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {8821#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8823#(= main_~i~0 0)} is VALID [2018-11-23 12:10:21,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {8823#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8823#(= main_~i~0 0)} is VALID [2018-11-23 12:10:21,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {8823#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8824#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:21,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {8824#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8824#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:21,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {8824#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8825#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:21,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {8825#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8825#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:21,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {8825#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8826#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:21,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {8826#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8826#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:21,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {8826#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8827#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:21,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {8827#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8827#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:21,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8828#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:21,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {8828#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8828#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:21,668 INFO L273 TraceCheckUtils]: 17: Hoare triple {8828#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8829#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:21,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {8829#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8829#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:21,669 INFO L273 TraceCheckUtils]: 19: Hoare triple {8829#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8830#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:21,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {8830#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8830#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:21,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {8830#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8831#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:21,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {8831#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8831#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:21,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {8831#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8832#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:21,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {8832#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8832#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:21,673 INFO L273 TraceCheckUtils]: 25: Hoare triple {8832#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8833#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:21,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {8833#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8833#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:21,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {8833#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8834#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:21,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {8834#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8834#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:21,675 INFO L273 TraceCheckUtils]: 29: Hoare triple {8834#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8835#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:21,676 INFO L273 TraceCheckUtils]: 30: Hoare triple {8835#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8835#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:21,677 INFO L273 TraceCheckUtils]: 31: Hoare triple {8835#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8836#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:21,677 INFO L273 TraceCheckUtils]: 32: Hoare triple {8836#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8836#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:21,678 INFO L273 TraceCheckUtils]: 33: Hoare triple {8836#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8837#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:21,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {8837#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8837#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:21,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {8837#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8838#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:21,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {8838#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8838#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:21,682 INFO L273 TraceCheckUtils]: 37: Hoare triple {8838#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8839#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:21,682 INFO L273 TraceCheckUtils]: 38: Hoare triple {8839#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8822#false} is VALID [2018-11-23 12:10:21,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {8822#false} ~i~0 := 0; {8822#false} is VALID [2018-11-23 12:10:21,683 INFO L273 TraceCheckUtils]: 40: Hoare triple {8822#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8822#false} is VALID [2018-11-23 12:10:21,683 INFO L256 TraceCheckUtils]: 41: Hoare triple {8822#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {8822#false} is VALID [2018-11-23 12:10:21,683 INFO L273 TraceCheckUtils]: 42: Hoare triple {8822#false} ~cond := #in~cond; {8822#false} is VALID [2018-11-23 12:10:21,683 INFO L273 TraceCheckUtils]: 43: Hoare triple {8822#false} assume 0 == ~cond; {8822#false} is VALID [2018-11-23 12:10:21,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {8822#false} assume !false; {8822#false} is VALID [2018-11-23 12:10:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:21,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:21,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:21,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:10:21,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:10:21,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:21,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:21,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {8821#true} call ULTIMATE.init(); {8821#true} is VALID [2018-11-23 12:10:21,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {8821#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8821#true} is VALID [2018-11-23 12:10:21,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {8821#true} assume true; {8821#true} is VALID [2018-11-23 12:10:21,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8821#true} {8821#true} #54#return; {8821#true} is VALID [2018-11-23 12:10:21,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {8821#true} call #t~ret3 := main(); {8821#true} is VALID [2018-11-23 12:10:21,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {8821#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8858#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:21,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {8858#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8858#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:21,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {8858#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8824#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:21,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {8824#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8824#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:21,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {8824#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8825#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:21,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {8825#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8825#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:21,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {8825#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8826#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:21,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {8826#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8826#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:21,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {8826#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8827#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:21,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {8827#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8827#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:21,864 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8828#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:21,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {8828#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8828#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:21,865 INFO L273 TraceCheckUtils]: 17: Hoare triple {8828#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8829#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:21,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {8829#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8829#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:21,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {8829#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8830#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:21,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {8830#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8830#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:21,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {8830#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8831#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:21,868 INFO L273 TraceCheckUtils]: 22: Hoare triple {8831#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8831#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:21,869 INFO L273 TraceCheckUtils]: 23: Hoare triple {8831#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8832#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:21,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {8832#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8832#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:21,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {8832#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8833#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:21,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {8833#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8833#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:21,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {8833#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8834#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:21,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {8834#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8834#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:21,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {8834#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8835#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:21,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {8835#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8835#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:21,874 INFO L273 TraceCheckUtils]: 31: Hoare triple {8835#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8836#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:21,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {8836#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8836#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:21,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {8836#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8837#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:21,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {8837#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8837#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:21,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {8837#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8838#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:21,878 INFO L273 TraceCheckUtils]: 36: Hoare triple {8838#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8838#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:21,878 INFO L273 TraceCheckUtils]: 37: Hoare triple {8838#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8839#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:21,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {8839#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8822#false} is VALID [2018-11-23 12:10:21,879 INFO L273 TraceCheckUtils]: 39: Hoare triple {8822#false} ~i~0 := 0; {8822#false} is VALID [2018-11-23 12:10:21,879 INFO L273 TraceCheckUtils]: 40: Hoare triple {8822#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8822#false} is VALID [2018-11-23 12:10:21,880 INFO L256 TraceCheckUtils]: 41: Hoare triple {8822#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {8822#false} is VALID [2018-11-23 12:10:21,880 INFO L273 TraceCheckUtils]: 42: Hoare triple {8822#false} ~cond := #in~cond; {8822#false} is VALID [2018-11-23 12:10:21,880 INFO L273 TraceCheckUtils]: 43: Hoare triple {8822#false} assume 0 == ~cond; {8822#false} is VALID [2018-11-23 12:10:21,880 INFO L273 TraceCheckUtils]: 44: Hoare triple {8822#false} assume !false; {8822#false} is VALID [2018-11-23 12:10:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:21,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:21,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:10:21,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-23 12:10:21,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:21,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:10:21,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:21,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:10:21,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:10:21,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:10:21,951 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 20 states. [2018-11-23 12:10:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:22,856 INFO L93 Difference]: Finished difference Result 230 states and 268 transitions. [2018-11-23 12:10:22,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:10:22,856 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-23 12:10:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:10:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 173 transitions. [2018-11-23 12:10:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:10:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 173 transitions. [2018-11-23 12:10:22,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 173 transitions. [2018-11-23 12:10:23,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:23,015 INFO L225 Difference]: With dead ends: 230 [2018-11-23 12:10:23,016 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 12:10:23,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:10:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 12:10:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-11-23 12:10:23,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:23,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 137 states. [2018-11-23 12:10:23,156 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 137 states. [2018-11-23 12:10:23,156 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 137 states. [2018-11-23 12:10:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:23,160 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2018-11-23 12:10:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2018-11-23 12:10:23,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:23,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:23,161 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 139 states. [2018-11-23 12:10:23,162 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 139 states. [2018-11-23 12:10:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:23,165 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2018-11-23 12:10:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2018-11-23 12:10:23,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:23,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:23,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:23,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 12:10:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2018-11-23 12:10:23,169 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 45 [2018-11-23 12:10:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:23,169 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2018-11-23 12:10:23,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:10:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2018-11-23 12:10:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:10:23,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:23,170 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:23,171 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:23,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:23,171 INFO L82 PathProgramCache]: Analyzing trace with hash 26365845, now seen corresponding path program 17 times [2018-11-23 12:10:23,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:23,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:23,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:23,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {9773#true} call ULTIMATE.init(); {9773#true} is VALID [2018-11-23 12:10:23,488 INFO L273 TraceCheckUtils]: 1: Hoare triple {9773#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9773#true} is VALID [2018-11-23 12:10:23,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {9773#true} assume true; {9773#true} is VALID [2018-11-23 12:10:23,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9773#true} {9773#true} #54#return; {9773#true} is VALID [2018-11-23 12:10:23,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {9773#true} call #t~ret3 := main(); {9773#true} is VALID [2018-11-23 12:10:23,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {9773#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9775#(= main_~i~0 0)} is VALID [2018-11-23 12:10:23,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {9775#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9775#(= main_~i~0 0)} is VALID [2018-11-23 12:10:23,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {9775#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9776#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:23,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {9776#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9776#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:23,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {9776#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9777#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:23,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {9777#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9777#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:23,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {9777#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9778#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:23,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {9778#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9778#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:23,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {9778#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9779#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:23,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {9779#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9779#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:23,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {9779#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9780#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:23,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {9780#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9780#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:23,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {9780#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9781#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:23,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {9781#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9781#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:23,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {9781#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9782#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:23,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {9782#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9782#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:23,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {9782#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9783#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:23,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {9783#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9783#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:23,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {9783#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9784#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:23,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {9784#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9784#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:23,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {9784#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9785#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:23,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {9785#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9785#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:23,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {9785#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9786#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:23,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {9786#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9786#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:23,505 INFO L273 TraceCheckUtils]: 29: Hoare triple {9786#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9787#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:23,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {9787#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9787#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:23,506 INFO L273 TraceCheckUtils]: 31: Hoare triple {9787#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9788#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:23,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {9788#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9788#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:23,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {9788#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9789#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:23,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {9789#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9789#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:23,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {9789#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9790#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:23,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {9790#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9790#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:23,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {9790#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9791#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:23,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {9791#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9791#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:23,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {9791#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9792#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:23,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {9792#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9774#false} is VALID [2018-11-23 12:10:23,512 INFO L273 TraceCheckUtils]: 41: Hoare triple {9774#false} ~i~0 := 0; {9774#false} is VALID [2018-11-23 12:10:23,512 INFO L273 TraceCheckUtils]: 42: Hoare triple {9774#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9774#false} is VALID [2018-11-23 12:10:23,512 INFO L256 TraceCheckUtils]: 43: Hoare triple {9774#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {9774#false} is VALID [2018-11-23 12:10:23,512 INFO L273 TraceCheckUtils]: 44: Hoare triple {9774#false} ~cond := #in~cond; {9774#false} is VALID [2018-11-23 12:10:23,513 INFO L273 TraceCheckUtils]: 45: Hoare triple {9774#false} assume 0 == ~cond; {9774#false} is VALID [2018-11-23 12:10:23,513 INFO L273 TraceCheckUtils]: 46: Hoare triple {9774#false} assume !false; {9774#false} is VALID [2018-11-23 12:10:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:23,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:23,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:23,525 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:10:23,640 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:10:23,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:23,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:23,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {9773#true} call ULTIMATE.init(); {9773#true} is VALID [2018-11-23 12:10:23,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {9773#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9773#true} is VALID [2018-11-23 12:10:23,967 INFO L273 TraceCheckUtils]: 2: Hoare triple {9773#true} assume true; {9773#true} is VALID [2018-11-23 12:10:23,967 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9773#true} {9773#true} #54#return; {9773#true} is VALID [2018-11-23 12:10:23,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {9773#true} call #t~ret3 := main(); {9773#true} is VALID [2018-11-23 12:10:23,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {9773#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9811#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:23,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {9811#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9811#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:23,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {9811#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9776#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:23,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {9776#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9776#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:23,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {9776#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9777#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:23,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {9777#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9777#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:23,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {9777#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9778#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:23,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {9778#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9778#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:23,979 INFO L273 TraceCheckUtils]: 13: Hoare triple {9778#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9779#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:23,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {9779#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9779#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:23,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {9779#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9780#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:23,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {9780#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9780#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:23,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {9780#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9781#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:23,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {9781#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9781#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:23,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {9781#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9782#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:23,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {9782#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9782#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:23,987 INFO L273 TraceCheckUtils]: 21: Hoare triple {9782#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9783#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:23,987 INFO L273 TraceCheckUtils]: 22: Hoare triple {9783#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9783#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:23,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {9783#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9784#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:23,989 INFO L273 TraceCheckUtils]: 24: Hoare triple {9784#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9784#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:23,992 INFO L273 TraceCheckUtils]: 25: Hoare triple {9784#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9785#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:23,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {9785#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9785#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:23,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {9785#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9786#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:23,995 INFO L273 TraceCheckUtils]: 28: Hoare triple {9786#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9786#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:23,998 INFO L273 TraceCheckUtils]: 29: Hoare triple {9786#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9787#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:23,998 INFO L273 TraceCheckUtils]: 30: Hoare triple {9787#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9787#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:24,001 INFO L273 TraceCheckUtils]: 31: Hoare triple {9787#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9788#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:24,001 INFO L273 TraceCheckUtils]: 32: Hoare triple {9788#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9788#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:24,003 INFO L273 TraceCheckUtils]: 33: Hoare triple {9788#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9789#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:24,003 INFO L273 TraceCheckUtils]: 34: Hoare triple {9789#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9789#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:24,006 INFO L273 TraceCheckUtils]: 35: Hoare triple {9789#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9790#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:24,006 INFO L273 TraceCheckUtils]: 36: Hoare triple {9790#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9790#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:24,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {9790#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9791#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:24,009 INFO L273 TraceCheckUtils]: 38: Hoare triple {9791#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9791#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:24,011 INFO L273 TraceCheckUtils]: 39: Hoare triple {9791#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9792#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:24,011 INFO L273 TraceCheckUtils]: 40: Hoare triple {9792#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9774#false} is VALID [2018-11-23 12:10:24,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {9774#false} ~i~0 := 0; {9774#false} is VALID [2018-11-23 12:10:24,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {9774#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9774#false} is VALID [2018-11-23 12:10:24,011 INFO L256 TraceCheckUtils]: 43: Hoare triple {9774#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {9774#false} is VALID [2018-11-23 12:10:24,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {9774#false} ~cond := #in~cond; {9774#false} is VALID [2018-11-23 12:10:24,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {9774#false} assume 0 == ~cond; {9774#false} is VALID [2018-11-23 12:10:24,012 INFO L273 TraceCheckUtils]: 46: Hoare triple {9774#false} assume !false; {9774#false} is VALID [2018-11-23 12:10:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:24,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:24,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:10:24,032 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-23 12:10:24,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:24,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:10:24,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:24,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:10:24,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:10:24,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:10:24,093 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 21 states. [2018-11-23 12:10:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:25,387 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2018-11-23 12:10:25,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:10:25,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-11-23 12:10:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:10:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2018-11-23 12:10:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:10:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2018-11-23 12:10:25,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 181 transitions. [2018-11-23 12:10:25,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:25,573 INFO L225 Difference]: With dead ends: 242 [2018-11-23 12:10:25,573 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:10:25,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:10:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:10:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-11-23 12:10:25,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:25,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 144 states. [2018-11-23 12:10:25,673 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 144 states. [2018-11-23 12:10:25,673 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 144 states. [2018-11-23 12:10:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:25,676 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2018-11-23 12:10:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-11-23 12:10:25,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:25,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:25,677 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 146 states. [2018-11-23 12:10:25,678 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 146 states. [2018-11-23 12:10:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:25,681 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2018-11-23 12:10:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2018-11-23 12:10:25,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:25,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:25,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:25,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 12:10:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2018-11-23 12:10:25,685 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 47 [2018-11-23 12:10:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:25,686 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2018-11-23 12:10:25,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:10:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2018-11-23 12:10:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:10:25,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:25,687 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:25,687 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:25,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:25,687 INFO L82 PathProgramCache]: Analyzing trace with hash -550038541, now seen corresponding path program 18 times [2018-11-23 12:10:25,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:25,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:25,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:25,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:25,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:26,548 INFO L256 TraceCheckUtils]: 0: Hoare triple {10773#true} call ULTIMATE.init(); {10773#true} is VALID [2018-11-23 12:10:26,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {10773#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10773#true} is VALID [2018-11-23 12:10:26,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {10773#true} assume true; {10773#true} is VALID [2018-11-23 12:10:26,549 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10773#true} {10773#true} #54#return; {10773#true} is VALID [2018-11-23 12:10:26,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {10773#true} call #t~ret3 := main(); {10773#true} is VALID [2018-11-23 12:10:26,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {10773#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10775#(= main_~i~0 0)} is VALID [2018-11-23 12:10:26,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {10775#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10775#(= main_~i~0 0)} is VALID [2018-11-23 12:10:26,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {10775#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10776#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:26,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {10776#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10776#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:26,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {10776#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10777#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:26,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {10777#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10777#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:26,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {10777#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10778#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:26,573 INFO L273 TraceCheckUtils]: 12: Hoare triple {10778#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10778#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:26,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {10778#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10779#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:26,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {10779#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10779#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:26,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {10779#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10780#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:26,575 INFO L273 TraceCheckUtils]: 16: Hoare triple {10780#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10780#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:26,576 INFO L273 TraceCheckUtils]: 17: Hoare triple {10780#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10781#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:26,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {10781#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10781#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:26,577 INFO L273 TraceCheckUtils]: 19: Hoare triple {10781#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10782#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:26,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {10782#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10782#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:26,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {10782#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10783#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:26,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {10783#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10783#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:26,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {10783#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10784#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:26,580 INFO L273 TraceCheckUtils]: 24: Hoare triple {10784#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10784#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:26,581 INFO L273 TraceCheckUtils]: 25: Hoare triple {10784#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10785#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:26,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {10785#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10785#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:26,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {10785#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10786#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:26,583 INFO L273 TraceCheckUtils]: 28: Hoare triple {10786#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10786#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:26,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {10786#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10787#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:26,584 INFO L273 TraceCheckUtils]: 30: Hoare triple {10787#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10787#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:26,584 INFO L273 TraceCheckUtils]: 31: Hoare triple {10787#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10788#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:26,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {10788#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10788#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:26,586 INFO L273 TraceCheckUtils]: 33: Hoare triple {10788#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10789#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:26,586 INFO L273 TraceCheckUtils]: 34: Hoare triple {10789#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10789#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:26,587 INFO L273 TraceCheckUtils]: 35: Hoare triple {10789#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10790#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:26,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {10790#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10790#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:26,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {10790#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10791#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:26,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {10791#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10791#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:26,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {10791#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10792#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:26,590 INFO L273 TraceCheckUtils]: 40: Hoare triple {10792#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10792#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:26,591 INFO L273 TraceCheckUtils]: 41: Hoare triple {10792#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10793#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:26,608 INFO L273 TraceCheckUtils]: 42: Hoare triple {10793#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10774#false} is VALID [2018-11-23 12:10:26,608 INFO L273 TraceCheckUtils]: 43: Hoare triple {10774#false} ~i~0 := 0; {10774#false} is VALID [2018-11-23 12:10:26,608 INFO L273 TraceCheckUtils]: 44: Hoare triple {10774#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10774#false} is VALID [2018-11-23 12:10:26,608 INFO L256 TraceCheckUtils]: 45: Hoare triple {10774#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {10774#false} is VALID [2018-11-23 12:10:26,609 INFO L273 TraceCheckUtils]: 46: Hoare triple {10774#false} ~cond := #in~cond; {10774#false} is VALID [2018-11-23 12:10:26,609 INFO L273 TraceCheckUtils]: 47: Hoare triple {10774#false} assume 0 == ~cond; {10774#false} is VALID [2018-11-23 12:10:26,609 INFO L273 TraceCheckUtils]: 48: Hoare triple {10774#false} assume !false; {10774#false} is VALID [2018-11-23 12:10:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:26,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:26,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:26,629 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:10:27,127 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:10:27,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:27,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:27,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {10773#true} call ULTIMATE.init(); {10773#true} is VALID [2018-11-23 12:10:27,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {10773#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10773#true} is VALID [2018-11-23 12:10:27,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {10773#true} assume true; {10773#true} is VALID [2018-11-23 12:10:27,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10773#true} {10773#true} #54#return; {10773#true} is VALID [2018-11-23 12:10:27,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {10773#true} call #t~ret3 := main(); {10773#true} is VALID [2018-11-23 12:10:27,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {10773#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10812#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:27,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {10812#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10812#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:27,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {10812#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10776#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:27,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {10776#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10776#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:27,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {10776#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10777#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:27,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {10777#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10777#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:27,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {10777#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10778#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:27,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {10778#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10778#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:27,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {10778#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10779#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:27,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {10779#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10779#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:27,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {10779#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10780#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:27,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {10780#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10780#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:27,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {10780#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10781#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:27,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {10781#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10781#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:27,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {10781#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10782#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:27,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {10782#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10782#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:27,344 INFO L273 TraceCheckUtils]: 21: Hoare triple {10782#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10783#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:27,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {10783#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10783#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:27,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {10783#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10784#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:27,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {10784#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10784#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:27,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {10784#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10785#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:27,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {10785#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10785#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:27,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {10785#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10786#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:27,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {10786#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10786#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:27,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {10786#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10787#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:27,348 INFO L273 TraceCheckUtils]: 30: Hoare triple {10787#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10787#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:27,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {10787#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10788#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:27,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {10788#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10788#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:27,350 INFO L273 TraceCheckUtils]: 33: Hoare triple {10788#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10789#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:27,351 INFO L273 TraceCheckUtils]: 34: Hoare triple {10789#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10789#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:27,352 INFO L273 TraceCheckUtils]: 35: Hoare triple {10789#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10790#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:27,352 INFO L273 TraceCheckUtils]: 36: Hoare triple {10790#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10790#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:27,353 INFO L273 TraceCheckUtils]: 37: Hoare triple {10790#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10791#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:27,353 INFO L273 TraceCheckUtils]: 38: Hoare triple {10791#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10791#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:27,354 INFO L273 TraceCheckUtils]: 39: Hoare triple {10791#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10792#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:27,355 INFO L273 TraceCheckUtils]: 40: Hoare triple {10792#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10792#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:27,355 INFO L273 TraceCheckUtils]: 41: Hoare triple {10792#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10793#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:27,356 INFO L273 TraceCheckUtils]: 42: Hoare triple {10793#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10774#false} is VALID [2018-11-23 12:10:27,356 INFO L273 TraceCheckUtils]: 43: Hoare triple {10774#false} ~i~0 := 0; {10774#false} is VALID [2018-11-23 12:10:27,357 INFO L273 TraceCheckUtils]: 44: Hoare triple {10774#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10774#false} is VALID [2018-11-23 12:10:27,357 INFO L256 TraceCheckUtils]: 45: Hoare triple {10774#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {10774#false} is VALID [2018-11-23 12:10:27,357 INFO L273 TraceCheckUtils]: 46: Hoare triple {10774#false} ~cond := #in~cond; {10774#false} is VALID [2018-11-23 12:10:27,357 INFO L273 TraceCheckUtils]: 47: Hoare triple {10774#false} assume 0 == ~cond; {10774#false} is VALID [2018-11-23 12:10:27,357 INFO L273 TraceCheckUtils]: 48: Hoare triple {10774#false} assume !false; {10774#false} is VALID [2018-11-23 12:10:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:27,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:27,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:10:27,380 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 12:10:27,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:27,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:10:27,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:27,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:10:27,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:10:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:10:27,431 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand 22 states. [2018-11-23 12:10:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:28,294 INFO L93 Difference]: Finished difference Result 254 states and 296 transitions. [2018-11-23 12:10:28,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:10:28,294 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-11-23 12:10:28,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:10:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 189 transitions. [2018-11-23 12:10:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:10:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 189 transitions. [2018-11-23 12:10:28,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 189 transitions. [2018-11-23 12:10:28,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:28,578 INFO L225 Difference]: With dead ends: 254 [2018-11-23 12:10:28,580 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 12:10:28,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:10:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 12:10:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-23 12:10:28,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:28,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 151 states. [2018-11-23 12:10:28,640 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 151 states. [2018-11-23 12:10:28,640 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 151 states. [2018-11-23 12:10:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:28,644 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-23 12:10:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-11-23 12:10:28,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:28,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:28,645 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 153 states. [2018-11-23 12:10:28,646 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 153 states. [2018-11-23 12:10:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:28,649 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-11-23 12:10:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2018-11-23 12:10:28,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:28,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:28,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:28,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 12:10:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2018-11-23 12:10:28,654 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 49 [2018-11-23 12:10:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:28,655 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2018-11-23 12:10:28,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:10:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2018-11-23 12:10:28,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:10:28,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:28,656 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:28,656 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:28,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:28,656 INFO L82 PathProgramCache]: Analyzing trace with hash -423872303, now seen corresponding path program 19 times [2018-11-23 12:10:28,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:28,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:28,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:28,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:28,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:29,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {11821#true} call ULTIMATE.init(); {11821#true} is VALID [2018-11-23 12:10:29,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {11821#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11821#true} is VALID [2018-11-23 12:10:29,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {11821#true} assume true; {11821#true} is VALID [2018-11-23 12:10:29,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11821#true} {11821#true} #54#return; {11821#true} is VALID [2018-11-23 12:10:29,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {11821#true} call #t~ret3 := main(); {11821#true} is VALID [2018-11-23 12:10:29,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {11821#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11823#(= main_~i~0 0)} is VALID [2018-11-23 12:10:29,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {11823#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11823#(= main_~i~0 0)} is VALID [2018-11-23 12:10:29,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {11823#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11824#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:29,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {11824#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11824#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:29,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {11824#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11825#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:29,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {11825#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11825#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:29,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {11825#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11826#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:29,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {11826#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11826#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:29,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {11826#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11827#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:29,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {11827#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11827#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:29,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {11827#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11828#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:29,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {11828#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11828#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:29,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {11828#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11829#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:29,376 INFO L273 TraceCheckUtils]: 18: Hoare triple {11829#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11829#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:29,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {11829#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11830#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:29,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {11830#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11830#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:29,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {11830#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11831#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:29,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {11831#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11831#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:29,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {11831#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11832#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:29,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {11832#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11832#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:29,381 INFO L273 TraceCheckUtils]: 25: Hoare triple {11832#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11833#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:29,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {11833#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11833#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:29,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {11833#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11834#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:29,382 INFO L273 TraceCheckUtils]: 28: Hoare triple {11834#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11834#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:29,383 INFO L273 TraceCheckUtils]: 29: Hoare triple {11834#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11835#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:29,384 INFO L273 TraceCheckUtils]: 30: Hoare triple {11835#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11835#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:29,384 INFO L273 TraceCheckUtils]: 31: Hoare triple {11835#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11836#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:29,385 INFO L273 TraceCheckUtils]: 32: Hoare triple {11836#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11836#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:29,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {11836#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11837#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:29,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {11837#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11837#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:29,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {11837#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11838#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:29,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {11838#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11838#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:29,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {11838#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11839#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:29,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {11839#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11839#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:29,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {11839#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11840#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:29,390 INFO L273 TraceCheckUtils]: 40: Hoare triple {11840#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11840#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:29,390 INFO L273 TraceCheckUtils]: 41: Hoare triple {11840#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11841#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:29,391 INFO L273 TraceCheckUtils]: 42: Hoare triple {11841#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11841#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:29,391 INFO L273 TraceCheckUtils]: 43: Hoare triple {11841#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11842#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:29,392 INFO L273 TraceCheckUtils]: 44: Hoare triple {11842#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11822#false} is VALID [2018-11-23 12:10:29,392 INFO L273 TraceCheckUtils]: 45: Hoare triple {11822#false} ~i~0 := 0; {11822#false} is VALID [2018-11-23 12:10:29,393 INFO L273 TraceCheckUtils]: 46: Hoare triple {11822#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11822#false} is VALID [2018-11-23 12:10:29,393 INFO L256 TraceCheckUtils]: 47: Hoare triple {11822#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {11822#false} is VALID [2018-11-23 12:10:29,393 INFO L273 TraceCheckUtils]: 48: Hoare triple {11822#false} ~cond := #in~cond; {11822#false} is VALID [2018-11-23 12:10:29,393 INFO L273 TraceCheckUtils]: 49: Hoare triple {11822#false} assume 0 == ~cond; {11822#false} is VALID [2018-11-23 12:10:29,393 INFO L273 TraceCheckUtils]: 50: Hoare triple {11822#false} assume !false; {11822#false} is VALID [2018-11-23 12:10:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:29,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:29,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:29,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:29,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:29,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {11821#true} call ULTIMATE.init(); {11821#true} is VALID [2018-11-23 12:10:29,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {11821#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11821#true} is VALID [2018-11-23 12:10:29,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {11821#true} assume true; {11821#true} is VALID [2018-11-23 12:10:29,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11821#true} {11821#true} #54#return; {11821#true} is VALID [2018-11-23 12:10:29,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {11821#true} call #t~ret3 := main(); {11821#true} is VALID [2018-11-23 12:10:29,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {11821#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11861#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:29,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {11861#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11861#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:29,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {11861#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11824#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:29,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {11824#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11824#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:29,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {11824#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11825#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:29,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {11825#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11825#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:29,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {11825#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11826#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:29,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {11826#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11826#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:29,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {11826#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11827#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:29,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {11827#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11827#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:29,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {11827#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11828#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:29,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {11828#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11828#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:29,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {11828#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11829#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:29,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {11829#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11829#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:29,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {11829#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11830#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:29,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {11830#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11830#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:29,626 INFO L273 TraceCheckUtils]: 21: Hoare triple {11830#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11831#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:29,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {11831#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11831#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:29,627 INFO L273 TraceCheckUtils]: 23: Hoare triple {11831#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11832#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:29,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {11832#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11832#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:29,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {11832#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11833#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:29,629 INFO L273 TraceCheckUtils]: 26: Hoare triple {11833#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11833#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:29,630 INFO L273 TraceCheckUtils]: 27: Hoare triple {11833#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11834#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:29,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {11834#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11834#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:29,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {11834#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11835#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:29,632 INFO L273 TraceCheckUtils]: 30: Hoare triple {11835#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11835#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:29,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {11835#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11836#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:29,633 INFO L273 TraceCheckUtils]: 32: Hoare triple {11836#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11836#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:29,633 INFO L273 TraceCheckUtils]: 33: Hoare triple {11836#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11837#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:29,634 INFO L273 TraceCheckUtils]: 34: Hoare triple {11837#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11837#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:29,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {11837#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11838#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:29,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {11838#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11838#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:29,636 INFO L273 TraceCheckUtils]: 37: Hoare triple {11838#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11839#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:29,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {11839#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11839#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:29,637 INFO L273 TraceCheckUtils]: 39: Hoare triple {11839#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11840#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:29,638 INFO L273 TraceCheckUtils]: 40: Hoare triple {11840#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11840#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:29,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {11840#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11841#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:29,639 INFO L273 TraceCheckUtils]: 42: Hoare triple {11841#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11841#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:29,639 INFO L273 TraceCheckUtils]: 43: Hoare triple {11841#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11842#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:29,640 INFO L273 TraceCheckUtils]: 44: Hoare triple {11842#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11822#false} is VALID [2018-11-23 12:10:29,640 INFO L273 TraceCheckUtils]: 45: Hoare triple {11822#false} ~i~0 := 0; {11822#false} is VALID [2018-11-23 12:10:29,640 INFO L273 TraceCheckUtils]: 46: Hoare triple {11822#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11822#false} is VALID [2018-11-23 12:10:29,641 INFO L256 TraceCheckUtils]: 47: Hoare triple {11822#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {11822#false} is VALID [2018-11-23 12:10:29,641 INFO L273 TraceCheckUtils]: 48: Hoare triple {11822#false} ~cond := #in~cond; {11822#false} is VALID [2018-11-23 12:10:29,641 INFO L273 TraceCheckUtils]: 49: Hoare triple {11822#false} assume 0 == ~cond; {11822#false} is VALID [2018-11-23 12:10:29,641 INFO L273 TraceCheckUtils]: 50: Hoare triple {11822#false} assume !false; {11822#false} is VALID [2018-11-23 12:10:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:10:29,663 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-11-23 12:10:29,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:29,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:10:30,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:30,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:10:30,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:10:30,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:10:30,308 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand 23 states. [2018-11-23 12:10:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:34,215 INFO L93 Difference]: Finished difference Result 266 states and 310 transitions. [2018-11-23 12:10:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:10:34,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-11-23 12:10:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:10:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 197 transitions. [2018-11-23 12:10:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:10:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 197 transitions. [2018-11-23 12:10:34,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 197 transitions. [2018-11-23 12:10:34,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:34,457 INFO L225 Difference]: With dead ends: 266 [2018-11-23 12:10:34,457 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 12:10:34,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:10:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 12:10:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-23 12:10:34,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:34,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 158 states. [2018-11-23 12:10:34,510 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 158 states. [2018-11-23 12:10:34,511 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 158 states. [2018-11-23 12:10:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:34,513 INFO L93 Difference]: Finished difference Result 160 states and 182 transitions. [2018-11-23 12:10:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2018-11-23 12:10:34,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:34,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:34,514 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 160 states. [2018-11-23 12:10:34,515 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 160 states. [2018-11-23 12:10:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:34,519 INFO L93 Difference]: Finished difference Result 160 states and 182 transitions. [2018-11-23 12:10:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2018-11-23 12:10:34,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:34,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:34,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:34,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 12:10:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-11-23 12:10:34,523 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 51 [2018-11-23 12:10:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:34,524 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-11-23 12:10:34,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:10:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-11-23 12:10:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:10:34,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:34,525 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:34,525 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:34,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:34,525 INFO L82 PathProgramCache]: Analyzing trace with hash 562798127, now seen corresponding path program 20 times [2018-11-23 12:10:34,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:34,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:34,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:34,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:34,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:34,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {12917#true} call ULTIMATE.init(); {12917#true} is VALID [2018-11-23 12:10:34,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {12917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12917#true} is VALID [2018-11-23 12:10:34,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {12917#true} assume true; {12917#true} is VALID [2018-11-23 12:10:34,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12917#true} {12917#true} #54#return; {12917#true} is VALID [2018-11-23 12:10:34,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {12917#true} call #t~ret3 := main(); {12917#true} is VALID [2018-11-23 12:10:34,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {12917#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12919#(= main_~i~0 0)} is VALID [2018-11-23 12:10:34,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {12919#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12919#(= main_~i~0 0)} is VALID [2018-11-23 12:10:34,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {12919#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12920#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:34,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {12920#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12920#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:34,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {12920#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12921#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:34,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {12921#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12921#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:34,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {12921#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12922#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:34,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {12922#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12922#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:34,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {12922#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12923#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:34,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {12923#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12923#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:34,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {12923#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12924#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:34,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {12924#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12924#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:34,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {12924#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12925#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:34,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {12925#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12925#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:34,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {12925#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12926#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:34,976 INFO L273 TraceCheckUtils]: 20: Hoare triple {12926#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12926#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:34,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {12926#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12927#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:34,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {12927#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12927#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:34,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {12927#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12928#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:34,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {12928#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12928#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:34,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {12928#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12929#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:34,979 INFO L273 TraceCheckUtils]: 26: Hoare triple {12929#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12929#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:34,980 INFO L273 TraceCheckUtils]: 27: Hoare triple {12929#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12930#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:34,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {12930#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12930#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:34,981 INFO L273 TraceCheckUtils]: 29: Hoare triple {12930#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12931#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:34,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {12931#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12931#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:34,983 INFO L273 TraceCheckUtils]: 31: Hoare triple {12931#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12932#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:34,983 INFO L273 TraceCheckUtils]: 32: Hoare triple {12932#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12932#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:34,984 INFO L273 TraceCheckUtils]: 33: Hoare triple {12932#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12933#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:34,984 INFO L273 TraceCheckUtils]: 34: Hoare triple {12933#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12933#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:34,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {12933#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12934#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:34,986 INFO L273 TraceCheckUtils]: 36: Hoare triple {12934#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12934#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:34,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {12934#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12935#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:34,987 INFO L273 TraceCheckUtils]: 38: Hoare triple {12935#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12935#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:34,988 INFO L273 TraceCheckUtils]: 39: Hoare triple {12935#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12936#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:34,988 INFO L273 TraceCheckUtils]: 40: Hoare triple {12936#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12936#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:34,989 INFO L273 TraceCheckUtils]: 41: Hoare triple {12936#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12937#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:34,990 INFO L273 TraceCheckUtils]: 42: Hoare triple {12937#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12937#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:34,990 INFO L273 TraceCheckUtils]: 43: Hoare triple {12937#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12938#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:34,991 INFO L273 TraceCheckUtils]: 44: Hoare triple {12938#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12938#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:34,992 INFO L273 TraceCheckUtils]: 45: Hoare triple {12938#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12939#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:34,992 INFO L273 TraceCheckUtils]: 46: Hoare triple {12939#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12918#false} is VALID [2018-11-23 12:10:34,993 INFO L273 TraceCheckUtils]: 47: Hoare triple {12918#false} ~i~0 := 0; {12918#false} is VALID [2018-11-23 12:10:34,993 INFO L273 TraceCheckUtils]: 48: Hoare triple {12918#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12918#false} is VALID [2018-11-23 12:10:34,993 INFO L256 TraceCheckUtils]: 49: Hoare triple {12918#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {12918#false} is VALID [2018-11-23 12:10:34,993 INFO L273 TraceCheckUtils]: 50: Hoare triple {12918#false} ~cond := #in~cond; {12918#false} is VALID [2018-11-23 12:10:34,993 INFO L273 TraceCheckUtils]: 51: Hoare triple {12918#false} assume 0 == ~cond; {12918#false} is VALID [2018-11-23 12:10:34,994 INFO L273 TraceCheckUtils]: 52: Hoare triple {12918#false} assume !false; {12918#false} is VALID [2018-11-23 12:10:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:34,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:34,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:35,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:10:35,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:10:35,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:35,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:35,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {12917#true} call ULTIMATE.init(); {12917#true} is VALID [2018-11-23 12:10:35,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {12917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12917#true} is VALID [2018-11-23 12:10:35,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {12917#true} assume true; {12917#true} is VALID [2018-11-23 12:10:35,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12917#true} {12917#true} #54#return; {12917#true} is VALID [2018-11-23 12:10:35,182 INFO L256 TraceCheckUtils]: 4: Hoare triple {12917#true} call #t~ret3 := main(); {12917#true} is VALID [2018-11-23 12:10:35,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {12917#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12958#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:35,183 INFO L273 TraceCheckUtils]: 6: Hoare triple {12958#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12958#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:35,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {12958#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12920#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:35,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {12920#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12920#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:35,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {12920#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12921#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:35,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {12921#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12921#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:35,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {12921#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12922#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:35,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {12922#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12922#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:35,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {12922#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12923#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:35,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {12923#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12923#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:35,208 INFO L273 TraceCheckUtils]: 15: Hoare triple {12923#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12924#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:35,208 INFO L273 TraceCheckUtils]: 16: Hoare triple {12924#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12924#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:35,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {12924#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12925#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:35,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {12925#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12925#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:35,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {12925#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12926#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:35,211 INFO L273 TraceCheckUtils]: 20: Hoare triple {12926#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12926#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:35,211 INFO L273 TraceCheckUtils]: 21: Hoare triple {12926#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12927#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:35,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {12927#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12927#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:35,212 INFO L273 TraceCheckUtils]: 23: Hoare triple {12927#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12928#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:35,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {12928#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12928#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:35,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {12928#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12929#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:35,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {12929#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12929#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:35,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {12929#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12930#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:35,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {12930#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12930#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:35,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {12930#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12931#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:35,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {12931#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12931#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:35,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {12931#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12932#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:35,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {12932#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12932#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:35,218 INFO L273 TraceCheckUtils]: 33: Hoare triple {12932#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12933#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:35,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {12933#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12933#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:35,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {12933#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12934#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:35,220 INFO L273 TraceCheckUtils]: 36: Hoare triple {12934#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12934#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:35,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {12934#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12935#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:35,221 INFO L273 TraceCheckUtils]: 38: Hoare triple {12935#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12935#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:35,222 INFO L273 TraceCheckUtils]: 39: Hoare triple {12935#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12936#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:35,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {12936#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12936#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:35,223 INFO L273 TraceCheckUtils]: 41: Hoare triple {12936#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12937#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:35,223 INFO L273 TraceCheckUtils]: 42: Hoare triple {12937#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12937#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:35,224 INFO L273 TraceCheckUtils]: 43: Hoare triple {12937#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12938#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:35,225 INFO L273 TraceCheckUtils]: 44: Hoare triple {12938#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12938#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:35,225 INFO L273 TraceCheckUtils]: 45: Hoare triple {12938#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12939#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:35,226 INFO L273 TraceCheckUtils]: 46: Hoare triple {12939#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12918#false} is VALID [2018-11-23 12:10:35,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {12918#false} ~i~0 := 0; {12918#false} is VALID [2018-11-23 12:10:35,227 INFO L273 TraceCheckUtils]: 48: Hoare triple {12918#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12918#false} is VALID [2018-11-23 12:10:35,227 INFO L256 TraceCheckUtils]: 49: Hoare triple {12918#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {12918#false} is VALID [2018-11-23 12:10:35,227 INFO L273 TraceCheckUtils]: 50: Hoare triple {12918#false} ~cond := #in~cond; {12918#false} is VALID [2018-11-23 12:10:35,227 INFO L273 TraceCheckUtils]: 51: Hoare triple {12918#false} assume 0 == ~cond; {12918#false} is VALID [2018-11-23 12:10:35,227 INFO L273 TraceCheckUtils]: 52: Hoare triple {12918#false} assume !false; {12918#false} is VALID [2018-11-23 12:10:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:35,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:35,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:10:35,250 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-23 12:10:35,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:35,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:10:35,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:35,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:10:35,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:10:35,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:10:35,305 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 24 states. [2018-11-23 12:10:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:36,831 INFO L93 Difference]: Finished difference Result 278 states and 324 transitions. [2018-11-23 12:10:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:10:36,831 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-11-23 12:10:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:10:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 205 transitions. [2018-11-23 12:10:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:10:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 205 transitions. [2018-11-23 12:10:36,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 205 transitions. [2018-11-23 12:10:37,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:37,054 INFO L225 Difference]: With dead ends: 278 [2018-11-23 12:10:37,054 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 12:10:37,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:10:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 12:10:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-23 12:10:37,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:37,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 165 states. [2018-11-23 12:10:37,194 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 165 states. [2018-11-23 12:10:37,194 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 165 states. [2018-11-23 12:10:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:37,198 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-11-23 12:10:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-11-23 12:10:37,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:37,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:37,199 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 167 states. [2018-11-23 12:10:37,200 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 167 states. [2018-11-23 12:10:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:37,205 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-11-23 12:10:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2018-11-23 12:10:37,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:37,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:37,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:37,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 12:10:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2018-11-23 12:10:37,211 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 53 [2018-11-23 12:10:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:37,211 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2018-11-23 12:10:37,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:10:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2018-11-23 12:10:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:10:37,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:37,212 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:37,212 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:37,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:37,213 INFO L82 PathProgramCache]: Analyzing trace with hash -434691059, now seen corresponding path program 21 times [2018-11-23 12:10:37,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:37,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:37,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:37,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:37,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:37,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {14061#true} call ULTIMATE.init(); {14061#true} is VALID [2018-11-23 12:10:37,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {14061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14061#true} is VALID [2018-11-23 12:10:37,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {14061#true} assume true; {14061#true} is VALID [2018-11-23 12:10:37,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14061#true} {14061#true} #54#return; {14061#true} is VALID [2018-11-23 12:10:37,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {14061#true} call #t~ret3 := main(); {14061#true} is VALID [2018-11-23 12:10:37,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {14061#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14063#(= main_~i~0 0)} is VALID [2018-11-23 12:10:37,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {14063#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14063#(= main_~i~0 0)} is VALID [2018-11-23 12:10:37,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {14063#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14064#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:37,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {14064#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14064#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:37,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {14064#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14065#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:37,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {14065#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14065#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:37,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {14065#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14066#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:37,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {14066#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14066#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:37,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {14066#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14067#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:37,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {14067#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14067#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:37,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {14067#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14068#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:37,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {14068#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14068#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:37,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {14068#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14069#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:37,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {14069#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14069#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:37,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {14069#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14070#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:37,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {14070#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14070#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:37,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {14070#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14071#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:37,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {14071#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14071#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:37,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {14071#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14072#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:37,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {14072#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14072#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:37,693 INFO L273 TraceCheckUtils]: 25: Hoare triple {14072#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14073#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:37,694 INFO L273 TraceCheckUtils]: 26: Hoare triple {14073#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14073#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:37,694 INFO L273 TraceCheckUtils]: 27: Hoare triple {14073#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14074#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:37,695 INFO L273 TraceCheckUtils]: 28: Hoare triple {14074#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14074#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:37,696 INFO L273 TraceCheckUtils]: 29: Hoare triple {14074#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14075#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:37,696 INFO L273 TraceCheckUtils]: 30: Hoare triple {14075#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14075#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:37,697 INFO L273 TraceCheckUtils]: 31: Hoare triple {14075#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14076#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:37,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {14076#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14076#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:37,698 INFO L273 TraceCheckUtils]: 33: Hoare triple {14076#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14077#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:37,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {14077#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14077#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:37,699 INFO L273 TraceCheckUtils]: 35: Hoare triple {14077#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14078#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:37,700 INFO L273 TraceCheckUtils]: 36: Hoare triple {14078#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14078#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:37,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {14078#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14079#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:37,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {14079#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14079#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:37,702 INFO L273 TraceCheckUtils]: 39: Hoare triple {14079#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14080#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:37,703 INFO L273 TraceCheckUtils]: 40: Hoare triple {14080#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14080#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:37,703 INFO L273 TraceCheckUtils]: 41: Hoare triple {14080#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14081#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:37,704 INFO L273 TraceCheckUtils]: 42: Hoare triple {14081#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14081#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:37,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {14081#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14082#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:37,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {14082#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14082#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:37,706 INFO L273 TraceCheckUtils]: 45: Hoare triple {14082#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14083#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:37,706 INFO L273 TraceCheckUtils]: 46: Hoare triple {14083#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14083#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:37,707 INFO L273 TraceCheckUtils]: 47: Hoare triple {14083#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14084#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:37,708 INFO L273 TraceCheckUtils]: 48: Hoare triple {14084#(<= main_~i~0 21)} assume !(~i~0 < 100000); {14062#false} is VALID [2018-11-23 12:10:37,708 INFO L273 TraceCheckUtils]: 49: Hoare triple {14062#false} ~i~0 := 0; {14062#false} is VALID [2018-11-23 12:10:37,708 INFO L273 TraceCheckUtils]: 50: Hoare triple {14062#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14062#false} is VALID [2018-11-23 12:10:37,709 INFO L256 TraceCheckUtils]: 51: Hoare triple {14062#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {14062#false} is VALID [2018-11-23 12:10:37,709 INFO L273 TraceCheckUtils]: 52: Hoare triple {14062#false} ~cond := #in~cond; {14062#false} is VALID [2018-11-23 12:10:37,709 INFO L273 TraceCheckUtils]: 53: Hoare triple {14062#false} assume 0 == ~cond; {14062#false} is VALID [2018-11-23 12:10:37,709 INFO L273 TraceCheckUtils]: 54: Hoare triple {14062#false} assume !false; {14062#false} is VALID [2018-11-23 12:10:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:37,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:37,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:37,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:10:37,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 12:10:37,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:37,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:38,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {14061#true} call ULTIMATE.init(); {14061#true} is VALID [2018-11-23 12:10:38,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {14061#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14061#true} is VALID [2018-11-23 12:10:38,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {14061#true} assume true; {14061#true} is VALID [2018-11-23 12:10:38,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14061#true} {14061#true} #54#return; {14061#true} is VALID [2018-11-23 12:10:38,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {14061#true} call #t~ret3 := main(); {14061#true} is VALID [2018-11-23 12:10:38,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {14061#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14103#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:38,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {14103#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14103#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:38,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {14103#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14064#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:38,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {14064#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14064#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:38,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {14064#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14065#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:38,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {14065#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14065#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:38,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {14065#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14066#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:38,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {14066#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14066#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:38,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {14066#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14067#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:38,032 INFO L273 TraceCheckUtils]: 14: Hoare triple {14067#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14067#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:38,033 INFO L273 TraceCheckUtils]: 15: Hoare triple {14067#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14068#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:38,034 INFO L273 TraceCheckUtils]: 16: Hoare triple {14068#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14068#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:38,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {14068#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14069#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:38,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {14069#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14069#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:38,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {14069#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14070#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:38,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {14070#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14070#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:38,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {14070#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14071#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:38,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {14071#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14071#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:38,038 INFO L273 TraceCheckUtils]: 23: Hoare triple {14071#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14072#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:38,039 INFO L273 TraceCheckUtils]: 24: Hoare triple {14072#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14072#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:38,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {14072#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14073#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:38,040 INFO L273 TraceCheckUtils]: 26: Hoare triple {14073#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14073#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:38,041 INFO L273 TraceCheckUtils]: 27: Hoare triple {14073#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14074#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:38,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {14074#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14074#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:38,042 INFO L273 TraceCheckUtils]: 29: Hoare triple {14074#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14075#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:38,043 INFO L273 TraceCheckUtils]: 30: Hoare triple {14075#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14075#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:38,043 INFO L273 TraceCheckUtils]: 31: Hoare triple {14075#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14076#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:38,044 INFO L273 TraceCheckUtils]: 32: Hoare triple {14076#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14076#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:38,045 INFO L273 TraceCheckUtils]: 33: Hoare triple {14076#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14077#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:38,045 INFO L273 TraceCheckUtils]: 34: Hoare triple {14077#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14077#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:38,046 INFO L273 TraceCheckUtils]: 35: Hoare triple {14077#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14078#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:38,047 INFO L273 TraceCheckUtils]: 36: Hoare triple {14078#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14078#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:38,047 INFO L273 TraceCheckUtils]: 37: Hoare triple {14078#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14079#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:38,048 INFO L273 TraceCheckUtils]: 38: Hoare triple {14079#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14079#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:38,049 INFO L273 TraceCheckUtils]: 39: Hoare triple {14079#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14080#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:38,049 INFO L273 TraceCheckUtils]: 40: Hoare triple {14080#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14080#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:38,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {14080#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14081#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:38,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {14081#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14081#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:38,051 INFO L273 TraceCheckUtils]: 43: Hoare triple {14081#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14082#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:38,052 INFO L273 TraceCheckUtils]: 44: Hoare triple {14082#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14082#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:38,053 INFO L273 TraceCheckUtils]: 45: Hoare triple {14082#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14083#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:38,053 INFO L273 TraceCheckUtils]: 46: Hoare triple {14083#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14083#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:38,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {14083#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14084#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:38,055 INFO L273 TraceCheckUtils]: 48: Hoare triple {14084#(<= main_~i~0 21)} assume !(~i~0 < 100000); {14062#false} is VALID [2018-11-23 12:10:38,055 INFO L273 TraceCheckUtils]: 49: Hoare triple {14062#false} ~i~0 := 0; {14062#false} is VALID [2018-11-23 12:10:38,055 INFO L273 TraceCheckUtils]: 50: Hoare triple {14062#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14062#false} is VALID [2018-11-23 12:10:38,055 INFO L256 TraceCheckUtils]: 51: Hoare triple {14062#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {14062#false} is VALID [2018-11-23 12:10:38,055 INFO L273 TraceCheckUtils]: 52: Hoare triple {14062#false} ~cond := #in~cond; {14062#false} is VALID [2018-11-23 12:10:38,056 INFO L273 TraceCheckUtils]: 53: Hoare triple {14062#false} assume 0 == ~cond; {14062#false} is VALID [2018-11-23 12:10:38,056 INFO L273 TraceCheckUtils]: 54: Hoare triple {14062#false} assume !false; {14062#false} is VALID [2018-11-23 12:10:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:38,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:38,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:10:38,079 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-11-23 12:10:38,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:38,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:10:38,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:38,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:10:38,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:10:38,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:10:38,139 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand 25 states. [2018-11-23 12:10:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:39,264 INFO L93 Difference]: Finished difference Result 290 states and 338 transitions. [2018-11-23 12:10:39,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:10:39,264 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-11-23 12:10:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:10:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 213 transitions. [2018-11-23 12:10:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:10:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 213 transitions. [2018-11-23 12:10:39,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 213 transitions. [2018-11-23 12:10:39,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:39,580 INFO L225 Difference]: With dead ends: 290 [2018-11-23 12:10:39,580 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 12:10:39,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:10:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 12:10:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-23 12:10:39,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:39,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand 172 states. [2018-11-23 12:10:39,670 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 172 states. [2018-11-23 12:10:39,670 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 172 states. [2018-11-23 12:10:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:39,675 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2018-11-23 12:10:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2018-11-23 12:10:39,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:39,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:39,676 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 174 states. [2018-11-23 12:10:39,676 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 174 states. [2018-11-23 12:10:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:39,681 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2018-11-23 12:10:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2018-11-23 12:10:39,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:39,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:39,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:39,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-23 12:10:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2018-11-23 12:10:39,686 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 55 [2018-11-23 12:10:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:39,686 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2018-11-23 12:10:39,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:10:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2018-11-23 12:10:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:10:39,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:39,687 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:39,688 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:39,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:39,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1244091797, now seen corresponding path program 22 times [2018-11-23 12:10:39,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:39,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:39,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:39,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:39,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:40,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {15253#true} call ULTIMATE.init(); {15253#true} is VALID [2018-11-23 12:10:40,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {15253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15253#true} is VALID [2018-11-23 12:10:40,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {15253#true} assume true; {15253#true} is VALID [2018-11-23 12:10:40,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15253#true} {15253#true} #54#return; {15253#true} is VALID [2018-11-23 12:10:40,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {15253#true} call #t~ret3 := main(); {15253#true} is VALID [2018-11-23 12:10:40,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {15253#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15255#(= main_~i~0 0)} is VALID [2018-11-23 12:10:40,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {15255#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15255#(= main_~i~0 0)} is VALID [2018-11-23 12:10:40,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {15255#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15256#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:40,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {15256#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15256#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:40,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {15256#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15257#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:40,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {15257#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15257#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:40,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {15257#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15258#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:40,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {15258#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15258#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:40,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {15258#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15259#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:40,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {15259#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15259#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:40,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {15259#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15260#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:40,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {15260#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15260#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:40,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {15260#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15261#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:40,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {15261#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15261#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:40,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {15261#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15262#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:40,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {15262#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15262#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:40,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {15262#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15263#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:40,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {15263#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15263#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:40,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {15263#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15264#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:40,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {15264#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15264#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:40,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {15264#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15265#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:40,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {15265#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15265#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:40,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {15265#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15266#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:40,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {15266#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15266#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:40,569 INFO L273 TraceCheckUtils]: 29: Hoare triple {15266#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15267#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:40,569 INFO L273 TraceCheckUtils]: 30: Hoare triple {15267#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15267#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:40,570 INFO L273 TraceCheckUtils]: 31: Hoare triple {15267#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15268#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:40,571 INFO L273 TraceCheckUtils]: 32: Hoare triple {15268#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15268#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:40,571 INFO L273 TraceCheckUtils]: 33: Hoare triple {15268#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15269#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:40,572 INFO L273 TraceCheckUtils]: 34: Hoare triple {15269#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15269#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:40,573 INFO L273 TraceCheckUtils]: 35: Hoare triple {15269#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15270#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:40,573 INFO L273 TraceCheckUtils]: 36: Hoare triple {15270#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15270#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:40,574 INFO L273 TraceCheckUtils]: 37: Hoare triple {15270#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15271#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:40,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {15271#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15271#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:40,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {15271#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15272#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:40,576 INFO L273 TraceCheckUtils]: 40: Hoare triple {15272#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15272#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:40,576 INFO L273 TraceCheckUtils]: 41: Hoare triple {15272#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15273#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:40,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {15273#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15273#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:40,578 INFO L273 TraceCheckUtils]: 43: Hoare triple {15273#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15274#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:40,578 INFO L273 TraceCheckUtils]: 44: Hoare triple {15274#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15274#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:40,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {15274#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15275#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:40,580 INFO L273 TraceCheckUtils]: 46: Hoare triple {15275#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15275#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:40,580 INFO L273 TraceCheckUtils]: 47: Hoare triple {15275#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15276#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:40,581 INFO L273 TraceCheckUtils]: 48: Hoare triple {15276#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15276#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:40,582 INFO L273 TraceCheckUtils]: 49: Hoare triple {15276#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15277#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:40,582 INFO L273 TraceCheckUtils]: 50: Hoare triple {15277#(<= main_~i~0 22)} assume !(~i~0 < 100000); {15254#false} is VALID [2018-11-23 12:10:40,582 INFO L273 TraceCheckUtils]: 51: Hoare triple {15254#false} ~i~0 := 0; {15254#false} is VALID [2018-11-23 12:10:40,583 INFO L273 TraceCheckUtils]: 52: Hoare triple {15254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15254#false} is VALID [2018-11-23 12:10:40,583 INFO L256 TraceCheckUtils]: 53: Hoare triple {15254#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {15254#false} is VALID [2018-11-23 12:10:40,583 INFO L273 TraceCheckUtils]: 54: Hoare triple {15254#false} ~cond := #in~cond; {15254#false} is VALID [2018-11-23 12:10:40,583 INFO L273 TraceCheckUtils]: 55: Hoare triple {15254#false} assume 0 == ~cond; {15254#false} is VALID [2018-11-23 12:10:40,583 INFO L273 TraceCheckUtils]: 56: Hoare triple {15254#false} assume !false; {15254#false} is VALID [2018-11-23 12:10:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:40,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:40,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:40,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:10:40,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:10:40,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:40,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:40,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {15253#true} call ULTIMATE.init(); {15253#true} is VALID [2018-11-23 12:10:40,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {15253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15253#true} is VALID [2018-11-23 12:10:40,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {15253#true} assume true; {15253#true} is VALID [2018-11-23 12:10:40,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15253#true} {15253#true} #54#return; {15253#true} is VALID [2018-11-23 12:10:40,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {15253#true} call #t~ret3 := main(); {15253#true} is VALID [2018-11-23 12:10:40,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {15253#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15296#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:40,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {15296#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15296#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:40,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {15296#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15256#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:40,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {15256#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15256#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:40,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {15256#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15257#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:40,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {15257#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15257#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:40,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {15257#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15258#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:40,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {15258#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15258#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:40,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {15258#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15259#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:40,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {15259#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15259#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:40,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {15259#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15260#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:40,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {15260#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15260#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:40,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {15260#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15261#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:40,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {15261#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15261#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:40,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {15261#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15262#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:40,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {15262#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15262#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:40,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {15262#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15263#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:40,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {15263#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15263#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:40,850 INFO L273 TraceCheckUtils]: 23: Hoare triple {15263#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15264#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:40,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {15264#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15264#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:40,852 INFO L273 TraceCheckUtils]: 25: Hoare triple {15264#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15265#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:40,852 INFO L273 TraceCheckUtils]: 26: Hoare triple {15265#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15265#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:40,853 INFO L273 TraceCheckUtils]: 27: Hoare triple {15265#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15266#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:40,854 INFO L273 TraceCheckUtils]: 28: Hoare triple {15266#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15266#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:40,854 INFO L273 TraceCheckUtils]: 29: Hoare triple {15266#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15267#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:40,855 INFO L273 TraceCheckUtils]: 30: Hoare triple {15267#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15267#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:40,856 INFO L273 TraceCheckUtils]: 31: Hoare triple {15267#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15268#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:40,856 INFO L273 TraceCheckUtils]: 32: Hoare triple {15268#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15268#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:40,857 INFO L273 TraceCheckUtils]: 33: Hoare triple {15268#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15269#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:40,857 INFO L273 TraceCheckUtils]: 34: Hoare triple {15269#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15269#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:40,858 INFO L273 TraceCheckUtils]: 35: Hoare triple {15269#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15270#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:40,859 INFO L273 TraceCheckUtils]: 36: Hoare triple {15270#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15270#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:40,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {15270#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15271#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:40,860 INFO L273 TraceCheckUtils]: 38: Hoare triple {15271#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15271#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:40,861 INFO L273 TraceCheckUtils]: 39: Hoare triple {15271#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15272#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:40,861 INFO L273 TraceCheckUtils]: 40: Hoare triple {15272#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15272#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:40,862 INFO L273 TraceCheckUtils]: 41: Hoare triple {15272#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15273#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:40,863 INFO L273 TraceCheckUtils]: 42: Hoare triple {15273#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15273#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:40,863 INFO L273 TraceCheckUtils]: 43: Hoare triple {15273#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15274#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:40,864 INFO L273 TraceCheckUtils]: 44: Hoare triple {15274#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15274#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:40,865 INFO L273 TraceCheckUtils]: 45: Hoare triple {15274#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15275#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:40,865 INFO L273 TraceCheckUtils]: 46: Hoare triple {15275#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15275#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:40,866 INFO L273 TraceCheckUtils]: 47: Hoare triple {15275#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15276#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:40,866 INFO L273 TraceCheckUtils]: 48: Hoare triple {15276#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15276#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:40,867 INFO L273 TraceCheckUtils]: 49: Hoare triple {15276#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15277#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:40,868 INFO L273 TraceCheckUtils]: 50: Hoare triple {15277#(<= main_~i~0 22)} assume !(~i~0 < 100000); {15254#false} is VALID [2018-11-23 12:10:40,868 INFO L273 TraceCheckUtils]: 51: Hoare triple {15254#false} ~i~0 := 0; {15254#false} is VALID [2018-11-23 12:10:40,868 INFO L273 TraceCheckUtils]: 52: Hoare triple {15254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15254#false} is VALID [2018-11-23 12:10:40,868 INFO L256 TraceCheckUtils]: 53: Hoare triple {15254#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {15254#false} is VALID [2018-11-23 12:10:40,869 INFO L273 TraceCheckUtils]: 54: Hoare triple {15254#false} ~cond := #in~cond; {15254#false} is VALID [2018-11-23 12:10:40,869 INFO L273 TraceCheckUtils]: 55: Hoare triple {15254#false} assume 0 == ~cond; {15254#false} is VALID [2018-11-23 12:10:40,869 INFO L273 TraceCheckUtils]: 56: Hoare triple {15254#false} assume !false; {15254#false} is VALID [2018-11-23 12:10:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:40,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:40,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:10:40,891 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-23 12:10:40,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:40,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:10:40,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:40,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:10:40,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:10:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:10:40,949 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand 26 states. [2018-11-23 12:10:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:42,196 INFO L93 Difference]: Finished difference Result 302 states and 352 transitions. [2018-11-23 12:10:42,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:10:42,197 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-23 12:10:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:10:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 221 transitions. [2018-11-23 12:10:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:10:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 221 transitions. [2018-11-23 12:10:42,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 221 transitions. [2018-11-23 12:10:42,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:42,422 INFO L225 Difference]: With dead ends: 302 [2018-11-23 12:10:42,422 INFO L226 Difference]: Without dead ends: 181 [2018-11-23 12:10:42,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:10:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-23 12:10:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-11-23 12:10:42,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:42,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 179 states. [2018-11-23 12:10:42,533 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 179 states. [2018-11-23 12:10:42,533 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 179 states. [2018-11-23 12:10:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:42,536 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2018-11-23 12:10:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 206 transitions. [2018-11-23 12:10:42,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:42,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:42,537 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 181 states. [2018-11-23 12:10:42,537 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 181 states. [2018-11-23 12:10:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:42,541 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2018-11-23 12:10:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 206 transitions. [2018-11-23 12:10:42,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:42,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:42,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:42,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-23 12:10:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2018-11-23 12:10:42,547 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 57 [2018-11-23 12:10:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:42,547 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2018-11-23 12:10:42,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:10:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2018-11-23 12:10:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:10:42,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:42,548 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:42,549 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:42,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1689120439, now seen corresponding path program 23 times [2018-11-23 12:10:42,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:42,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:42,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:42,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:42,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:43,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {16493#true} call ULTIMATE.init(); {16493#true} is VALID [2018-11-23 12:10:43,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {16493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16493#true} is VALID [2018-11-23 12:10:43,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {16493#true} assume true; {16493#true} is VALID [2018-11-23 12:10:43,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16493#true} {16493#true} #54#return; {16493#true} is VALID [2018-11-23 12:10:43,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {16493#true} call #t~ret3 := main(); {16493#true} is VALID [2018-11-23 12:10:43,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {16493#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16495#(= main_~i~0 0)} is VALID [2018-11-23 12:10:43,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {16495#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16495#(= main_~i~0 0)} is VALID [2018-11-23 12:10:43,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {16495#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16496#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:43,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {16496#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16496#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:43,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {16496#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16497#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:43,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {16497#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16497#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:43,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {16497#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16498#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:43,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {16498#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16498#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:43,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {16498#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16499#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:43,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {16499#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16499#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:43,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {16499#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16500#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:43,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {16500#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16500#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:43,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {16500#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16501#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:43,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {16501#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16501#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:43,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {16501#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16502#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:43,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {16502#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16502#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:43,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {16502#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16503#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:43,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {16503#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16503#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:43,016 INFO L273 TraceCheckUtils]: 23: Hoare triple {16503#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16504#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:43,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {16504#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16504#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:43,017 INFO L273 TraceCheckUtils]: 25: Hoare triple {16504#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16505#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:43,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {16505#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16505#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:43,018 INFO L273 TraceCheckUtils]: 27: Hoare triple {16505#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16506#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:43,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {16506#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16506#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:43,020 INFO L273 TraceCheckUtils]: 29: Hoare triple {16506#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16507#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:43,020 INFO L273 TraceCheckUtils]: 30: Hoare triple {16507#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16507#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:43,021 INFO L273 TraceCheckUtils]: 31: Hoare triple {16507#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16508#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:43,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {16508#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16508#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:43,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {16508#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16509#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:43,023 INFO L273 TraceCheckUtils]: 34: Hoare triple {16509#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16509#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:43,023 INFO L273 TraceCheckUtils]: 35: Hoare triple {16509#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16510#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:43,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {16510#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16510#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:43,025 INFO L273 TraceCheckUtils]: 37: Hoare triple {16510#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16511#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:43,025 INFO L273 TraceCheckUtils]: 38: Hoare triple {16511#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16511#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:43,026 INFO L273 TraceCheckUtils]: 39: Hoare triple {16511#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16512#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:43,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {16512#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16512#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:43,027 INFO L273 TraceCheckUtils]: 41: Hoare triple {16512#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16513#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:43,028 INFO L273 TraceCheckUtils]: 42: Hoare triple {16513#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16513#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:43,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {16513#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16514#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:43,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {16514#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16514#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:43,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {16514#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16515#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:43,045 INFO L273 TraceCheckUtils]: 46: Hoare triple {16515#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16515#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:43,045 INFO L273 TraceCheckUtils]: 47: Hoare triple {16515#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16516#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:43,046 INFO L273 TraceCheckUtils]: 48: Hoare triple {16516#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16516#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:43,046 INFO L273 TraceCheckUtils]: 49: Hoare triple {16516#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16517#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:43,046 INFO L273 TraceCheckUtils]: 50: Hoare triple {16517#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16517#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:43,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {16517#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16518#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:43,048 INFO L273 TraceCheckUtils]: 52: Hoare triple {16518#(<= main_~i~0 23)} assume !(~i~0 < 100000); {16494#false} is VALID [2018-11-23 12:10:43,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {16494#false} ~i~0 := 0; {16494#false} is VALID [2018-11-23 12:10:43,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {16494#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16494#false} is VALID [2018-11-23 12:10:43,048 INFO L256 TraceCheckUtils]: 55: Hoare triple {16494#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {16494#false} is VALID [2018-11-23 12:10:43,048 INFO L273 TraceCheckUtils]: 56: Hoare triple {16494#false} ~cond := #in~cond; {16494#false} is VALID [2018-11-23 12:10:43,049 INFO L273 TraceCheckUtils]: 57: Hoare triple {16494#false} assume 0 == ~cond; {16494#false} is VALID [2018-11-23 12:10:43,049 INFO L273 TraceCheckUtils]: 58: Hoare triple {16494#false} assume !false; {16494#false} is VALID [2018-11-23 12:10:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:43,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:43,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:43,061 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:10:43,333 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:10:43,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:43,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:43,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {16493#true} call ULTIMATE.init(); {16493#true} is VALID [2018-11-23 12:10:43,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {16493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16493#true} is VALID [2018-11-23 12:10:43,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {16493#true} assume true; {16493#true} is VALID [2018-11-23 12:10:43,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16493#true} {16493#true} #54#return; {16493#true} is VALID [2018-11-23 12:10:43,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {16493#true} call #t~ret3 := main(); {16493#true} is VALID [2018-11-23 12:10:43,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {16493#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16537#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:43,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {16537#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16537#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:43,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {16537#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16496#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:43,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {16496#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16496#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:43,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {16496#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16497#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:43,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {16497#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16497#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:43,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {16497#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16498#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:43,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {16498#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16498#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:43,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {16498#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16499#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:43,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {16499#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16499#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:43,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {16499#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16500#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:43,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {16500#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16500#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:43,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {16500#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16501#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:43,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {16501#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16501#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:43,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {16501#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16502#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:43,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {16502#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16502#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:43,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {16502#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16503#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:43,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {16503#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16503#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:43,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {16503#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16504#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:43,586 INFO L273 TraceCheckUtils]: 24: Hoare triple {16504#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16504#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:43,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {16504#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16505#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:43,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {16505#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16505#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:43,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {16505#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16506#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:43,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {16506#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16506#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:43,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {16506#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16507#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:43,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {16507#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16507#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:43,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {16507#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16508#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:43,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {16508#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16508#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:43,592 INFO L273 TraceCheckUtils]: 33: Hoare triple {16508#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16509#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:43,593 INFO L273 TraceCheckUtils]: 34: Hoare triple {16509#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16509#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:43,593 INFO L273 TraceCheckUtils]: 35: Hoare triple {16509#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16510#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:43,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {16510#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16510#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:43,595 INFO L273 TraceCheckUtils]: 37: Hoare triple {16510#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16511#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:43,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {16511#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16511#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:43,596 INFO L273 TraceCheckUtils]: 39: Hoare triple {16511#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16512#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:43,597 INFO L273 TraceCheckUtils]: 40: Hoare triple {16512#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16512#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:43,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {16512#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16513#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:43,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {16513#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16513#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:43,599 INFO L273 TraceCheckUtils]: 43: Hoare triple {16513#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16514#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:43,599 INFO L273 TraceCheckUtils]: 44: Hoare triple {16514#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16514#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:43,600 INFO L273 TraceCheckUtils]: 45: Hoare triple {16514#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16515#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:43,600 INFO L273 TraceCheckUtils]: 46: Hoare triple {16515#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16515#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:43,601 INFO L273 TraceCheckUtils]: 47: Hoare triple {16515#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16516#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:43,602 INFO L273 TraceCheckUtils]: 48: Hoare triple {16516#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16516#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:43,602 INFO L273 TraceCheckUtils]: 49: Hoare triple {16516#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16517#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:43,603 INFO L273 TraceCheckUtils]: 50: Hoare triple {16517#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16517#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:43,604 INFO L273 TraceCheckUtils]: 51: Hoare triple {16517#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16518#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:43,604 INFO L273 TraceCheckUtils]: 52: Hoare triple {16518#(<= main_~i~0 23)} assume !(~i~0 < 100000); {16494#false} is VALID [2018-11-23 12:10:43,605 INFO L273 TraceCheckUtils]: 53: Hoare triple {16494#false} ~i~0 := 0; {16494#false} is VALID [2018-11-23 12:10:43,605 INFO L273 TraceCheckUtils]: 54: Hoare triple {16494#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16494#false} is VALID [2018-11-23 12:10:43,605 INFO L256 TraceCheckUtils]: 55: Hoare triple {16494#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {16494#false} is VALID [2018-11-23 12:10:43,605 INFO L273 TraceCheckUtils]: 56: Hoare triple {16494#false} ~cond := #in~cond; {16494#false} is VALID [2018-11-23 12:10:43,605 INFO L273 TraceCheckUtils]: 57: Hoare triple {16494#false} assume 0 == ~cond; {16494#false} is VALID [2018-11-23 12:10:43,606 INFO L273 TraceCheckUtils]: 58: Hoare triple {16494#false} assume !false; {16494#false} is VALID [2018-11-23 12:10:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:43,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:43,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:10:43,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-11-23 12:10:43,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:43,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:10:43,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:43,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:10:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:10:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:10:43,690 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand 27 states. [2018-11-23 12:10:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:45,140 INFO L93 Difference]: Finished difference Result 314 states and 366 transitions. [2018-11-23 12:10:45,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:10:45,140 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-11-23 12:10:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:10:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 229 transitions. [2018-11-23 12:10:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:10:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 229 transitions. [2018-11-23 12:10:45,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 229 transitions. [2018-11-23 12:10:45,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:45,361 INFO L225 Difference]: With dead ends: 314 [2018-11-23 12:10:45,361 INFO L226 Difference]: Without dead ends: 188 [2018-11-23 12:10:45,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:10:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-23 12:10:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-11-23 12:10:45,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:45,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2018-11-23 12:10:45,465 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2018-11-23 12:10:45,465 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2018-11-23 12:10:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:45,469 INFO L93 Difference]: Finished difference Result 188 states and 214 transitions. [2018-11-23 12:10:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2018-11-23 12:10:45,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:45,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:45,471 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2018-11-23 12:10:45,471 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2018-11-23 12:10:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:45,476 INFO L93 Difference]: Finished difference Result 188 states and 214 transitions. [2018-11-23 12:10:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2018-11-23 12:10:45,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:45,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:45,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:45,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 12:10:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2018-11-23 12:10:45,482 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 59 [2018-11-23 12:10:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:45,482 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2018-11-23 12:10:45,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:10:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2018-11-23 12:10:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:10:45,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:45,483 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:45,483 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:45,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:45,484 INFO L82 PathProgramCache]: Analyzing trace with hash 135084199, now seen corresponding path program 24 times [2018-11-23 12:10:45,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:45,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:45,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:45,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:45,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:46,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {17781#true} call ULTIMATE.init(); {17781#true} is VALID [2018-11-23 12:10:46,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {17781#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17781#true} is VALID [2018-11-23 12:10:46,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {17781#true} assume true; {17781#true} is VALID [2018-11-23 12:10:46,522 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17781#true} {17781#true} #54#return; {17781#true} is VALID [2018-11-23 12:10:46,522 INFO L256 TraceCheckUtils]: 4: Hoare triple {17781#true} call #t~ret3 := main(); {17781#true} is VALID [2018-11-23 12:10:46,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {17781#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {17783#(= main_~i~0 0)} is VALID [2018-11-23 12:10:46,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {17783#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17783#(= main_~i~0 0)} is VALID [2018-11-23 12:10:46,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {17783#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17784#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:46,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {17784#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17784#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:46,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {17784#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17785#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:46,524 INFO L273 TraceCheckUtils]: 10: Hoare triple {17785#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17785#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:46,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {17785#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17786#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:46,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {17786#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17786#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:46,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {17786#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17787#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:46,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {17787#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17787#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:46,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {17787#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17788#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:46,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {17788#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17788#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:46,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {17788#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17789#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:46,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {17789#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17789#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:46,530 INFO L273 TraceCheckUtils]: 19: Hoare triple {17789#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17790#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:46,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {17790#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17790#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:46,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {17790#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17791#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:46,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {17791#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17791#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:46,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {17791#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17792#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:46,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {17792#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17792#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:46,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {17792#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17793#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:46,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {17793#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17793#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:46,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {17793#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17794#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:46,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {17794#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17794#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:46,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {17794#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17795#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:46,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {17795#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17795#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:46,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {17795#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17796#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:46,538 INFO L273 TraceCheckUtils]: 32: Hoare triple {17796#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17796#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:46,539 INFO L273 TraceCheckUtils]: 33: Hoare triple {17796#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17797#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:46,540 INFO L273 TraceCheckUtils]: 34: Hoare triple {17797#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17797#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:46,540 INFO L273 TraceCheckUtils]: 35: Hoare triple {17797#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17798#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:46,541 INFO L273 TraceCheckUtils]: 36: Hoare triple {17798#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17798#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:46,542 INFO L273 TraceCheckUtils]: 37: Hoare triple {17798#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17799#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:46,542 INFO L273 TraceCheckUtils]: 38: Hoare triple {17799#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17799#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:46,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {17799#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17800#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:46,543 INFO L273 TraceCheckUtils]: 40: Hoare triple {17800#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17800#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:46,544 INFO L273 TraceCheckUtils]: 41: Hoare triple {17800#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17801#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:46,545 INFO L273 TraceCheckUtils]: 42: Hoare triple {17801#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17801#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:46,545 INFO L273 TraceCheckUtils]: 43: Hoare triple {17801#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17802#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:46,546 INFO L273 TraceCheckUtils]: 44: Hoare triple {17802#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17802#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:46,547 INFO L273 TraceCheckUtils]: 45: Hoare triple {17802#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17803#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:46,547 INFO L273 TraceCheckUtils]: 46: Hoare triple {17803#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17803#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:46,548 INFO L273 TraceCheckUtils]: 47: Hoare triple {17803#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17804#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:46,549 INFO L273 TraceCheckUtils]: 48: Hoare triple {17804#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17804#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:46,549 INFO L273 TraceCheckUtils]: 49: Hoare triple {17804#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17805#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:46,550 INFO L273 TraceCheckUtils]: 50: Hoare triple {17805#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17805#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:46,551 INFO L273 TraceCheckUtils]: 51: Hoare triple {17805#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17806#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:46,551 INFO L273 TraceCheckUtils]: 52: Hoare triple {17806#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17806#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:46,552 INFO L273 TraceCheckUtils]: 53: Hoare triple {17806#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17807#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:46,553 INFO L273 TraceCheckUtils]: 54: Hoare triple {17807#(<= main_~i~0 24)} assume !(~i~0 < 100000); {17782#false} is VALID [2018-11-23 12:10:46,553 INFO L273 TraceCheckUtils]: 55: Hoare triple {17782#false} ~i~0 := 0; {17782#false} is VALID [2018-11-23 12:10:46,553 INFO L273 TraceCheckUtils]: 56: Hoare triple {17782#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17782#false} is VALID [2018-11-23 12:10:46,553 INFO L256 TraceCheckUtils]: 57: Hoare triple {17782#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {17782#false} is VALID [2018-11-23 12:10:46,553 INFO L273 TraceCheckUtils]: 58: Hoare triple {17782#false} ~cond := #in~cond; {17782#false} is VALID [2018-11-23 12:10:46,554 INFO L273 TraceCheckUtils]: 59: Hoare triple {17782#false} assume 0 == ~cond; {17782#false} is VALID [2018-11-23 12:10:46,554 INFO L273 TraceCheckUtils]: 60: Hoare triple {17782#false} assume !false; {17782#false} is VALID [2018-11-23 12:10:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:46,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:46,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:46,566 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:10:48,232 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 12:10:48,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:48,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:48,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {17781#true} call ULTIMATE.init(); {17781#true} is VALID [2018-11-23 12:10:48,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {17781#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17781#true} is VALID [2018-11-23 12:10:48,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {17781#true} assume true; {17781#true} is VALID [2018-11-23 12:10:48,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17781#true} {17781#true} #54#return; {17781#true} is VALID [2018-11-23 12:10:48,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {17781#true} call #t~ret3 := main(); {17781#true} is VALID [2018-11-23 12:10:48,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {17781#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {17826#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:48,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {17826#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17826#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:48,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {17826#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17784#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:48,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {17784#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17784#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:48,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {17784#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17785#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:48,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {17785#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17785#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:48,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {17785#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17786#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:48,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {17786#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17786#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:48,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {17786#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17787#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:48,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {17787#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17787#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:48,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {17787#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17788#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:48,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {17788#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17788#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:48,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {17788#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17789#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:48,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {17789#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17789#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:48,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {17789#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17790#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:48,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {17790#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17790#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:48,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {17790#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17791#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:48,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {17791#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17791#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:48,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {17791#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17792#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:48,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {17792#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17792#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:48,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {17792#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17793#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:48,443 INFO L273 TraceCheckUtils]: 26: Hoare triple {17793#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17793#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:48,444 INFO L273 TraceCheckUtils]: 27: Hoare triple {17793#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17794#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:48,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {17794#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17794#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:48,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {17794#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17795#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:48,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {17795#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17795#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:48,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {17795#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17796#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:48,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {17796#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17796#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:48,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {17796#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17797#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:48,448 INFO L273 TraceCheckUtils]: 34: Hoare triple {17797#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17797#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:48,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {17797#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17798#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:48,450 INFO L273 TraceCheckUtils]: 36: Hoare triple {17798#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17798#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:48,450 INFO L273 TraceCheckUtils]: 37: Hoare triple {17798#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17799#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:48,451 INFO L273 TraceCheckUtils]: 38: Hoare triple {17799#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17799#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:48,452 INFO L273 TraceCheckUtils]: 39: Hoare triple {17799#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17800#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:48,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {17800#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17800#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:48,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {17800#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17801#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:48,454 INFO L273 TraceCheckUtils]: 42: Hoare triple {17801#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17801#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:48,454 INFO L273 TraceCheckUtils]: 43: Hoare triple {17801#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17802#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:48,455 INFO L273 TraceCheckUtils]: 44: Hoare triple {17802#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17802#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:48,456 INFO L273 TraceCheckUtils]: 45: Hoare triple {17802#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17803#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:48,456 INFO L273 TraceCheckUtils]: 46: Hoare triple {17803#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17803#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:48,457 INFO L273 TraceCheckUtils]: 47: Hoare triple {17803#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17804#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:48,457 INFO L273 TraceCheckUtils]: 48: Hoare triple {17804#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17804#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:48,458 INFO L273 TraceCheckUtils]: 49: Hoare triple {17804#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17805#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:48,459 INFO L273 TraceCheckUtils]: 50: Hoare triple {17805#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17805#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:48,459 INFO L273 TraceCheckUtils]: 51: Hoare triple {17805#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17806#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:48,460 INFO L273 TraceCheckUtils]: 52: Hoare triple {17806#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17806#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:48,461 INFO L273 TraceCheckUtils]: 53: Hoare triple {17806#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17807#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:48,461 INFO L273 TraceCheckUtils]: 54: Hoare triple {17807#(<= main_~i~0 24)} assume !(~i~0 < 100000); {17782#false} is VALID [2018-11-23 12:10:48,461 INFO L273 TraceCheckUtils]: 55: Hoare triple {17782#false} ~i~0 := 0; {17782#false} is VALID [2018-11-23 12:10:48,462 INFO L273 TraceCheckUtils]: 56: Hoare triple {17782#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17782#false} is VALID [2018-11-23 12:10:48,462 INFO L256 TraceCheckUtils]: 57: Hoare triple {17782#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {17782#false} is VALID [2018-11-23 12:10:48,462 INFO L273 TraceCheckUtils]: 58: Hoare triple {17782#false} ~cond := #in~cond; {17782#false} is VALID [2018-11-23 12:10:48,462 INFO L273 TraceCheckUtils]: 59: Hoare triple {17782#false} assume 0 == ~cond; {17782#false} is VALID [2018-11-23 12:10:48,462 INFO L273 TraceCheckUtils]: 60: Hoare triple {17782#false} assume !false; {17782#false} is VALID [2018-11-23 12:10:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:48,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:48,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 12:10:48,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-11-23 12:10:48,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:48,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:10:48,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:48,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:10:48,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:10:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:10:48,551 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand 28 states. [2018-11-23 12:10:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:50,144 INFO L93 Difference]: Finished difference Result 326 states and 380 transitions. [2018-11-23 12:10:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:10:50,144 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-11-23 12:10:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:10:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 237 transitions. [2018-11-23 12:10:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:10:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 237 transitions. [2018-11-23 12:10:50,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 237 transitions. [2018-11-23 12:10:50,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:50,384 INFO L225 Difference]: With dead ends: 326 [2018-11-23 12:10:50,384 INFO L226 Difference]: Without dead ends: 195 [2018-11-23 12:10:50,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:10:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-23 12:10:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-11-23 12:10:50,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:50,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand 193 states. [2018-11-23 12:10:50,765 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 193 states. [2018-11-23 12:10:50,766 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 193 states. [2018-11-23 12:10:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:50,771 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2018-11-23 12:10:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2018-11-23 12:10:50,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:50,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:50,772 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 195 states. [2018-11-23 12:10:50,772 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 195 states. [2018-11-23 12:10:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:50,778 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2018-11-23 12:10:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2018-11-23 12:10:50,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:50,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:50,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:50,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-23 12:10:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2018-11-23 12:10:50,784 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 61 [2018-11-23 12:10:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:50,784 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2018-11-23 12:10:50,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:10:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2018-11-23 12:10:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:10:50,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:50,785 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:50,785 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:50,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:50,786 INFO L82 PathProgramCache]: Analyzing trace with hash 849084549, now seen corresponding path program 25 times [2018-11-23 12:10:50,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:50,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:50,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:50,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:50,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:51,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {19117#true} call ULTIMATE.init(); {19117#true} is VALID [2018-11-23 12:10:51,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {19117#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19117#true} is VALID [2018-11-23 12:10:51,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {19117#true} assume true; {19117#true} is VALID [2018-11-23 12:10:51,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19117#true} {19117#true} #54#return; {19117#true} is VALID [2018-11-23 12:10:51,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {19117#true} call #t~ret3 := main(); {19117#true} is VALID [2018-11-23 12:10:51,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {19117#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {19119#(= main_~i~0 0)} is VALID [2018-11-23 12:10:51,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {19119#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19119#(= main_~i~0 0)} is VALID [2018-11-23 12:10:51,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {19119#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19120#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:51,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {19120#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19120#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:51,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {19120#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19121#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:51,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {19121#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19121#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:51,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {19121#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19122#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:51,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {19122#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19122#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:51,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {19122#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19123#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:51,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {19123#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19123#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:51,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {19123#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19124#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:51,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {19124#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19124#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:51,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {19124#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19125#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:51,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {19125#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19125#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:51,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {19125#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19126#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:51,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {19126#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19126#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:51,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {19126#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19127#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:51,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {19127#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19127#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:51,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {19127#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19128#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:51,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {19128#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19128#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:51,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {19128#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19129#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:51,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {19129#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19129#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:51,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {19129#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19130#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:51,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {19130#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19130#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:51,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {19130#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19131#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:51,914 INFO L273 TraceCheckUtils]: 30: Hoare triple {19131#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19131#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:51,914 INFO L273 TraceCheckUtils]: 31: Hoare triple {19131#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19132#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:51,915 INFO L273 TraceCheckUtils]: 32: Hoare triple {19132#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19132#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:51,916 INFO L273 TraceCheckUtils]: 33: Hoare triple {19132#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19133#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:51,916 INFO L273 TraceCheckUtils]: 34: Hoare triple {19133#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19133#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:51,917 INFO L273 TraceCheckUtils]: 35: Hoare triple {19133#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19134#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:51,917 INFO L273 TraceCheckUtils]: 36: Hoare triple {19134#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19134#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:51,918 INFO L273 TraceCheckUtils]: 37: Hoare triple {19134#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19135#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:51,919 INFO L273 TraceCheckUtils]: 38: Hoare triple {19135#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19135#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:51,919 INFO L273 TraceCheckUtils]: 39: Hoare triple {19135#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19136#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:51,920 INFO L273 TraceCheckUtils]: 40: Hoare triple {19136#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19136#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:51,921 INFO L273 TraceCheckUtils]: 41: Hoare triple {19136#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19137#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:51,921 INFO L273 TraceCheckUtils]: 42: Hoare triple {19137#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19137#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:51,922 INFO L273 TraceCheckUtils]: 43: Hoare triple {19137#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19138#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:51,922 INFO L273 TraceCheckUtils]: 44: Hoare triple {19138#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19138#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:51,923 INFO L273 TraceCheckUtils]: 45: Hoare triple {19138#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19139#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:51,924 INFO L273 TraceCheckUtils]: 46: Hoare triple {19139#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19139#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:51,924 INFO L273 TraceCheckUtils]: 47: Hoare triple {19139#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19140#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:51,925 INFO L273 TraceCheckUtils]: 48: Hoare triple {19140#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19140#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:51,926 INFO L273 TraceCheckUtils]: 49: Hoare triple {19140#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19141#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:51,926 INFO L273 TraceCheckUtils]: 50: Hoare triple {19141#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19141#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:51,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {19141#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19142#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:51,928 INFO L273 TraceCheckUtils]: 52: Hoare triple {19142#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19142#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:51,928 INFO L273 TraceCheckUtils]: 53: Hoare triple {19142#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19143#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:51,929 INFO L273 TraceCheckUtils]: 54: Hoare triple {19143#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19143#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:51,930 INFO L273 TraceCheckUtils]: 55: Hoare triple {19143#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19144#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:51,930 INFO L273 TraceCheckUtils]: 56: Hoare triple {19144#(<= main_~i~0 25)} assume !(~i~0 < 100000); {19118#false} is VALID [2018-11-23 12:10:51,931 INFO L273 TraceCheckUtils]: 57: Hoare triple {19118#false} ~i~0 := 0; {19118#false} is VALID [2018-11-23 12:10:51,931 INFO L273 TraceCheckUtils]: 58: Hoare triple {19118#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19118#false} is VALID [2018-11-23 12:10:51,931 INFO L256 TraceCheckUtils]: 59: Hoare triple {19118#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {19118#false} is VALID [2018-11-23 12:10:51,931 INFO L273 TraceCheckUtils]: 60: Hoare triple {19118#false} ~cond := #in~cond; {19118#false} is VALID [2018-11-23 12:10:51,931 INFO L273 TraceCheckUtils]: 61: Hoare triple {19118#false} assume 0 == ~cond; {19118#false} is VALID [2018-11-23 12:10:51,932 INFO L273 TraceCheckUtils]: 62: Hoare triple {19118#false} assume !false; {19118#false} is VALID [2018-11-23 12:10:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:51,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:51,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:51,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:52,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:52,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {19117#true} call ULTIMATE.init(); {19117#true} is VALID [2018-11-23 12:10:52,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {19117#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19117#true} is VALID [2018-11-23 12:10:52,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {19117#true} assume true; {19117#true} is VALID [2018-11-23 12:10:52,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19117#true} {19117#true} #54#return; {19117#true} is VALID [2018-11-23 12:10:52,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {19117#true} call #t~ret3 := main(); {19117#true} is VALID [2018-11-23 12:10:52,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {19117#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {19163#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:52,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {19163#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19163#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:52,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {19163#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19120#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:52,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {19120#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19120#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:52,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {19120#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19121#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:52,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {19121#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19121#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:52,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {19121#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19122#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:52,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {19122#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19122#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:52,255 INFO L273 TraceCheckUtils]: 13: Hoare triple {19122#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19123#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:52,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {19123#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19123#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:52,257 INFO L273 TraceCheckUtils]: 15: Hoare triple {19123#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19124#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:52,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {19124#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19124#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:52,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {19124#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19125#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:52,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {19125#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19125#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:52,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {19125#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19126#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:52,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {19126#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19126#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:52,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {19126#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19127#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:52,261 INFO L273 TraceCheckUtils]: 22: Hoare triple {19127#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19127#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:52,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {19127#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19128#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:52,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {19128#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19128#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:52,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {19128#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19129#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:52,263 INFO L273 TraceCheckUtils]: 26: Hoare triple {19129#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19129#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:52,264 INFO L273 TraceCheckUtils]: 27: Hoare triple {19129#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19130#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:52,265 INFO L273 TraceCheckUtils]: 28: Hoare triple {19130#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19130#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:52,266 INFO L273 TraceCheckUtils]: 29: Hoare triple {19130#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19131#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:52,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {19131#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19131#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:52,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {19131#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19132#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:52,267 INFO L273 TraceCheckUtils]: 32: Hoare triple {19132#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19132#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:52,268 INFO L273 TraceCheckUtils]: 33: Hoare triple {19132#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19133#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:52,269 INFO L273 TraceCheckUtils]: 34: Hoare triple {19133#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19133#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:52,269 INFO L273 TraceCheckUtils]: 35: Hoare triple {19133#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19134#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:52,270 INFO L273 TraceCheckUtils]: 36: Hoare triple {19134#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19134#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:52,271 INFO L273 TraceCheckUtils]: 37: Hoare triple {19134#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19135#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:52,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {19135#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19135#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:52,272 INFO L273 TraceCheckUtils]: 39: Hoare triple {19135#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19136#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:52,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {19136#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19136#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:52,273 INFO L273 TraceCheckUtils]: 41: Hoare triple {19136#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19137#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:52,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {19137#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19137#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:52,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {19137#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19138#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:52,275 INFO L273 TraceCheckUtils]: 44: Hoare triple {19138#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19138#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:52,276 INFO L273 TraceCheckUtils]: 45: Hoare triple {19138#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19139#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:52,276 INFO L273 TraceCheckUtils]: 46: Hoare triple {19139#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19139#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:52,277 INFO L273 TraceCheckUtils]: 47: Hoare triple {19139#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19140#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:52,278 INFO L273 TraceCheckUtils]: 48: Hoare triple {19140#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19140#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:52,278 INFO L273 TraceCheckUtils]: 49: Hoare triple {19140#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19141#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:52,279 INFO L273 TraceCheckUtils]: 50: Hoare triple {19141#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19141#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:52,280 INFO L273 TraceCheckUtils]: 51: Hoare triple {19141#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19142#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:52,280 INFO L273 TraceCheckUtils]: 52: Hoare triple {19142#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19142#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:52,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {19142#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19143#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:52,281 INFO L273 TraceCheckUtils]: 54: Hoare triple {19143#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19143#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:52,282 INFO L273 TraceCheckUtils]: 55: Hoare triple {19143#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19144#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:52,283 INFO L273 TraceCheckUtils]: 56: Hoare triple {19144#(<= main_~i~0 25)} assume !(~i~0 < 100000); {19118#false} is VALID [2018-11-23 12:10:52,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {19118#false} ~i~0 := 0; {19118#false} is VALID [2018-11-23 12:10:52,283 INFO L273 TraceCheckUtils]: 58: Hoare triple {19118#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19118#false} is VALID [2018-11-23 12:10:52,283 INFO L256 TraceCheckUtils]: 59: Hoare triple {19118#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {19118#false} is VALID [2018-11-23 12:10:52,284 INFO L273 TraceCheckUtils]: 60: Hoare triple {19118#false} ~cond := #in~cond; {19118#false} is VALID [2018-11-23 12:10:52,284 INFO L273 TraceCheckUtils]: 61: Hoare triple {19118#false} assume 0 == ~cond; {19118#false} is VALID [2018-11-23 12:10:52,284 INFO L273 TraceCheckUtils]: 62: Hoare triple {19118#false} assume !false; {19118#false} is VALID [2018-11-23 12:10:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:52,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:52,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:10:52,307 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-11-23 12:10:52,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:52,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:10:52,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:52,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:10:52,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:10:52,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:10:52,371 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand 29 states. [2018-11-23 12:10:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:54,085 INFO L93 Difference]: Finished difference Result 338 states and 394 transitions. [2018-11-23 12:10:54,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:10:54,085 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-11-23 12:10:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:10:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 245 transitions. [2018-11-23 12:10:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:10:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 245 transitions. [2018-11-23 12:10:54,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 245 transitions. [2018-11-23 12:10:54,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:54,408 INFO L225 Difference]: With dead ends: 338 [2018-11-23 12:10:54,408 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 12:10:54,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:10:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 12:10:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-11-23 12:10:54,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:54,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 200 states. [2018-11-23 12:10:54,671 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 200 states. [2018-11-23 12:10:54,671 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 200 states. [2018-11-23 12:10:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:54,676 INFO L93 Difference]: Finished difference Result 202 states and 230 transitions. [2018-11-23 12:10:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 230 transitions. [2018-11-23 12:10:54,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:54,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:54,699 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 202 states. [2018-11-23 12:10:54,699 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 202 states. [2018-11-23 12:10:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:54,705 INFO L93 Difference]: Finished difference Result 202 states and 230 transitions. [2018-11-23 12:10:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 230 transitions. [2018-11-23 12:10:54,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:54,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:54,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:54,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 12:10:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 228 transitions. [2018-11-23 12:10:54,711 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 228 transitions. Word has length 63 [2018-11-23 12:10:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:54,711 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 228 transitions. [2018-11-23 12:10:54,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:10:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 228 transitions. [2018-11-23 12:10:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:10:54,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:54,712 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:54,712 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:54,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash -191346461, now seen corresponding path program 26 times [2018-11-23 12:10:54,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:54,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:54,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:54,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:10:54,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:56,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {20501#true} call ULTIMATE.init(); {20501#true} is VALID [2018-11-23 12:10:56,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {20501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20501#true} is VALID [2018-11-23 12:10:56,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {20501#true} assume true; {20501#true} is VALID [2018-11-23 12:10:56,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20501#true} {20501#true} #54#return; {20501#true} is VALID [2018-11-23 12:10:56,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {20501#true} call #t~ret3 := main(); {20501#true} is VALID [2018-11-23 12:10:56,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {20501#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {20503#(= main_~i~0 0)} is VALID [2018-11-23 12:10:56,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {20503#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20503#(= main_~i~0 0)} is VALID [2018-11-23 12:10:56,795 INFO L273 TraceCheckUtils]: 7: Hoare triple {20503#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20504#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:56,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {20504#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20504#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:56,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {20504#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20505#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:56,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {20505#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20505#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:56,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {20505#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20506#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:56,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {20506#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20506#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:56,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {20506#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20507#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:56,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {20507#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20507#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:56,799 INFO L273 TraceCheckUtils]: 15: Hoare triple {20507#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20508#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:56,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {20508#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20508#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:56,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {20508#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20509#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:56,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {20509#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20509#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:56,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {20509#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20510#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:56,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {20510#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20510#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:56,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {20510#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20511#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:56,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {20511#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20511#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:56,804 INFO L273 TraceCheckUtils]: 23: Hoare triple {20511#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20512#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:56,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {20512#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20512#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:56,805 INFO L273 TraceCheckUtils]: 25: Hoare triple {20512#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20513#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:56,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {20513#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20513#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:56,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {20513#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20514#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:56,807 INFO L273 TraceCheckUtils]: 28: Hoare triple {20514#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20514#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:56,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {20514#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20515#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:56,808 INFO L273 TraceCheckUtils]: 30: Hoare triple {20515#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20515#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:56,809 INFO L273 TraceCheckUtils]: 31: Hoare triple {20515#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20516#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:56,810 INFO L273 TraceCheckUtils]: 32: Hoare triple {20516#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20516#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:56,810 INFO L273 TraceCheckUtils]: 33: Hoare triple {20516#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20517#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:56,811 INFO L273 TraceCheckUtils]: 34: Hoare triple {20517#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20517#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:56,812 INFO L273 TraceCheckUtils]: 35: Hoare triple {20517#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20518#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:56,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {20518#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20518#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:56,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {20518#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20519#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:56,814 INFO L273 TraceCheckUtils]: 38: Hoare triple {20519#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20519#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:56,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {20519#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20520#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:56,815 INFO L273 TraceCheckUtils]: 40: Hoare triple {20520#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20520#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:56,816 INFO L273 TraceCheckUtils]: 41: Hoare triple {20520#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20521#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:56,816 INFO L273 TraceCheckUtils]: 42: Hoare triple {20521#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20521#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:56,817 INFO L273 TraceCheckUtils]: 43: Hoare triple {20521#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20522#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:56,817 INFO L273 TraceCheckUtils]: 44: Hoare triple {20522#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20522#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:56,818 INFO L273 TraceCheckUtils]: 45: Hoare triple {20522#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20523#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:56,819 INFO L273 TraceCheckUtils]: 46: Hoare triple {20523#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20523#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:56,819 INFO L273 TraceCheckUtils]: 47: Hoare triple {20523#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20524#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:56,820 INFO L273 TraceCheckUtils]: 48: Hoare triple {20524#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20524#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:56,821 INFO L273 TraceCheckUtils]: 49: Hoare triple {20524#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20525#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:56,821 INFO L273 TraceCheckUtils]: 50: Hoare triple {20525#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20525#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:56,822 INFO L273 TraceCheckUtils]: 51: Hoare triple {20525#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20526#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:56,823 INFO L273 TraceCheckUtils]: 52: Hoare triple {20526#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20526#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:56,823 INFO L273 TraceCheckUtils]: 53: Hoare triple {20526#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20527#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:56,824 INFO L273 TraceCheckUtils]: 54: Hoare triple {20527#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20527#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:56,825 INFO L273 TraceCheckUtils]: 55: Hoare triple {20527#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20528#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:56,825 INFO L273 TraceCheckUtils]: 56: Hoare triple {20528#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20528#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:56,826 INFO L273 TraceCheckUtils]: 57: Hoare triple {20528#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20529#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:56,827 INFO L273 TraceCheckUtils]: 58: Hoare triple {20529#(<= main_~i~0 26)} assume !(~i~0 < 100000); {20502#false} is VALID [2018-11-23 12:10:56,827 INFO L273 TraceCheckUtils]: 59: Hoare triple {20502#false} ~i~0 := 0; {20502#false} is VALID [2018-11-23 12:10:56,827 INFO L273 TraceCheckUtils]: 60: Hoare triple {20502#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20502#false} is VALID [2018-11-23 12:10:56,827 INFO L256 TraceCheckUtils]: 61: Hoare triple {20502#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {20502#false} is VALID [2018-11-23 12:10:56,827 INFO L273 TraceCheckUtils]: 62: Hoare triple {20502#false} ~cond := #in~cond; {20502#false} is VALID [2018-11-23 12:10:56,828 INFO L273 TraceCheckUtils]: 63: Hoare triple {20502#false} assume 0 == ~cond; {20502#false} is VALID [2018-11-23 12:10:56,828 INFO L273 TraceCheckUtils]: 64: Hoare triple {20502#false} assume !false; {20502#false} is VALID [2018-11-23 12:10:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:56,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:56,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:56,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:10:56,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:10:56,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:56,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:57,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {20501#true} call ULTIMATE.init(); {20501#true} is VALID [2018-11-23 12:10:57,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {20501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20501#true} is VALID [2018-11-23 12:10:57,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {20501#true} assume true; {20501#true} is VALID [2018-11-23 12:10:57,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20501#true} {20501#true} #54#return; {20501#true} is VALID [2018-11-23 12:10:57,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {20501#true} call #t~ret3 := main(); {20501#true} is VALID [2018-11-23 12:10:57,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {20501#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {20548#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:57,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {20548#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20548#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:57,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {20548#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20504#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:57,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {20504#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20504#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:57,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {20504#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20505#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:57,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {20505#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20505#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:57,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {20505#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20506#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:57,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {20506#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20506#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:57,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {20506#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20507#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:57,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {20507#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20507#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:57,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {20507#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20508#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:57,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {20508#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20508#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:57,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {20508#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20509#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:57,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {20509#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20509#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:57,094 INFO L273 TraceCheckUtils]: 19: Hoare triple {20509#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20510#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:57,094 INFO L273 TraceCheckUtils]: 20: Hoare triple {20510#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20510#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:57,095 INFO L273 TraceCheckUtils]: 21: Hoare triple {20510#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20511#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:57,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {20511#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20511#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:57,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {20511#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20512#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:57,097 INFO L273 TraceCheckUtils]: 24: Hoare triple {20512#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20512#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:57,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {20512#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20513#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:57,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {20513#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20513#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:57,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {20513#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20514#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:57,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {20514#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20514#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:57,100 INFO L273 TraceCheckUtils]: 29: Hoare triple {20514#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20515#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:57,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {20515#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20515#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:57,102 INFO L273 TraceCheckUtils]: 31: Hoare triple {20515#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20516#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:57,102 INFO L273 TraceCheckUtils]: 32: Hoare triple {20516#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20516#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:57,103 INFO L273 TraceCheckUtils]: 33: Hoare triple {20516#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20517#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:57,103 INFO L273 TraceCheckUtils]: 34: Hoare triple {20517#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20517#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:57,104 INFO L273 TraceCheckUtils]: 35: Hoare triple {20517#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20518#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:57,105 INFO L273 TraceCheckUtils]: 36: Hoare triple {20518#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20518#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:57,106 INFO L273 TraceCheckUtils]: 37: Hoare triple {20518#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20519#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:57,106 INFO L273 TraceCheckUtils]: 38: Hoare triple {20519#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20519#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:57,107 INFO L273 TraceCheckUtils]: 39: Hoare triple {20519#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20520#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:57,107 INFO L273 TraceCheckUtils]: 40: Hoare triple {20520#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20520#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:57,108 INFO L273 TraceCheckUtils]: 41: Hoare triple {20520#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20521#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:57,109 INFO L273 TraceCheckUtils]: 42: Hoare triple {20521#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20521#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:57,109 INFO L273 TraceCheckUtils]: 43: Hoare triple {20521#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20522#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:57,110 INFO L273 TraceCheckUtils]: 44: Hoare triple {20522#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20522#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:57,111 INFO L273 TraceCheckUtils]: 45: Hoare triple {20522#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20523#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:57,111 INFO L273 TraceCheckUtils]: 46: Hoare triple {20523#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20523#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:57,112 INFO L273 TraceCheckUtils]: 47: Hoare triple {20523#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20524#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:57,113 INFO L273 TraceCheckUtils]: 48: Hoare triple {20524#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20524#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:57,113 INFO L273 TraceCheckUtils]: 49: Hoare triple {20524#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20525#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:57,114 INFO L273 TraceCheckUtils]: 50: Hoare triple {20525#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20525#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:57,115 INFO L273 TraceCheckUtils]: 51: Hoare triple {20525#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20526#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:57,115 INFO L273 TraceCheckUtils]: 52: Hoare triple {20526#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20526#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:57,116 INFO L273 TraceCheckUtils]: 53: Hoare triple {20526#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20527#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:57,116 INFO L273 TraceCheckUtils]: 54: Hoare triple {20527#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20527#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:57,117 INFO L273 TraceCheckUtils]: 55: Hoare triple {20527#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20528#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:57,118 INFO L273 TraceCheckUtils]: 56: Hoare triple {20528#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20528#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:57,118 INFO L273 TraceCheckUtils]: 57: Hoare triple {20528#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20529#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:57,119 INFO L273 TraceCheckUtils]: 58: Hoare triple {20529#(<= main_~i~0 26)} assume !(~i~0 < 100000); {20502#false} is VALID [2018-11-23 12:10:57,119 INFO L273 TraceCheckUtils]: 59: Hoare triple {20502#false} ~i~0 := 0; {20502#false} is VALID [2018-11-23 12:10:57,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {20502#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20502#false} is VALID [2018-11-23 12:10:57,120 INFO L256 TraceCheckUtils]: 61: Hoare triple {20502#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {20502#false} is VALID [2018-11-23 12:10:57,120 INFO L273 TraceCheckUtils]: 62: Hoare triple {20502#false} ~cond := #in~cond; {20502#false} is VALID [2018-11-23 12:10:57,120 INFO L273 TraceCheckUtils]: 63: Hoare triple {20502#false} assume 0 == ~cond; {20502#false} is VALID [2018-11-23 12:10:57,120 INFO L273 TraceCheckUtils]: 64: Hoare triple {20502#false} assume !false; {20502#false} is VALID [2018-11-23 12:10:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:57,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:57,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:10:57,143 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-11-23 12:10:57,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:57,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:10:57,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:57,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:10:57,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:10:57,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:10:57,215 INFO L87 Difference]: Start difference. First operand 200 states and 228 transitions. Second operand 30 states. [2018-11-23 12:10:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:59,088 INFO L93 Difference]: Finished difference Result 350 states and 408 transitions. [2018-11-23 12:10:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:10:59,088 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-11-23 12:10:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:10:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 253 transitions. [2018-11-23 12:10:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:10:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 253 transitions. [2018-11-23 12:10:59,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 253 transitions. [2018-11-23 12:10:59,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:59,352 INFO L225 Difference]: With dead ends: 350 [2018-11-23 12:10:59,353 INFO L226 Difference]: Without dead ends: 209 [2018-11-23 12:10:59,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:10:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-23 12:10:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-11-23 12:10:59,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:59,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 207 states. [2018-11-23 12:10:59,429 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 207 states. [2018-11-23 12:10:59,429 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 207 states. [2018-11-23 12:10:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:59,433 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2018-11-23 12:10:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 238 transitions. [2018-11-23 12:10:59,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:59,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:59,434 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 209 states. [2018-11-23 12:10:59,434 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 209 states. [2018-11-23 12:10:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:59,439 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2018-11-23 12:10:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 238 transitions. [2018-11-23 12:10:59,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:59,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:59,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:59,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 12:10:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 236 transitions. [2018-11-23 12:10:59,446 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 236 transitions. Word has length 65 [2018-11-23 12:10:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:59,446 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 236 transitions. [2018-11-23 12:10:59,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:10:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 236 transitions. [2018-11-23 12:10:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:10:59,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:59,447 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:59,447 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:59,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:59,447 INFO L82 PathProgramCache]: Analyzing trace with hash 681832897, now seen corresponding path program 27 times [2018-11-23 12:10:59,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:59,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:59,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:59,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:59,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:00,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {21933#true} call ULTIMATE.init(); {21933#true} is VALID [2018-11-23 12:11:00,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {21933#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21933#true} is VALID [2018-11-23 12:11:00,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {21933#true} assume true; {21933#true} is VALID [2018-11-23 12:11:00,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21933#true} {21933#true} #54#return; {21933#true} is VALID [2018-11-23 12:11:00,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {21933#true} call #t~ret3 := main(); {21933#true} is VALID [2018-11-23 12:11:00,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {21933#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {21935#(= main_~i~0 0)} is VALID [2018-11-23 12:11:00,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {21935#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21935#(= main_~i~0 0)} is VALID [2018-11-23 12:11:00,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {21935#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21936#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:00,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {21936#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21936#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:00,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {21936#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21937#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:00,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {21937#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21937#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:00,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {21937#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21938#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:00,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {21938#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21938#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:00,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {21938#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21939#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:00,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {21939#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21939#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:00,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {21939#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21940#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:00,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {21940#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21940#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:00,027 INFO L273 TraceCheckUtils]: 17: Hoare triple {21940#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21941#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:00,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {21941#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21941#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:00,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {21941#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21942#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:00,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {21942#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21942#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:00,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {21942#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21943#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:00,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {21943#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21943#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:00,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {21943#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21944#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:00,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {21944#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21944#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:00,032 INFO L273 TraceCheckUtils]: 25: Hoare triple {21944#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21945#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:00,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {21945#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21945#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:00,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {21945#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21946#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:00,034 INFO L273 TraceCheckUtils]: 28: Hoare triple {21946#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21946#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:00,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {21946#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21947#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:00,035 INFO L273 TraceCheckUtils]: 30: Hoare triple {21947#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21947#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:00,036 INFO L273 TraceCheckUtils]: 31: Hoare triple {21947#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21948#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:00,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {21948#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21948#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:00,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {21948#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21949#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:00,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {21949#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21949#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:00,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {21949#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21950#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:00,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {21950#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21950#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:00,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {21950#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21951#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:00,040 INFO L273 TraceCheckUtils]: 38: Hoare triple {21951#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21951#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:00,041 INFO L273 TraceCheckUtils]: 39: Hoare triple {21951#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21952#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:00,041 INFO L273 TraceCheckUtils]: 40: Hoare triple {21952#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21952#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:00,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {21952#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21953#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:00,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {21953#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21953#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:00,043 INFO L273 TraceCheckUtils]: 43: Hoare triple {21953#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21954#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:00,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {21954#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21954#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:00,045 INFO L273 TraceCheckUtils]: 45: Hoare triple {21954#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21955#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:00,045 INFO L273 TraceCheckUtils]: 46: Hoare triple {21955#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21955#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:00,046 INFO L273 TraceCheckUtils]: 47: Hoare triple {21955#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21956#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:00,046 INFO L273 TraceCheckUtils]: 48: Hoare triple {21956#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21956#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:00,047 INFO L273 TraceCheckUtils]: 49: Hoare triple {21956#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21957#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:00,048 INFO L273 TraceCheckUtils]: 50: Hoare triple {21957#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21957#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:00,048 INFO L273 TraceCheckUtils]: 51: Hoare triple {21957#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21958#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:00,049 INFO L273 TraceCheckUtils]: 52: Hoare triple {21958#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21958#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:00,050 INFO L273 TraceCheckUtils]: 53: Hoare triple {21958#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21959#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:00,050 INFO L273 TraceCheckUtils]: 54: Hoare triple {21959#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21959#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:00,051 INFO L273 TraceCheckUtils]: 55: Hoare triple {21959#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21960#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:00,051 INFO L273 TraceCheckUtils]: 56: Hoare triple {21960#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21960#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:00,052 INFO L273 TraceCheckUtils]: 57: Hoare triple {21960#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21961#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:00,053 INFO L273 TraceCheckUtils]: 58: Hoare triple {21961#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21961#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:00,054 INFO L273 TraceCheckUtils]: 59: Hoare triple {21961#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21962#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:00,054 INFO L273 TraceCheckUtils]: 60: Hoare triple {21962#(<= main_~i~0 27)} assume !(~i~0 < 100000); {21934#false} is VALID [2018-11-23 12:11:00,054 INFO L273 TraceCheckUtils]: 61: Hoare triple {21934#false} ~i~0 := 0; {21934#false} is VALID [2018-11-23 12:11:00,055 INFO L273 TraceCheckUtils]: 62: Hoare triple {21934#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21934#false} is VALID [2018-11-23 12:11:00,055 INFO L256 TraceCheckUtils]: 63: Hoare triple {21934#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {21934#false} is VALID [2018-11-23 12:11:00,055 INFO L273 TraceCheckUtils]: 64: Hoare triple {21934#false} ~cond := #in~cond; {21934#false} is VALID [2018-11-23 12:11:00,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {21934#false} assume 0 == ~cond; {21934#false} is VALID [2018-11-23 12:11:00,056 INFO L273 TraceCheckUtils]: 66: Hoare triple {21934#false} assume !false; {21934#false} is VALID [2018-11-23 12:11:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:00,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:00,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:00,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:11:00,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 12:11:00,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:00,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:00,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {21933#true} call ULTIMATE.init(); {21933#true} is VALID [2018-11-23 12:11:00,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {21933#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21933#true} is VALID [2018-11-23 12:11:00,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {21933#true} assume true; {21933#true} is VALID [2018-11-23 12:11:00,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21933#true} {21933#true} #54#return; {21933#true} is VALID [2018-11-23 12:11:00,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {21933#true} call #t~ret3 := main(); {21933#true} is VALID [2018-11-23 12:11:00,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {21933#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {21981#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:00,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {21981#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21981#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:00,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {21981#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21936#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:00,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {21936#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21936#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:00,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {21936#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21937#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:00,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {21937#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21937#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:00,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {21937#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21938#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:00,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {21938#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21938#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:00,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {21938#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21939#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:00,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {21939#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21939#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:00,698 INFO L273 TraceCheckUtils]: 15: Hoare triple {21939#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21940#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:00,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {21940#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21940#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:00,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {21940#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21941#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:00,700 INFO L273 TraceCheckUtils]: 18: Hoare triple {21941#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21941#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:00,701 INFO L273 TraceCheckUtils]: 19: Hoare triple {21941#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21942#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:00,702 INFO L273 TraceCheckUtils]: 20: Hoare triple {21942#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21942#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:00,702 INFO L273 TraceCheckUtils]: 21: Hoare triple {21942#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21943#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:00,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {21943#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21943#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:00,704 INFO L273 TraceCheckUtils]: 23: Hoare triple {21943#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21944#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:00,704 INFO L273 TraceCheckUtils]: 24: Hoare triple {21944#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21944#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:00,705 INFO L273 TraceCheckUtils]: 25: Hoare triple {21944#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21945#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:00,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {21945#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21945#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:00,706 INFO L273 TraceCheckUtils]: 27: Hoare triple {21945#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21946#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:00,707 INFO L273 TraceCheckUtils]: 28: Hoare triple {21946#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21946#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:00,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {21946#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21947#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:00,708 INFO L273 TraceCheckUtils]: 30: Hoare triple {21947#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21947#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:00,709 INFO L273 TraceCheckUtils]: 31: Hoare triple {21947#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21948#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:00,709 INFO L273 TraceCheckUtils]: 32: Hoare triple {21948#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21948#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:00,710 INFO L273 TraceCheckUtils]: 33: Hoare triple {21948#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21949#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:00,710 INFO L273 TraceCheckUtils]: 34: Hoare triple {21949#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21949#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:00,711 INFO L273 TraceCheckUtils]: 35: Hoare triple {21949#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21950#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:00,712 INFO L273 TraceCheckUtils]: 36: Hoare triple {21950#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21950#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:00,712 INFO L273 TraceCheckUtils]: 37: Hoare triple {21950#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21951#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:00,713 INFO L273 TraceCheckUtils]: 38: Hoare triple {21951#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21951#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:00,714 INFO L273 TraceCheckUtils]: 39: Hoare triple {21951#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21952#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:00,714 INFO L273 TraceCheckUtils]: 40: Hoare triple {21952#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21952#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:00,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {21952#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21953#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:00,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {21953#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21953#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:00,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {21953#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21954#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:00,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {21954#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21954#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:00,718 INFO L273 TraceCheckUtils]: 45: Hoare triple {21954#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21955#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:00,718 INFO L273 TraceCheckUtils]: 46: Hoare triple {21955#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21955#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:00,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {21955#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21956#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:00,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {21956#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21956#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:00,720 INFO L273 TraceCheckUtils]: 49: Hoare triple {21956#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21957#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:00,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {21957#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21957#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:00,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {21957#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21958#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:00,722 INFO L273 TraceCheckUtils]: 52: Hoare triple {21958#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21958#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:00,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {21958#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21959#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:00,723 INFO L273 TraceCheckUtils]: 54: Hoare triple {21959#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21959#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:00,724 INFO L273 TraceCheckUtils]: 55: Hoare triple {21959#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21960#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:00,725 INFO L273 TraceCheckUtils]: 56: Hoare triple {21960#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21960#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:00,725 INFO L273 TraceCheckUtils]: 57: Hoare triple {21960#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21961#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:00,726 INFO L273 TraceCheckUtils]: 58: Hoare triple {21961#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21961#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:00,727 INFO L273 TraceCheckUtils]: 59: Hoare triple {21961#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21962#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:00,727 INFO L273 TraceCheckUtils]: 60: Hoare triple {21962#(<= main_~i~0 27)} assume !(~i~0 < 100000); {21934#false} is VALID [2018-11-23 12:11:00,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {21934#false} ~i~0 := 0; {21934#false} is VALID [2018-11-23 12:11:00,728 INFO L273 TraceCheckUtils]: 62: Hoare triple {21934#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {21934#false} is VALID [2018-11-23 12:11:00,728 INFO L256 TraceCheckUtils]: 63: Hoare triple {21934#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {21934#false} is VALID [2018-11-23 12:11:00,728 INFO L273 TraceCheckUtils]: 64: Hoare triple {21934#false} ~cond := #in~cond; {21934#false} is VALID [2018-11-23 12:11:00,728 INFO L273 TraceCheckUtils]: 65: Hoare triple {21934#false} assume 0 == ~cond; {21934#false} is VALID [2018-11-23 12:11:00,728 INFO L273 TraceCheckUtils]: 66: Hoare triple {21934#false} assume !false; {21934#false} is VALID [2018-11-23 12:11:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:00,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:00,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:11:00,753 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2018-11-23 12:11:00,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:00,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:11:00,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:00,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:11:00,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:11:00,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:11:00,839 INFO L87 Difference]: Start difference. First operand 207 states and 236 transitions. Second operand 31 states. [2018-11-23 12:11:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:02,895 INFO L93 Difference]: Finished difference Result 362 states and 422 transitions. [2018-11-23 12:11:02,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:11:02,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2018-11-23 12:11:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:11:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 261 transitions. [2018-11-23 12:11:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:11:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 261 transitions. [2018-11-23 12:11:02,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 261 transitions. [2018-11-23 12:11:03,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:03,168 INFO L225 Difference]: With dead ends: 362 [2018-11-23 12:11:03,168 INFO L226 Difference]: Without dead ends: 216 [2018-11-23 12:11:03,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:11:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-23 12:11:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2018-11-23 12:11:03,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:03,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand 214 states. [2018-11-23 12:11:03,250 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 214 states. [2018-11-23 12:11:03,250 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 214 states. [2018-11-23 12:11:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:03,256 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2018-11-23 12:11:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 246 transitions. [2018-11-23 12:11:03,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:03,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:03,257 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 216 states. [2018-11-23 12:11:03,257 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 216 states. [2018-11-23 12:11:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:03,263 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2018-11-23 12:11:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 246 transitions. [2018-11-23 12:11:03,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:03,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:03,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:03,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-23 12:11:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 244 transitions. [2018-11-23 12:11:03,270 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 244 transitions. Word has length 67 [2018-11-23 12:11:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:03,270 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 244 transitions. [2018-11-23 12:11:03,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:11:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 244 transitions. [2018-11-23 12:11:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:11:03,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:03,271 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:03,271 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:03,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2006394081, now seen corresponding path program 28 times [2018-11-23 12:11:03,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:03,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:03,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:03,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:03,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:03,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {23413#true} call ULTIMATE.init(); {23413#true} is VALID [2018-11-23 12:11:03,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {23413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23413#true} is VALID [2018-11-23 12:11:03,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {23413#true} assume true; {23413#true} is VALID [2018-11-23 12:11:03,823 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23413#true} {23413#true} #54#return; {23413#true} is VALID [2018-11-23 12:11:03,823 INFO L256 TraceCheckUtils]: 4: Hoare triple {23413#true} call #t~ret3 := main(); {23413#true} is VALID [2018-11-23 12:11:03,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {23413#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {23415#(= main_~i~0 0)} is VALID [2018-11-23 12:11:03,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {23415#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23415#(= main_~i~0 0)} is VALID [2018-11-23 12:11:03,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {23415#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23416#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:03,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {23416#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23416#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:03,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {23416#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23417#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:03,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {23417#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23417#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:03,827 INFO L273 TraceCheckUtils]: 11: Hoare triple {23417#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23418#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:03,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {23418#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23418#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:03,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {23418#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23419#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:03,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {23419#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23419#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:03,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {23419#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23420#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:03,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {23420#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23420#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:03,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {23420#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23421#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:03,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {23421#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23421#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:03,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {23421#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23422#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:03,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {23422#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23422#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:03,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {23422#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23423#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:03,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {23423#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23423#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:03,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {23423#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23424#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:03,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {23424#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23424#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:03,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {23424#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23425#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:03,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {23425#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23425#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:03,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {23425#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23426#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:03,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {23426#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23426#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:03,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {23426#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23427#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:03,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {23427#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23427#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:03,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {23427#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23428#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:03,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {23428#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23428#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:03,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {23428#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23429#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:03,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {23429#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23429#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:03,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {23429#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23430#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:03,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {23430#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23430#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:03,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {23430#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23431#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:03,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {23431#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23431#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:03,844 INFO L273 TraceCheckUtils]: 39: Hoare triple {23431#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23432#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:03,845 INFO L273 TraceCheckUtils]: 40: Hoare triple {23432#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23432#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:03,845 INFO L273 TraceCheckUtils]: 41: Hoare triple {23432#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23433#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:03,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {23433#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23433#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:03,847 INFO L273 TraceCheckUtils]: 43: Hoare triple {23433#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23434#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:03,847 INFO L273 TraceCheckUtils]: 44: Hoare triple {23434#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23434#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:03,848 INFO L273 TraceCheckUtils]: 45: Hoare triple {23434#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23435#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:03,848 INFO L273 TraceCheckUtils]: 46: Hoare triple {23435#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23435#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:03,849 INFO L273 TraceCheckUtils]: 47: Hoare triple {23435#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23436#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:03,850 INFO L273 TraceCheckUtils]: 48: Hoare triple {23436#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23436#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:03,850 INFO L273 TraceCheckUtils]: 49: Hoare triple {23436#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23437#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:03,851 INFO L273 TraceCheckUtils]: 50: Hoare triple {23437#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23437#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:03,852 INFO L273 TraceCheckUtils]: 51: Hoare triple {23437#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23438#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:03,852 INFO L273 TraceCheckUtils]: 52: Hoare triple {23438#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23438#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:03,853 INFO L273 TraceCheckUtils]: 53: Hoare triple {23438#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23439#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:03,854 INFO L273 TraceCheckUtils]: 54: Hoare triple {23439#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23439#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:03,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {23439#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23440#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:03,855 INFO L273 TraceCheckUtils]: 56: Hoare triple {23440#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23440#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:03,856 INFO L273 TraceCheckUtils]: 57: Hoare triple {23440#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23441#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:03,856 INFO L273 TraceCheckUtils]: 58: Hoare triple {23441#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23441#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:03,857 INFO L273 TraceCheckUtils]: 59: Hoare triple {23441#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23442#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:03,857 INFO L273 TraceCheckUtils]: 60: Hoare triple {23442#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23442#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:03,858 INFO L273 TraceCheckUtils]: 61: Hoare triple {23442#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23443#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:03,859 INFO L273 TraceCheckUtils]: 62: Hoare triple {23443#(<= main_~i~0 28)} assume !(~i~0 < 100000); {23414#false} is VALID [2018-11-23 12:11:03,859 INFO L273 TraceCheckUtils]: 63: Hoare triple {23414#false} ~i~0 := 0; {23414#false} is VALID [2018-11-23 12:11:03,859 INFO L273 TraceCheckUtils]: 64: Hoare triple {23414#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23414#false} is VALID [2018-11-23 12:11:03,859 INFO L256 TraceCheckUtils]: 65: Hoare triple {23414#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {23414#false} is VALID [2018-11-23 12:11:03,860 INFO L273 TraceCheckUtils]: 66: Hoare triple {23414#false} ~cond := #in~cond; {23414#false} is VALID [2018-11-23 12:11:03,860 INFO L273 TraceCheckUtils]: 67: Hoare triple {23414#false} assume 0 == ~cond; {23414#false} is VALID [2018-11-23 12:11:03,860 INFO L273 TraceCheckUtils]: 68: Hoare triple {23414#false} assume !false; {23414#false} is VALID [2018-11-23 12:11:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:03,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:03,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:11:03,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:11:03,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:03,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:04,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {23413#true} call ULTIMATE.init(); {23413#true} is VALID [2018-11-23 12:11:04,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {23413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23413#true} is VALID [2018-11-23 12:11:04,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {23413#true} assume true; {23413#true} is VALID [2018-11-23 12:11:04,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23413#true} {23413#true} #54#return; {23413#true} is VALID [2018-11-23 12:11:04,112 INFO L256 TraceCheckUtils]: 4: Hoare triple {23413#true} call #t~ret3 := main(); {23413#true} is VALID [2018-11-23 12:11:04,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {23413#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {23462#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:04,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {23462#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23462#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:04,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {23462#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23416#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:04,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {23416#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23416#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:04,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {23416#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23417#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:04,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {23417#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23417#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:04,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {23417#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23418#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:04,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {23418#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23418#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:04,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {23418#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23419#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:04,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {23419#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23419#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:04,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {23419#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23420#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:04,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {23420#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23420#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:04,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {23420#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23421#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:04,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {23421#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23421#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:04,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {23421#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23422#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:04,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {23422#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23422#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:04,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {23422#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23423#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:04,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {23423#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23423#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:04,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {23423#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23424#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:04,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {23424#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23424#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:04,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {23424#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23425#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:04,125 INFO L273 TraceCheckUtils]: 26: Hoare triple {23425#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23425#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:04,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {23425#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23426#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:04,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {23426#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23426#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:04,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {23426#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23427#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:04,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {23427#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23427#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:04,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {23427#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23428#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:04,129 INFO L273 TraceCheckUtils]: 32: Hoare triple {23428#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23428#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:04,129 INFO L273 TraceCheckUtils]: 33: Hoare triple {23428#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23429#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:04,130 INFO L273 TraceCheckUtils]: 34: Hoare triple {23429#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23429#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:04,131 INFO L273 TraceCheckUtils]: 35: Hoare triple {23429#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23430#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:04,131 INFO L273 TraceCheckUtils]: 36: Hoare triple {23430#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23430#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:04,132 INFO L273 TraceCheckUtils]: 37: Hoare triple {23430#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23431#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:04,132 INFO L273 TraceCheckUtils]: 38: Hoare triple {23431#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23431#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:04,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {23431#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23432#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:04,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {23432#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23432#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:04,134 INFO L273 TraceCheckUtils]: 41: Hoare triple {23432#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23433#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:04,135 INFO L273 TraceCheckUtils]: 42: Hoare triple {23433#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23433#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:04,136 INFO L273 TraceCheckUtils]: 43: Hoare triple {23433#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23434#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:04,136 INFO L273 TraceCheckUtils]: 44: Hoare triple {23434#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23434#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:04,137 INFO L273 TraceCheckUtils]: 45: Hoare triple {23434#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23435#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:04,137 INFO L273 TraceCheckUtils]: 46: Hoare triple {23435#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23435#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:04,138 INFO L273 TraceCheckUtils]: 47: Hoare triple {23435#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23436#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:04,139 INFO L273 TraceCheckUtils]: 48: Hoare triple {23436#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23436#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:04,140 INFO L273 TraceCheckUtils]: 49: Hoare triple {23436#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23437#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:04,140 INFO L273 TraceCheckUtils]: 50: Hoare triple {23437#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23437#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:04,141 INFO L273 TraceCheckUtils]: 51: Hoare triple {23437#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23438#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:04,141 INFO L273 TraceCheckUtils]: 52: Hoare triple {23438#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23438#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:04,142 INFO L273 TraceCheckUtils]: 53: Hoare triple {23438#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23439#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:04,143 INFO L273 TraceCheckUtils]: 54: Hoare triple {23439#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23439#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:04,143 INFO L273 TraceCheckUtils]: 55: Hoare triple {23439#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23440#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:04,144 INFO L273 TraceCheckUtils]: 56: Hoare triple {23440#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23440#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:04,145 INFO L273 TraceCheckUtils]: 57: Hoare triple {23440#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23441#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:04,145 INFO L273 TraceCheckUtils]: 58: Hoare triple {23441#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23441#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:04,146 INFO L273 TraceCheckUtils]: 59: Hoare triple {23441#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23442#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:04,147 INFO L273 TraceCheckUtils]: 60: Hoare triple {23442#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23442#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:04,147 INFO L273 TraceCheckUtils]: 61: Hoare triple {23442#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23443#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:04,148 INFO L273 TraceCheckUtils]: 62: Hoare triple {23443#(<= main_~i~0 28)} assume !(~i~0 < 100000); {23414#false} is VALID [2018-11-23 12:11:04,148 INFO L273 TraceCheckUtils]: 63: Hoare triple {23414#false} ~i~0 := 0; {23414#false} is VALID [2018-11-23 12:11:04,148 INFO L273 TraceCheckUtils]: 64: Hoare triple {23414#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23414#false} is VALID [2018-11-23 12:11:04,149 INFO L256 TraceCheckUtils]: 65: Hoare triple {23414#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {23414#false} is VALID [2018-11-23 12:11:04,149 INFO L273 TraceCheckUtils]: 66: Hoare triple {23414#false} ~cond := #in~cond; {23414#false} is VALID [2018-11-23 12:11:04,149 INFO L273 TraceCheckUtils]: 67: Hoare triple {23414#false} assume 0 == ~cond; {23414#false} is VALID [2018-11-23 12:11:04,149 INFO L273 TraceCheckUtils]: 68: Hoare triple {23414#false} assume !false; {23414#false} is VALID [2018-11-23 12:11:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:04,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:04,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 12:11:04,174 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-11-23 12:11:04,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:04,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:11:04,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:04,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:11:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:11:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:11:04,245 INFO L87 Difference]: Start difference. First operand 214 states and 244 transitions. Second operand 32 states. [2018-11-23 12:11:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:05,878 INFO L93 Difference]: Finished difference Result 374 states and 436 transitions. [2018-11-23 12:11:05,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:11:05,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-11-23 12:11:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:11:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 269 transitions. [2018-11-23 12:11:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:11:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 269 transitions. [2018-11-23 12:11:05,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 269 transitions. [2018-11-23 12:11:06,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:06,149 INFO L225 Difference]: With dead ends: 374 [2018-11-23 12:11:06,150 INFO L226 Difference]: Without dead ends: 223 [2018-11-23 12:11:06,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:11:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-23 12:11:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-11-23 12:11:06,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:06,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand 221 states. [2018-11-23 12:11:06,681 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 221 states. [2018-11-23 12:11:06,681 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 221 states. [2018-11-23 12:11:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:06,686 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-11-23 12:11:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 254 transitions. [2018-11-23 12:11:06,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:06,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:06,686 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 223 states. [2018-11-23 12:11:06,686 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 223 states. [2018-11-23 12:11:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:06,692 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-11-23 12:11:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 254 transitions. [2018-11-23 12:11:06,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:06,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:06,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:06,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-23 12:11:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 252 transitions. [2018-11-23 12:11:06,699 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 252 transitions. Word has length 69 [2018-11-23 12:11:06,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:06,699 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 252 transitions. [2018-11-23 12:11:06,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:11:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 252 transitions. [2018-11-23 12:11:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:11:06,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:06,700 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:06,700 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:06,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 177792253, now seen corresponding path program 29 times [2018-11-23 12:11:06,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:06,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:06,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:07,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {24941#true} call ULTIMATE.init(); {24941#true} is VALID [2018-11-23 12:11:07,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {24941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24941#true} is VALID [2018-11-23 12:11:07,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {24941#true} assume true; {24941#true} is VALID [2018-11-23 12:11:07,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24941#true} {24941#true} #54#return; {24941#true} is VALID [2018-11-23 12:11:07,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {24941#true} call #t~ret3 := main(); {24941#true} is VALID [2018-11-23 12:11:07,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {24941#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {24943#(= main_~i~0 0)} is VALID [2018-11-23 12:11:07,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {24943#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24943#(= main_~i~0 0)} is VALID [2018-11-23 12:11:07,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {24943#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24944#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:07,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {24944#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24944#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:07,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {24944#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24945#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:07,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {24945#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24945#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:07,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {24945#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24946#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:07,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {24946#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24946#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:07,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {24946#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24947#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:07,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {24947#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24947#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:07,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {24947#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24948#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:07,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {24948#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24948#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:07,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {24948#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24949#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:07,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {24949#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24949#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:07,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {24949#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24950#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:07,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {24950#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24950#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:07,754 INFO L273 TraceCheckUtils]: 21: Hoare triple {24950#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24951#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:07,755 INFO L273 TraceCheckUtils]: 22: Hoare triple {24951#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24951#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:07,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {24951#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24952#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:07,756 INFO L273 TraceCheckUtils]: 24: Hoare triple {24952#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24952#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:07,757 INFO L273 TraceCheckUtils]: 25: Hoare triple {24952#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24953#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:07,757 INFO L273 TraceCheckUtils]: 26: Hoare triple {24953#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24953#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:07,758 INFO L273 TraceCheckUtils]: 27: Hoare triple {24953#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24954#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:07,759 INFO L273 TraceCheckUtils]: 28: Hoare triple {24954#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24954#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:07,759 INFO L273 TraceCheckUtils]: 29: Hoare triple {24954#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24955#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:07,760 INFO L273 TraceCheckUtils]: 30: Hoare triple {24955#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24955#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:07,761 INFO L273 TraceCheckUtils]: 31: Hoare triple {24955#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:07,761 INFO L273 TraceCheckUtils]: 32: Hoare triple {24956#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24956#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:07,762 INFO L273 TraceCheckUtils]: 33: Hoare triple {24956#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:07,763 INFO L273 TraceCheckUtils]: 34: Hoare triple {24957#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24957#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:07,763 INFO L273 TraceCheckUtils]: 35: Hoare triple {24957#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24958#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:07,764 INFO L273 TraceCheckUtils]: 36: Hoare triple {24958#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24958#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:07,765 INFO L273 TraceCheckUtils]: 37: Hoare triple {24958#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24959#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:07,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {24959#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24959#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:07,766 INFO L273 TraceCheckUtils]: 39: Hoare triple {24959#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24960#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:07,766 INFO L273 TraceCheckUtils]: 40: Hoare triple {24960#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24960#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:07,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {24960#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24961#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:07,768 INFO L273 TraceCheckUtils]: 42: Hoare triple {24961#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24961#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:07,768 INFO L273 TraceCheckUtils]: 43: Hoare triple {24961#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24962#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:07,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {24962#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24962#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:07,770 INFO L273 TraceCheckUtils]: 45: Hoare triple {24962#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24963#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:07,770 INFO L273 TraceCheckUtils]: 46: Hoare triple {24963#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24963#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:07,771 INFO L273 TraceCheckUtils]: 47: Hoare triple {24963#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24964#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:07,772 INFO L273 TraceCheckUtils]: 48: Hoare triple {24964#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24964#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:07,772 INFO L273 TraceCheckUtils]: 49: Hoare triple {24964#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24965#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:07,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {24965#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24965#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:07,774 INFO L273 TraceCheckUtils]: 51: Hoare triple {24965#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24966#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:07,774 INFO L273 TraceCheckUtils]: 52: Hoare triple {24966#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24966#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:07,775 INFO L273 TraceCheckUtils]: 53: Hoare triple {24966#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24967#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:07,776 INFO L273 TraceCheckUtils]: 54: Hoare triple {24967#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24967#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:07,776 INFO L273 TraceCheckUtils]: 55: Hoare triple {24967#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:07,777 INFO L273 TraceCheckUtils]: 56: Hoare triple {24968#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24968#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:07,777 INFO L273 TraceCheckUtils]: 57: Hoare triple {24968#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:07,778 INFO L273 TraceCheckUtils]: 58: Hoare triple {24969#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24969#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:07,779 INFO L273 TraceCheckUtils]: 59: Hoare triple {24969#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24970#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:07,779 INFO L273 TraceCheckUtils]: 60: Hoare triple {24970#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24970#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:07,780 INFO L273 TraceCheckUtils]: 61: Hoare triple {24970#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24971#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:07,781 INFO L273 TraceCheckUtils]: 62: Hoare triple {24971#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24971#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:07,781 INFO L273 TraceCheckUtils]: 63: Hoare triple {24971#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24972#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:07,782 INFO L273 TraceCheckUtils]: 64: Hoare triple {24972#(<= main_~i~0 29)} assume !(~i~0 < 100000); {24942#false} is VALID [2018-11-23 12:11:07,782 INFO L273 TraceCheckUtils]: 65: Hoare triple {24942#false} ~i~0 := 0; {24942#false} is VALID [2018-11-23 12:11:07,782 INFO L273 TraceCheckUtils]: 66: Hoare triple {24942#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24942#false} is VALID [2018-11-23 12:11:07,783 INFO L256 TraceCheckUtils]: 67: Hoare triple {24942#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {24942#false} is VALID [2018-11-23 12:11:07,783 INFO L273 TraceCheckUtils]: 68: Hoare triple {24942#false} ~cond := #in~cond; {24942#false} is VALID [2018-11-23 12:11:07,783 INFO L273 TraceCheckUtils]: 69: Hoare triple {24942#false} assume 0 == ~cond; {24942#false} is VALID [2018-11-23 12:11:07,783 INFO L273 TraceCheckUtils]: 70: Hoare triple {24942#false} assume !false; {24942#false} is VALID [2018-11-23 12:11:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:07,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:07,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:07,797 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:11:08,491 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 12:11:08,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:08,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:08,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {24941#true} call ULTIMATE.init(); {24941#true} is VALID [2018-11-23 12:11:08,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {24941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24941#true} is VALID [2018-11-23 12:11:08,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {24941#true} assume true; {24941#true} is VALID [2018-11-23 12:11:08,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24941#true} {24941#true} #54#return; {24941#true} is VALID [2018-11-23 12:11:08,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {24941#true} call #t~ret3 := main(); {24941#true} is VALID [2018-11-23 12:11:08,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {24941#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {24991#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:08,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {24991#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24991#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:08,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {24991#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24944#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:08,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {24944#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24944#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:08,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {24944#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24945#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:08,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {24945#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24945#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:08,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {24945#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24946#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:08,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {24946#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24946#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:08,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {24946#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24947#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:08,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {24947#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24947#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:08,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {24947#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24948#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:08,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {24948#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24948#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:08,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {24948#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24949#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:08,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {24949#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24949#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:08,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {24949#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24950#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:08,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {24950#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24950#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:08,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {24950#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24951#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:08,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {24951#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24951#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:08,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {24951#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24952#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:08,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {24952#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24952#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:08,744 INFO L273 TraceCheckUtils]: 25: Hoare triple {24952#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24953#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:08,744 INFO L273 TraceCheckUtils]: 26: Hoare triple {24953#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24953#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:08,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {24953#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24954#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:08,746 INFO L273 TraceCheckUtils]: 28: Hoare triple {24954#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24954#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:08,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {24954#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24955#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:08,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {24955#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24955#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:08,748 INFO L273 TraceCheckUtils]: 31: Hoare triple {24955#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24956#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:08,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {24956#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24956#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:08,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {24956#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24957#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:08,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {24957#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24957#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:08,750 INFO L273 TraceCheckUtils]: 35: Hoare triple {24957#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24958#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:08,751 INFO L273 TraceCheckUtils]: 36: Hoare triple {24958#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24958#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:08,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {24958#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24959#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:08,752 INFO L273 TraceCheckUtils]: 38: Hoare triple {24959#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24959#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:08,753 INFO L273 TraceCheckUtils]: 39: Hoare triple {24959#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24960#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:08,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {24960#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24960#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:08,754 INFO L273 TraceCheckUtils]: 41: Hoare triple {24960#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24961#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:08,755 INFO L273 TraceCheckUtils]: 42: Hoare triple {24961#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24961#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:08,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {24961#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24962#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:08,756 INFO L273 TraceCheckUtils]: 44: Hoare triple {24962#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24962#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:08,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {24962#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24963#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:08,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {24963#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24963#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:08,758 INFO L273 TraceCheckUtils]: 47: Hoare triple {24963#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24964#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:08,759 INFO L273 TraceCheckUtils]: 48: Hoare triple {24964#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24964#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:08,759 INFO L273 TraceCheckUtils]: 49: Hoare triple {24964#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24965#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:08,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {24965#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24965#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:08,761 INFO L273 TraceCheckUtils]: 51: Hoare triple {24965#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24966#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:08,761 INFO L273 TraceCheckUtils]: 52: Hoare triple {24966#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24966#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:08,762 INFO L273 TraceCheckUtils]: 53: Hoare triple {24966#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24967#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:08,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {24967#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24967#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:08,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {24967#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24968#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:08,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {24968#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24968#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:08,765 INFO L273 TraceCheckUtils]: 57: Hoare triple {24968#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24969#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:08,765 INFO L273 TraceCheckUtils]: 58: Hoare triple {24969#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24969#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:08,766 INFO L273 TraceCheckUtils]: 59: Hoare triple {24969#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24970#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:08,766 INFO L273 TraceCheckUtils]: 60: Hoare triple {24970#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24970#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:08,767 INFO L273 TraceCheckUtils]: 61: Hoare triple {24970#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24971#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:08,768 INFO L273 TraceCheckUtils]: 62: Hoare triple {24971#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24971#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:08,768 INFO L273 TraceCheckUtils]: 63: Hoare triple {24971#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24972#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:08,769 INFO L273 TraceCheckUtils]: 64: Hoare triple {24972#(<= main_~i~0 29)} assume !(~i~0 < 100000); {24942#false} is VALID [2018-11-23 12:11:08,769 INFO L273 TraceCheckUtils]: 65: Hoare triple {24942#false} ~i~0 := 0; {24942#false} is VALID [2018-11-23 12:11:08,770 INFO L273 TraceCheckUtils]: 66: Hoare triple {24942#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {24942#false} is VALID [2018-11-23 12:11:08,770 INFO L256 TraceCheckUtils]: 67: Hoare triple {24942#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {24942#false} is VALID [2018-11-23 12:11:08,770 INFO L273 TraceCheckUtils]: 68: Hoare triple {24942#false} ~cond := #in~cond; {24942#false} is VALID [2018-11-23 12:11:08,770 INFO L273 TraceCheckUtils]: 69: Hoare triple {24942#false} assume 0 == ~cond; {24942#false} is VALID [2018-11-23 12:11:08,770 INFO L273 TraceCheckUtils]: 70: Hoare triple {24942#false} assume !false; {24942#false} is VALID [2018-11-23 12:11:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:08,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:08,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 12:11:08,796 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2018-11-23 12:11:08,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:08,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:11:08,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:08,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:11:08,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:11:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:11:08,869 INFO L87 Difference]: Start difference. First operand 221 states and 252 transitions. Second operand 33 states. [2018-11-23 12:11:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:10,687 INFO L93 Difference]: Finished difference Result 386 states and 450 transitions. [2018-11-23 12:11:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:11:10,687 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2018-11-23 12:11:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:11:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 277 transitions. [2018-11-23 12:11:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:11:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 277 transitions. [2018-11-23 12:11:10,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 277 transitions. [2018-11-23 12:11:10,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:10,977 INFO L225 Difference]: With dead ends: 386 [2018-11-23 12:11:10,977 INFO L226 Difference]: Without dead ends: 230 [2018-11-23 12:11:10,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:11:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-23 12:11:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-11-23 12:11:11,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:11,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand 228 states. [2018-11-23 12:11:11,045 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand 228 states. [2018-11-23 12:11:11,045 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 228 states. [2018-11-23 12:11:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:11,050 INFO L93 Difference]: Finished difference Result 230 states and 262 transitions. [2018-11-23 12:11:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 262 transitions. [2018-11-23 12:11:11,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:11,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:11,051 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand 230 states. [2018-11-23 12:11:11,051 INFO L87 Difference]: Start difference. First operand 228 states. Second operand 230 states. [2018-11-23 12:11:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:11,056 INFO L93 Difference]: Finished difference Result 230 states and 262 transitions. [2018-11-23 12:11:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 262 transitions. [2018-11-23 12:11:11,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:11,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:11,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:11,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-23 12:11:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 260 transitions. [2018-11-23 12:11:11,061 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 260 transitions. Word has length 71 [2018-11-23 12:11:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:11,061 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 260 transitions. [2018-11-23 12:11:11,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:11:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 260 transitions. [2018-11-23 12:11:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:11:11,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:11,062 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:11,062 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:11,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:11,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1058148517, now seen corresponding path program 30 times [2018-11-23 12:11:11,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:11,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:11,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:11,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:11,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {26517#true} call ULTIMATE.init(); {26517#true} is VALID [2018-11-23 12:11:11,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {26517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26517#true} is VALID [2018-11-23 12:11:11,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {26517#true} assume true; {26517#true} is VALID [2018-11-23 12:11:11,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26517#true} {26517#true} #54#return; {26517#true} is VALID [2018-11-23 12:11:11,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {26517#true} call #t~ret3 := main(); {26517#true} is VALID [2018-11-23 12:11:11,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {26517#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {26519#(= main_~i~0 0)} is VALID [2018-11-23 12:11:11,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {26519#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26519#(= main_~i~0 0)} is VALID [2018-11-23 12:11:11,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {26519#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26520#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:11,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {26520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26520#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:11,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {26520#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26521#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:11,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {26521#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26521#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:11,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {26521#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26522#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:11,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {26522#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:11,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {26522#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26523#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:11,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {26523#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:11,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {26523#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26524#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:11,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {26524#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:11,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {26524#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26525#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:11,802 INFO L273 TraceCheckUtils]: 18: Hoare triple {26525#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:11,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {26525#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26526#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:11,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {26526#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:11,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {26526#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26527#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:11,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {26527#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:11,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {26527#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26528#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:11,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {26528#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:11,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {26528#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26529#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:11,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {26529#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:11,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {26529#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26530#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:11,809 INFO L273 TraceCheckUtils]: 28: Hoare triple {26530#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:11,809 INFO L273 TraceCheckUtils]: 29: Hoare triple {26530#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26531#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:11,810 INFO L273 TraceCheckUtils]: 30: Hoare triple {26531#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:11,811 INFO L273 TraceCheckUtils]: 31: Hoare triple {26531#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26532#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:11,811 INFO L273 TraceCheckUtils]: 32: Hoare triple {26532#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26532#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:11,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {26532#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26533#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:11,813 INFO L273 TraceCheckUtils]: 34: Hoare triple {26533#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26533#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:11,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {26533#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26534#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:11,814 INFO L273 TraceCheckUtils]: 36: Hoare triple {26534#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26534#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:11,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {26534#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26535#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:11,815 INFO L273 TraceCheckUtils]: 38: Hoare triple {26535#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26535#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:11,816 INFO L273 TraceCheckUtils]: 39: Hoare triple {26535#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26536#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:11,816 INFO L273 TraceCheckUtils]: 40: Hoare triple {26536#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26536#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:11,817 INFO L273 TraceCheckUtils]: 41: Hoare triple {26536#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26537#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:11,818 INFO L273 TraceCheckUtils]: 42: Hoare triple {26537#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26537#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:11,818 INFO L273 TraceCheckUtils]: 43: Hoare triple {26537#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26538#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:11,819 INFO L273 TraceCheckUtils]: 44: Hoare triple {26538#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26538#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:11,820 INFO L273 TraceCheckUtils]: 45: Hoare triple {26538#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26539#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:11,820 INFO L273 TraceCheckUtils]: 46: Hoare triple {26539#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26539#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:11,821 INFO L273 TraceCheckUtils]: 47: Hoare triple {26539#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26540#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:11,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {26540#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26540#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:11,822 INFO L273 TraceCheckUtils]: 49: Hoare triple {26540#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26541#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:11,823 INFO L273 TraceCheckUtils]: 50: Hoare triple {26541#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26541#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:11,824 INFO L273 TraceCheckUtils]: 51: Hoare triple {26541#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26542#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:11,824 INFO L273 TraceCheckUtils]: 52: Hoare triple {26542#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26542#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:11,825 INFO L273 TraceCheckUtils]: 53: Hoare triple {26542#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26543#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:11,825 INFO L273 TraceCheckUtils]: 54: Hoare triple {26543#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26543#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:11,826 INFO L273 TraceCheckUtils]: 55: Hoare triple {26543#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26544#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:11,827 INFO L273 TraceCheckUtils]: 56: Hoare triple {26544#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26544#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:11,827 INFO L273 TraceCheckUtils]: 57: Hoare triple {26544#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26545#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:11,828 INFO L273 TraceCheckUtils]: 58: Hoare triple {26545#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26545#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:11,829 INFO L273 TraceCheckUtils]: 59: Hoare triple {26545#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26546#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:11,829 INFO L273 TraceCheckUtils]: 60: Hoare triple {26546#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26546#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:11,830 INFO L273 TraceCheckUtils]: 61: Hoare triple {26546#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26547#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:11,831 INFO L273 TraceCheckUtils]: 62: Hoare triple {26547#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26547#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:11,831 INFO L273 TraceCheckUtils]: 63: Hoare triple {26547#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26548#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:11,832 INFO L273 TraceCheckUtils]: 64: Hoare triple {26548#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26548#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:11,833 INFO L273 TraceCheckUtils]: 65: Hoare triple {26548#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26549#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:11,833 INFO L273 TraceCheckUtils]: 66: Hoare triple {26549#(<= main_~i~0 30)} assume !(~i~0 < 100000); {26518#false} is VALID [2018-11-23 12:11:11,833 INFO L273 TraceCheckUtils]: 67: Hoare triple {26518#false} ~i~0 := 0; {26518#false} is VALID [2018-11-23 12:11:11,834 INFO L273 TraceCheckUtils]: 68: Hoare triple {26518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26518#false} is VALID [2018-11-23 12:11:11,834 INFO L256 TraceCheckUtils]: 69: Hoare triple {26518#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {26518#false} is VALID [2018-11-23 12:11:11,834 INFO L273 TraceCheckUtils]: 70: Hoare triple {26518#false} ~cond := #in~cond; {26518#false} is VALID [2018-11-23 12:11:11,834 INFO L273 TraceCheckUtils]: 71: Hoare triple {26518#false} assume 0 == ~cond; {26518#false} is VALID [2018-11-23 12:11:11,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {26518#false} assume !false; {26518#false} is VALID [2018-11-23 12:11:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:11,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:11,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:11,849 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:11:21,538 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 12:11:21,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:21,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:21,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {26517#true} call ULTIMATE.init(); {26517#true} is VALID [2018-11-23 12:11:21,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {26517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26517#true} is VALID [2018-11-23 12:11:21,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {26517#true} assume true; {26517#true} is VALID [2018-11-23 12:11:21,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26517#true} {26517#true} #54#return; {26517#true} is VALID [2018-11-23 12:11:21,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {26517#true} call #t~ret3 := main(); {26517#true} is VALID [2018-11-23 12:11:21,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {26517#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {26568#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:21,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {26568#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26568#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:21,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {26568#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26520#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:21,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {26520#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26520#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:21,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {26520#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26521#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:21,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {26521#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26521#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:21,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {26521#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26522#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:21,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {26522#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26522#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:21,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {26522#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26523#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:21,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {26523#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26523#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:21,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {26523#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26524#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:21,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {26524#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26524#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:21,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {26524#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26525#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:21,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {26525#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26525#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:21,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {26525#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26526#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:21,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {26526#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26526#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:21,970 INFO L273 TraceCheckUtils]: 21: Hoare triple {26526#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26527#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:21,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {26527#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26527#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:21,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {26527#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26528#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:21,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {26528#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26528#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:21,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {26528#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26529#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:21,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {26529#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26529#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:21,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {26529#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26530#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:21,983 INFO L273 TraceCheckUtils]: 28: Hoare triple {26530#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26530#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:21,983 INFO L273 TraceCheckUtils]: 29: Hoare triple {26530#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26531#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:21,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {26531#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26531#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:21,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {26531#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26532#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:21,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {26532#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26532#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:21,985 INFO L273 TraceCheckUtils]: 33: Hoare triple {26532#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26533#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:21,985 INFO L273 TraceCheckUtils]: 34: Hoare triple {26533#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26533#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:21,986 INFO L273 TraceCheckUtils]: 35: Hoare triple {26533#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26534#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:21,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {26534#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26534#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:21,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {26534#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26535#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:21,988 INFO L273 TraceCheckUtils]: 38: Hoare triple {26535#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26535#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:21,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {26535#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26536#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:21,989 INFO L273 TraceCheckUtils]: 40: Hoare triple {26536#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26536#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:21,990 INFO L273 TraceCheckUtils]: 41: Hoare triple {26536#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26537#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:21,990 INFO L273 TraceCheckUtils]: 42: Hoare triple {26537#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26537#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:21,991 INFO L273 TraceCheckUtils]: 43: Hoare triple {26537#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26538#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:21,991 INFO L273 TraceCheckUtils]: 44: Hoare triple {26538#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26538#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:21,992 INFO L273 TraceCheckUtils]: 45: Hoare triple {26538#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26539#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:21,993 INFO L273 TraceCheckUtils]: 46: Hoare triple {26539#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26539#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:21,993 INFO L273 TraceCheckUtils]: 47: Hoare triple {26539#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26540#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:21,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {26540#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26540#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:21,995 INFO L273 TraceCheckUtils]: 49: Hoare triple {26540#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26541#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:21,995 INFO L273 TraceCheckUtils]: 50: Hoare triple {26541#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26541#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:21,996 INFO L273 TraceCheckUtils]: 51: Hoare triple {26541#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26542#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:21,996 INFO L273 TraceCheckUtils]: 52: Hoare triple {26542#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26542#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:21,997 INFO L273 TraceCheckUtils]: 53: Hoare triple {26542#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26543#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:21,997 INFO L273 TraceCheckUtils]: 54: Hoare triple {26543#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26543#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:21,998 INFO L273 TraceCheckUtils]: 55: Hoare triple {26543#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26544#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:21,999 INFO L273 TraceCheckUtils]: 56: Hoare triple {26544#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26544#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:21,999 INFO L273 TraceCheckUtils]: 57: Hoare triple {26544#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26545#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:22,000 INFO L273 TraceCheckUtils]: 58: Hoare triple {26545#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26545#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:22,001 INFO L273 TraceCheckUtils]: 59: Hoare triple {26545#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26546#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:22,001 INFO L273 TraceCheckUtils]: 60: Hoare triple {26546#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26546#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:22,002 INFO L273 TraceCheckUtils]: 61: Hoare triple {26546#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26547#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:22,002 INFO L273 TraceCheckUtils]: 62: Hoare triple {26547#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26547#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:22,003 INFO L273 TraceCheckUtils]: 63: Hoare triple {26547#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26548#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:22,003 INFO L273 TraceCheckUtils]: 64: Hoare triple {26548#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26548#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:22,004 INFO L273 TraceCheckUtils]: 65: Hoare triple {26548#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26549#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:22,005 INFO L273 TraceCheckUtils]: 66: Hoare triple {26549#(<= main_~i~0 30)} assume !(~i~0 < 100000); {26518#false} is VALID [2018-11-23 12:11:22,005 INFO L273 TraceCheckUtils]: 67: Hoare triple {26518#false} ~i~0 := 0; {26518#false} is VALID [2018-11-23 12:11:22,005 INFO L273 TraceCheckUtils]: 68: Hoare triple {26518#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26518#false} is VALID [2018-11-23 12:11:22,005 INFO L256 TraceCheckUtils]: 69: Hoare triple {26518#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {26518#false} is VALID [2018-11-23 12:11:22,006 INFO L273 TraceCheckUtils]: 70: Hoare triple {26518#false} ~cond := #in~cond; {26518#false} is VALID [2018-11-23 12:11:22,006 INFO L273 TraceCheckUtils]: 71: Hoare triple {26518#false} assume 0 == ~cond; {26518#false} is VALID [2018-11-23 12:11:22,006 INFO L273 TraceCheckUtils]: 72: Hoare triple {26518#false} assume !false; {26518#false} is VALID [2018-11-23 12:11:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:22,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:22,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 12:11:22,034 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-11-23 12:11:22,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:22,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:11:22,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:22,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:11:22,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:11:22,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:11:22,106 INFO L87 Difference]: Start difference. First operand 228 states and 260 transitions. Second operand 34 states. [2018-11-23 12:11:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:24,359 INFO L93 Difference]: Finished difference Result 398 states and 464 transitions. [2018-11-23 12:11:24,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:11:24,359 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-11-23 12:11:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:11:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 285 transitions. [2018-11-23 12:11:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:11:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 285 transitions. [2018-11-23 12:11:24,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 285 transitions. [2018-11-23 12:11:24,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:24,652 INFO L225 Difference]: With dead ends: 398 [2018-11-23 12:11:24,652 INFO L226 Difference]: Without dead ends: 237 [2018-11-23 12:11:24,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:11:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-23 12:11:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-11-23 12:11:24,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:24,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand 235 states. [2018-11-23 12:11:24,778 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand 235 states. [2018-11-23 12:11:24,778 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 235 states. [2018-11-23 12:11:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:24,784 INFO L93 Difference]: Finished difference Result 237 states and 270 transitions. [2018-11-23 12:11:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 270 transitions. [2018-11-23 12:11:24,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:24,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:24,784 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 237 states. [2018-11-23 12:11:24,785 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 237 states. [2018-11-23 12:11:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:24,789 INFO L93 Difference]: Finished difference Result 237 states and 270 transitions. [2018-11-23 12:11:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 270 transitions. [2018-11-23 12:11:24,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:24,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:24,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:24,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-23 12:11:24,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 268 transitions. [2018-11-23 12:11:24,794 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 268 transitions. Word has length 73 [2018-11-23 12:11:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:24,795 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 268 transitions. [2018-11-23 12:11:24,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:11:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 268 transitions. [2018-11-23 12:11:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 12:11:24,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:24,795 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:24,796 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:24,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:24,796 INFO L82 PathProgramCache]: Analyzing trace with hash 908712505, now seen corresponding path program 31 times [2018-11-23 12:11:24,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:24,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:24,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:24,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:24,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:25,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {28141#true} call ULTIMATE.init(); {28141#true} is VALID [2018-11-23 12:11:25,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {28141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28141#true} is VALID [2018-11-23 12:11:25,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {28141#true} assume true; {28141#true} is VALID [2018-11-23 12:11:25,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28141#true} {28141#true} #54#return; {28141#true} is VALID [2018-11-23 12:11:25,696 INFO L256 TraceCheckUtils]: 4: Hoare triple {28141#true} call #t~ret3 := main(); {28141#true} is VALID [2018-11-23 12:11:25,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {28141#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {28143#(= main_~i~0 0)} is VALID [2018-11-23 12:11:25,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {28143#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28143#(= main_~i~0 0)} is VALID [2018-11-23 12:11:25,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {28143#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28144#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:25,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {28144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28144#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:25,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {28144#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28145#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:25,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {28145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28145#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:25,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {28145#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28146#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:25,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {28146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28146#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:25,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {28146#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28147#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:25,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {28147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28147#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:25,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {28147#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28148#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:25,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {28148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28148#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:25,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {28148#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28149#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:25,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {28149#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28149#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:25,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {28149#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28150#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:25,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {28150#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28150#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:25,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {28150#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28151#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:25,707 INFO L273 TraceCheckUtils]: 22: Hoare triple {28151#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28151#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:25,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {28151#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28152#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:25,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {28152#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28152#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:25,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {28152#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28153#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:25,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {28153#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28153#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:25,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {28153#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28154#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:25,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {28154#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28154#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:25,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {28154#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28155#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:25,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {28155#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28155#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:25,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {28155#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28156#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:25,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {28156#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28156#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:25,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {28156#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28157#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:25,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {28157#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28157#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:25,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {28157#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28158#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:25,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {28158#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28158#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:25,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {28158#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28159#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:25,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {28159#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28159#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:25,717 INFO L273 TraceCheckUtils]: 39: Hoare triple {28159#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28160#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:25,717 INFO L273 TraceCheckUtils]: 40: Hoare triple {28160#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28160#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:25,718 INFO L273 TraceCheckUtils]: 41: Hoare triple {28160#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28161#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:25,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {28161#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28161#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:25,719 INFO L273 TraceCheckUtils]: 43: Hoare triple {28161#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28162#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:25,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {28162#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28162#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:25,720 INFO L273 TraceCheckUtils]: 45: Hoare triple {28162#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28163#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:25,721 INFO L273 TraceCheckUtils]: 46: Hoare triple {28163#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28163#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:25,721 INFO L273 TraceCheckUtils]: 47: Hoare triple {28163#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28164#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:25,722 INFO L273 TraceCheckUtils]: 48: Hoare triple {28164#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28164#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:25,723 INFO L273 TraceCheckUtils]: 49: Hoare triple {28164#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28165#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:25,723 INFO L273 TraceCheckUtils]: 50: Hoare triple {28165#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28165#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:25,724 INFO L273 TraceCheckUtils]: 51: Hoare triple {28165#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28166#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:25,724 INFO L273 TraceCheckUtils]: 52: Hoare triple {28166#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28166#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:25,725 INFO L273 TraceCheckUtils]: 53: Hoare triple {28166#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28167#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:25,726 INFO L273 TraceCheckUtils]: 54: Hoare triple {28167#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28167#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:25,750 INFO L273 TraceCheckUtils]: 55: Hoare triple {28167#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28168#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:25,752 INFO L273 TraceCheckUtils]: 56: Hoare triple {28168#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28168#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:25,752 INFO L273 TraceCheckUtils]: 57: Hoare triple {28168#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28169#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:25,753 INFO L273 TraceCheckUtils]: 58: Hoare triple {28169#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28169#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:25,753 INFO L273 TraceCheckUtils]: 59: Hoare triple {28169#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28170#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:25,753 INFO L273 TraceCheckUtils]: 60: Hoare triple {28170#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28170#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:25,754 INFO L273 TraceCheckUtils]: 61: Hoare triple {28170#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28171#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:25,754 INFO L273 TraceCheckUtils]: 62: Hoare triple {28171#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28171#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:25,755 INFO L273 TraceCheckUtils]: 63: Hoare triple {28171#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28172#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:25,755 INFO L273 TraceCheckUtils]: 64: Hoare triple {28172#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28172#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:25,755 INFO L273 TraceCheckUtils]: 65: Hoare triple {28172#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28173#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:25,756 INFO L273 TraceCheckUtils]: 66: Hoare triple {28173#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28173#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:25,756 INFO L273 TraceCheckUtils]: 67: Hoare triple {28173#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28174#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:25,757 INFO L273 TraceCheckUtils]: 68: Hoare triple {28174#(<= main_~i~0 31)} assume !(~i~0 < 100000); {28142#false} is VALID [2018-11-23 12:11:25,757 INFO L273 TraceCheckUtils]: 69: Hoare triple {28142#false} ~i~0 := 0; {28142#false} is VALID [2018-11-23 12:11:25,757 INFO L273 TraceCheckUtils]: 70: Hoare triple {28142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28142#false} is VALID [2018-11-23 12:11:25,758 INFO L256 TraceCheckUtils]: 71: Hoare triple {28142#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {28142#false} is VALID [2018-11-23 12:11:25,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {28142#false} ~cond := #in~cond; {28142#false} is VALID [2018-11-23 12:11:25,758 INFO L273 TraceCheckUtils]: 73: Hoare triple {28142#false} assume 0 == ~cond; {28142#false} is VALID [2018-11-23 12:11:25,758 INFO L273 TraceCheckUtils]: 74: Hoare triple {28142#false} assume !false; {28142#false} is VALID [2018-11-23 12:11:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:25,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:25,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:25,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:25,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:26,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {28141#true} call ULTIMATE.init(); {28141#true} is VALID [2018-11-23 12:11:26,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {28141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28141#true} is VALID [2018-11-23 12:11:26,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {28141#true} assume true; {28141#true} is VALID [2018-11-23 12:11:26,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28141#true} {28141#true} #54#return; {28141#true} is VALID [2018-11-23 12:11:26,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {28141#true} call #t~ret3 := main(); {28141#true} is VALID [2018-11-23 12:11:26,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {28141#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {28193#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:26,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {28193#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28193#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:26,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {28193#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28144#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:26,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {28144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28144#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:26,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {28144#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28145#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:26,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {28145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28145#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:26,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {28145#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28146#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:26,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {28146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28146#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:26,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {28146#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28147#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:26,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {28147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28147#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:26,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {28147#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28148#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:26,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {28148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28148#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:26,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {28148#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28149#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:26,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {28149#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28149#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:26,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {28149#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28150#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:26,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {28150#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28150#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:26,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {28150#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28151#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:26,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {28151#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28151#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:26,084 INFO L273 TraceCheckUtils]: 23: Hoare triple {28151#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28152#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:26,084 INFO L273 TraceCheckUtils]: 24: Hoare triple {28152#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28152#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:26,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {28152#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28153#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:26,085 INFO L273 TraceCheckUtils]: 26: Hoare triple {28153#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28153#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:26,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {28153#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28154#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:26,086 INFO L273 TraceCheckUtils]: 28: Hoare triple {28154#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28154#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:26,086 INFO L273 TraceCheckUtils]: 29: Hoare triple {28154#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28155#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:26,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {28155#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28155#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:26,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {28155#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28156#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:26,088 INFO L273 TraceCheckUtils]: 32: Hoare triple {28156#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28156#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:26,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {28156#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28157#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:26,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {28157#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28157#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:26,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {28157#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28158#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:26,090 INFO L273 TraceCheckUtils]: 36: Hoare triple {28158#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28158#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:26,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {28158#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28159#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:26,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {28159#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28159#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:26,092 INFO L273 TraceCheckUtils]: 39: Hoare triple {28159#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28160#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:26,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {28160#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28160#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:26,093 INFO L273 TraceCheckUtils]: 41: Hoare triple {28160#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28161#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:26,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {28161#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28161#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:26,095 INFO L273 TraceCheckUtils]: 43: Hoare triple {28161#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28162#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:26,095 INFO L273 TraceCheckUtils]: 44: Hoare triple {28162#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28162#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:26,096 INFO L273 TraceCheckUtils]: 45: Hoare triple {28162#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28163#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:26,096 INFO L273 TraceCheckUtils]: 46: Hoare triple {28163#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28163#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:26,097 INFO L273 TraceCheckUtils]: 47: Hoare triple {28163#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28164#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:26,098 INFO L273 TraceCheckUtils]: 48: Hoare triple {28164#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28164#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:26,098 INFO L273 TraceCheckUtils]: 49: Hoare triple {28164#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28165#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:26,099 INFO L273 TraceCheckUtils]: 50: Hoare triple {28165#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28165#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:26,100 INFO L273 TraceCheckUtils]: 51: Hoare triple {28165#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28166#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:26,100 INFO L273 TraceCheckUtils]: 52: Hoare triple {28166#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28166#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:26,101 INFO L273 TraceCheckUtils]: 53: Hoare triple {28166#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28167#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:26,101 INFO L273 TraceCheckUtils]: 54: Hoare triple {28167#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28167#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:26,102 INFO L273 TraceCheckUtils]: 55: Hoare triple {28167#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28168#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:26,103 INFO L273 TraceCheckUtils]: 56: Hoare triple {28168#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28168#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:26,103 INFO L273 TraceCheckUtils]: 57: Hoare triple {28168#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28169#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:26,104 INFO L273 TraceCheckUtils]: 58: Hoare triple {28169#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28169#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:26,105 INFO L273 TraceCheckUtils]: 59: Hoare triple {28169#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28170#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:26,105 INFO L273 TraceCheckUtils]: 60: Hoare triple {28170#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28170#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:26,106 INFO L273 TraceCheckUtils]: 61: Hoare triple {28170#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28171#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:26,106 INFO L273 TraceCheckUtils]: 62: Hoare triple {28171#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28171#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:26,107 INFO L273 TraceCheckUtils]: 63: Hoare triple {28171#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28172#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:26,108 INFO L273 TraceCheckUtils]: 64: Hoare triple {28172#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28172#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:26,108 INFO L273 TraceCheckUtils]: 65: Hoare triple {28172#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28173#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:26,109 INFO L273 TraceCheckUtils]: 66: Hoare triple {28173#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28173#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:26,110 INFO L273 TraceCheckUtils]: 67: Hoare triple {28173#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28174#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:26,110 INFO L273 TraceCheckUtils]: 68: Hoare triple {28174#(<= main_~i~0 31)} assume !(~i~0 < 100000); {28142#false} is VALID [2018-11-23 12:11:26,110 INFO L273 TraceCheckUtils]: 69: Hoare triple {28142#false} ~i~0 := 0; {28142#false} is VALID [2018-11-23 12:11:26,111 INFO L273 TraceCheckUtils]: 70: Hoare triple {28142#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28142#false} is VALID [2018-11-23 12:11:26,111 INFO L256 TraceCheckUtils]: 71: Hoare triple {28142#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {28142#false} is VALID [2018-11-23 12:11:26,111 INFO L273 TraceCheckUtils]: 72: Hoare triple {28142#false} ~cond := #in~cond; {28142#false} is VALID [2018-11-23 12:11:26,111 INFO L273 TraceCheckUtils]: 73: Hoare triple {28142#false} assume 0 == ~cond; {28142#false} is VALID [2018-11-23 12:11:26,111 INFO L273 TraceCheckUtils]: 74: Hoare triple {28142#false} assume !false; {28142#false} is VALID [2018-11-23 12:11:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:26,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:26,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:11:26,136 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2018-11-23 12:11:26,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:26,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:11:26,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:26,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:11:26,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:11:26,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:11:26,208 INFO L87 Difference]: Start difference. First operand 235 states and 268 transitions. Second operand 35 states. [2018-11-23 12:11:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:28,147 INFO L93 Difference]: Finished difference Result 410 states and 478 transitions. [2018-11-23 12:11:28,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:11:28,147 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2018-11-23 12:11:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:11:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 293 transitions. [2018-11-23 12:11:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:11:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 293 transitions. [2018-11-23 12:11:28,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 293 transitions. [2018-11-23 12:11:28,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:28,435 INFO L225 Difference]: With dead ends: 410 [2018-11-23 12:11:28,435 INFO L226 Difference]: Without dead ends: 244 [2018-11-23 12:11:28,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:11:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-11-23 12:11:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2018-11-23 12:11:28,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:28,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand 242 states. [2018-11-23 12:11:28,638 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 242 states. [2018-11-23 12:11:28,638 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 242 states. [2018-11-23 12:11:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:28,645 INFO L93 Difference]: Finished difference Result 244 states and 278 transitions. [2018-11-23 12:11:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 278 transitions. [2018-11-23 12:11:28,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:28,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:28,646 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 244 states. [2018-11-23 12:11:28,647 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 244 states. [2018-11-23 12:11:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:28,653 INFO L93 Difference]: Finished difference Result 244 states and 278 transitions. [2018-11-23 12:11:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 278 transitions. [2018-11-23 12:11:28,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:28,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:28,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:28,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-23 12:11:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 276 transitions. [2018-11-23 12:11:28,660 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 276 transitions. Word has length 75 [2018-11-23 12:11:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:28,661 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 276 transitions. [2018-11-23 12:11:28,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:11:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 276 transitions. [2018-11-23 12:11:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:11:28,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:28,662 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:28,662 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:28,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1276544407, now seen corresponding path program 32 times [2018-11-23 12:11:28,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:28,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:28,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:28,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:28,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:29,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {29813#true} call ULTIMATE.init(); {29813#true} is VALID [2018-11-23 12:11:29,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {29813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29813#true} is VALID [2018-11-23 12:11:29,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {29813#true} assume true; {29813#true} is VALID [2018-11-23 12:11:29,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29813#true} {29813#true} #54#return; {29813#true} is VALID [2018-11-23 12:11:29,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {29813#true} call #t~ret3 := main(); {29813#true} is VALID [2018-11-23 12:11:29,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {29813#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {29815#(= main_~i~0 0)} is VALID [2018-11-23 12:11:29,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {29815#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29815#(= main_~i~0 0)} is VALID [2018-11-23 12:11:29,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {29815#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29816#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:29,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {29816#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29816#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:29,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {29816#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29817#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:29,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {29817#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29817#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:29,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {29817#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29818#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:29,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {29818#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29818#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:29,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {29818#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29819#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:29,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {29819#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29819#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:29,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {29819#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29820#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:29,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {29820#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29820#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:29,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {29820#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29821#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:29,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {29821#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29821#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:29,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {29821#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29822#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:29,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {29822#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29822#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:29,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {29822#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29823#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:29,458 INFO L273 TraceCheckUtils]: 22: Hoare triple {29823#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29823#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:29,458 INFO L273 TraceCheckUtils]: 23: Hoare triple {29823#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29824#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:29,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {29824#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29824#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:29,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {29824#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29825#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:29,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {29825#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29825#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:29,460 INFO L273 TraceCheckUtils]: 27: Hoare triple {29825#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29826#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:29,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {29826#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29826#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:29,460 INFO L273 TraceCheckUtils]: 29: Hoare triple {29826#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29827#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:29,461 INFO L273 TraceCheckUtils]: 30: Hoare triple {29827#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29827#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:29,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {29827#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29828#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:29,462 INFO L273 TraceCheckUtils]: 32: Hoare triple {29828#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29828#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:29,463 INFO L273 TraceCheckUtils]: 33: Hoare triple {29828#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29829#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:29,463 INFO L273 TraceCheckUtils]: 34: Hoare triple {29829#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29829#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:29,464 INFO L273 TraceCheckUtils]: 35: Hoare triple {29829#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29830#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:29,465 INFO L273 TraceCheckUtils]: 36: Hoare triple {29830#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29830#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:29,465 INFO L273 TraceCheckUtils]: 37: Hoare triple {29830#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29831#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:29,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {29831#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29831#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:29,467 INFO L273 TraceCheckUtils]: 39: Hoare triple {29831#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29832#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:29,467 INFO L273 TraceCheckUtils]: 40: Hoare triple {29832#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29832#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:29,468 INFO L273 TraceCheckUtils]: 41: Hoare triple {29832#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29833#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:29,468 INFO L273 TraceCheckUtils]: 42: Hoare triple {29833#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29833#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:29,469 INFO L273 TraceCheckUtils]: 43: Hoare triple {29833#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29834#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:29,470 INFO L273 TraceCheckUtils]: 44: Hoare triple {29834#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29834#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:29,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {29834#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29835#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:29,471 INFO L273 TraceCheckUtils]: 46: Hoare triple {29835#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29835#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:29,472 INFO L273 TraceCheckUtils]: 47: Hoare triple {29835#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29836#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:29,472 INFO L273 TraceCheckUtils]: 48: Hoare triple {29836#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29836#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:29,473 INFO L273 TraceCheckUtils]: 49: Hoare triple {29836#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29837#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:29,474 INFO L273 TraceCheckUtils]: 50: Hoare triple {29837#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29837#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:29,474 INFO L273 TraceCheckUtils]: 51: Hoare triple {29837#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29838#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:29,475 INFO L273 TraceCheckUtils]: 52: Hoare triple {29838#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29838#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:29,476 INFO L273 TraceCheckUtils]: 53: Hoare triple {29838#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29839#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:29,476 INFO L273 TraceCheckUtils]: 54: Hoare triple {29839#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29839#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:29,477 INFO L273 TraceCheckUtils]: 55: Hoare triple {29839#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29840#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:29,477 INFO L273 TraceCheckUtils]: 56: Hoare triple {29840#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29840#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:29,478 INFO L273 TraceCheckUtils]: 57: Hoare triple {29840#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29841#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:29,478 INFO L273 TraceCheckUtils]: 58: Hoare triple {29841#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29841#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:29,479 INFO L273 TraceCheckUtils]: 59: Hoare triple {29841#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29842#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:29,480 INFO L273 TraceCheckUtils]: 60: Hoare triple {29842#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29842#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:29,480 INFO L273 TraceCheckUtils]: 61: Hoare triple {29842#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29843#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:29,481 INFO L273 TraceCheckUtils]: 62: Hoare triple {29843#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29843#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:29,481 INFO L273 TraceCheckUtils]: 63: Hoare triple {29843#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29844#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:29,482 INFO L273 TraceCheckUtils]: 64: Hoare triple {29844#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29844#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:29,483 INFO L273 TraceCheckUtils]: 65: Hoare triple {29844#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29845#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:29,483 INFO L273 TraceCheckUtils]: 66: Hoare triple {29845#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29845#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:29,484 INFO L273 TraceCheckUtils]: 67: Hoare triple {29845#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29846#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:29,484 INFO L273 TraceCheckUtils]: 68: Hoare triple {29846#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29846#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:29,485 INFO L273 TraceCheckUtils]: 69: Hoare triple {29846#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29847#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:29,486 INFO L273 TraceCheckUtils]: 70: Hoare triple {29847#(<= main_~i~0 32)} assume !(~i~0 < 100000); {29814#false} is VALID [2018-11-23 12:11:29,486 INFO L273 TraceCheckUtils]: 71: Hoare triple {29814#false} ~i~0 := 0; {29814#false} is VALID [2018-11-23 12:11:29,486 INFO L273 TraceCheckUtils]: 72: Hoare triple {29814#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29814#false} is VALID [2018-11-23 12:11:29,486 INFO L256 TraceCheckUtils]: 73: Hoare triple {29814#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {29814#false} is VALID [2018-11-23 12:11:29,487 INFO L273 TraceCheckUtils]: 74: Hoare triple {29814#false} ~cond := #in~cond; {29814#false} is VALID [2018-11-23 12:11:29,487 INFO L273 TraceCheckUtils]: 75: Hoare triple {29814#false} assume 0 == ~cond; {29814#false} is VALID [2018-11-23 12:11:29,487 INFO L273 TraceCheckUtils]: 76: Hoare triple {29814#false} assume !false; {29814#false} is VALID [2018-11-23 12:11:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:29,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:29,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:29,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:11:29,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:11:29,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:29,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:29,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {29813#true} call ULTIMATE.init(); {29813#true} is VALID [2018-11-23 12:11:29,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {29813#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29813#true} is VALID [2018-11-23 12:11:29,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {29813#true} assume true; {29813#true} is VALID [2018-11-23 12:11:29,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29813#true} {29813#true} #54#return; {29813#true} is VALID [2018-11-23 12:11:29,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {29813#true} call #t~ret3 := main(); {29813#true} is VALID [2018-11-23 12:11:29,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {29813#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {29866#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:29,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {29866#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29866#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:29,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {29866#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29816#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:29,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {29816#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29816#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:29,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {29816#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29817#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:29,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {29817#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29817#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:29,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {29817#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29818#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:29,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {29818#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29818#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:29,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {29818#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29819#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:29,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {29819#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29819#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:29,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {29819#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29820#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:29,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {29820#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29820#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:29,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {29820#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29821#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:29,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {29821#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29821#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:29,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {29821#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29822#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:29,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {29822#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29822#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:29,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {29822#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29823#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:29,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {29823#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29823#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:29,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {29823#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29824#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:29,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {29824#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29824#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:29,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {29824#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29825#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:29,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {29825#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29825#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:29,762 INFO L273 TraceCheckUtils]: 27: Hoare triple {29825#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29826#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:29,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {29826#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29826#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:29,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {29826#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29827#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:29,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {29827#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29827#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:29,765 INFO L273 TraceCheckUtils]: 31: Hoare triple {29827#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29828#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:29,765 INFO L273 TraceCheckUtils]: 32: Hoare triple {29828#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29828#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:29,766 INFO L273 TraceCheckUtils]: 33: Hoare triple {29828#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29829#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:29,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {29829#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29829#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:29,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {29829#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29830#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:29,768 INFO L273 TraceCheckUtils]: 36: Hoare triple {29830#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29830#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:29,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {29830#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29831#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:29,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {29831#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29831#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:29,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {29831#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29832#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:29,770 INFO L273 TraceCheckUtils]: 40: Hoare triple {29832#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29832#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:29,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {29832#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29833#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:29,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {29833#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29833#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:29,772 INFO L273 TraceCheckUtils]: 43: Hoare triple {29833#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29834#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:29,773 INFO L273 TraceCheckUtils]: 44: Hoare triple {29834#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29834#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:29,773 INFO L273 TraceCheckUtils]: 45: Hoare triple {29834#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29835#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:29,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {29835#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29835#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:29,775 INFO L273 TraceCheckUtils]: 47: Hoare triple {29835#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29836#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:29,775 INFO L273 TraceCheckUtils]: 48: Hoare triple {29836#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29836#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:29,776 INFO L273 TraceCheckUtils]: 49: Hoare triple {29836#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29837#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:29,776 INFO L273 TraceCheckUtils]: 50: Hoare triple {29837#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29837#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:29,777 INFO L273 TraceCheckUtils]: 51: Hoare triple {29837#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29838#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:29,778 INFO L273 TraceCheckUtils]: 52: Hoare triple {29838#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29838#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:29,778 INFO L273 TraceCheckUtils]: 53: Hoare triple {29838#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29839#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:29,779 INFO L273 TraceCheckUtils]: 54: Hoare triple {29839#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29839#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:29,780 INFO L273 TraceCheckUtils]: 55: Hoare triple {29839#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29840#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:29,780 INFO L273 TraceCheckUtils]: 56: Hoare triple {29840#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29840#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:29,781 INFO L273 TraceCheckUtils]: 57: Hoare triple {29840#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29841#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:29,782 INFO L273 TraceCheckUtils]: 58: Hoare triple {29841#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29841#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:29,782 INFO L273 TraceCheckUtils]: 59: Hoare triple {29841#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29842#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:29,783 INFO L273 TraceCheckUtils]: 60: Hoare triple {29842#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29842#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:29,784 INFO L273 TraceCheckUtils]: 61: Hoare triple {29842#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29843#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:29,784 INFO L273 TraceCheckUtils]: 62: Hoare triple {29843#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29843#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:29,785 INFO L273 TraceCheckUtils]: 63: Hoare triple {29843#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29844#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:29,785 INFO L273 TraceCheckUtils]: 64: Hoare triple {29844#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29844#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:29,786 INFO L273 TraceCheckUtils]: 65: Hoare triple {29844#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29845#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:29,786 INFO L273 TraceCheckUtils]: 66: Hoare triple {29845#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29845#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:29,787 INFO L273 TraceCheckUtils]: 67: Hoare triple {29845#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29846#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:29,788 INFO L273 TraceCheckUtils]: 68: Hoare triple {29846#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29846#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:29,788 INFO L273 TraceCheckUtils]: 69: Hoare triple {29846#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29847#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:29,789 INFO L273 TraceCheckUtils]: 70: Hoare triple {29847#(<= main_~i~0 32)} assume !(~i~0 < 100000); {29814#false} is VALID [2018-11-23 12:11:29,789 INFO L273 TraceCheckUtils]: 71: Hoare triple {29814#false} ~i~0 := 0; {29814#false} is VALID [2018-11-23 12:11:29,789 INFO L273 TraceCheckUtils]: 72: Hoare triple {29814#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {29814#false} is VALID [2018-11-23 12:11:29,790 INFO L256 TraceCheckUtils]: 73: Hoare triple {29814#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {29814#false} is VALID [2018-11-23 12:11:29,790 INFO L273 TraceCheckUtils]: 74: Hoare triple {29814#false} ~cond := #in~cond; {29814#false} is VALID [2018-11-23 12:11:29,790 INFO L273 TraceCheckUtils]: 75: Hoare triple {29814#false} assume 0 == ~cond; {29814#false} is VALID [2018-11-23 12:11:29,790 INFO L273 TraceCheckUtils]: 76: Hoare triple {29814#false} assume !false; {29814#false} is VALID [2018-11-23 12:11:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:29,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:29,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:11:29,815 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2018-11-23 12:11:29,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:29,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:11:29,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:29,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:11:29,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:11:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:11:29,892 INFO L87 Difference]: Start difference. First operand 242 states and 276 transitions. Second operand 36 states. [2018-11-23 12:11:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:31,846 INFO L93 Difference]: Finished difference Result 422 states and 492 transitions. [2018-11-23 12:11:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:11:31,846 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2018-11-23 12:11:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:11:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 301 transitions. [2018-11-23 12:11:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:11:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 301 transitions. [2018-11-23 12:11:31,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 301 transitions. [2018-11-23 12:11:32,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:32,121 INFO L225 Difference]: With dead ends: 422 [2018-11-23 12:11:32,121 INFO L226 Difference]: Without dead ends: 251 [2018-11-23 12:11:32,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:11:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-23 12:11:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-11-23 12:11:32,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:32,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand 249 states. [2018-11-23 12:11:32,284 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand 249 states. [2018-11-23 12:11:32,284 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 249 states. [2018-11-23 12:11:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:32,290 INFO L93 Difference]: Finished difference Result 251 states and 286 transitions. [2018-11-23 12:11:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 286 transitions. [2018-11-23 12:11:32,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:32,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:32,291 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 251 states. [2018-11-23 12:11:32,291 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 251 states. [2018-11-23 12:11:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:32,296 INFO L93 Difference]: Finished difference Result 251 states and 286 transitions. [2018-11-23 12:11:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 286 transitions. [2018-11-23 12:11:32,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:32,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:32,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:32,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-23 12:11:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 284 transitions. [2018-11-23 12:11:32,302 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 284 transitions. Word has length 77 [2018-11-23 12:11:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:32,303 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 284 transitions. [2018-11-23 12:11:32,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:11:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 284 transitions. [2018-11-23 12:11:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:11:32,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:32,303 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:32,304 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:32,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1719283339, now seen corresponding path program 33 times [2018-11-23 12:11:32,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:32,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:32,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:32,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:32,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:32,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {31533#true} call ULTIMATE.init(); {31533#true} is VALID [2018-11-23 12:11:32,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {31533#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31533#true} is VALID [2018-11-23 12:11:32,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {31533#true} assume true; {31533#true} is VALID [2018-11-23 12:11:32,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31533#true} {31533#true} #54#return; {31533#true} is VALID [2018-11-23 12:11:32,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {31533#true} call #t~ret3 := main(); {31533#true} is VALID [2018-11-23 12:11:32,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {31533#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {31535#(= main_~i~0 0)} is VALID [2018-11-23 12:11:32,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {31535#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31535#(= main_~i~0 0)} is VALID [2018-11-23 12:11:32,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {31535#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31536#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:32,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {31536#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31536#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:32,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {31536#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31537#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:32,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {31537#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31537#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:32,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {31537#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31538#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:32,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {31538#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31538#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:32,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {31538#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31539#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:32,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {31539#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31539#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:32,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {31539#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31540#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:32,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {31540#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31540#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:32,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {31540#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31541#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:32,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {31541#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31541#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:32,969 INFO L273 TraceCheckUtils]: 19: Hoare triple {31541#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31542#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:32,970 INFO L273 TraceCheckUtils]: 20: Hoare triple {31542#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31542#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:32,970 INFO L273 TraceCheckUtils]: 21: Hoare triple {31542#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31543#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:32,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {31543#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31543#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:32,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {31543#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31544#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:32,972 INFO L273 TraceCheckUtils]: 24: Hoare triple {31544#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31544#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:32,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {31544#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31545#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:32,973 INFO L273 TraceCheckUtils]: 26: Hoare triple {31545#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31545#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:32,974 INFO L273 TraceCheckUtils]: 27: Hoare triple {31545#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31546#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:32,975 INFO L273 TraceCheckUtils]: 28: Hoare triple {31546#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31546#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:32,975 INFO L273 TraceCheckUtils]: 29: Hoare triple {31546#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31547#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:32,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {31547#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31547#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:32,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {31547#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31548#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:32,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {31548#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31548#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:32,978 INFO L273 TraceCheckUtils]: 33: Hoare triple {31548#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31549#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:32,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {31549#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31549#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:32,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {31549#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31550#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:32,980 INFO L273 TraceCheckUtils]: 36: Hoare triple {31550#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31550#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:32,981 INFO L273 TraceCheckUtils]: 37: Hoare triple {31550#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31551#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:32,981 INFO L273 TraceCheckUtils]: 38: Hoare triple {31551#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31551#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:32,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {31551#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31552#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:32,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {31552#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31552#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:32,983 INFO L273 TraceCheckUtils]: 41: Hoare triple {31552#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31553#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:32,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {31553#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31553#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:32,984 INFO L273 TraceCheckUtils]: 43: Hoare triple {31553#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31554#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:32,985 INFO L273 TraceCheckUtils]: 44: Hoare triple {31554#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31554#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:32,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {31554#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31555#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:32,986 INFO L273 TraceCheckUtils]: 46: Hoare triple {31555#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31555#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:32,987 INFO L273 TraceCheckUtils]: 47: Hoare triple {31555#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31556#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:32,987 INFO L273 TraceCheckUtils]: 48: Hoare triple {31556#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31556#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:32,988 INFO L273 TraceCheckUtils]: 49: Hoare triple {31556#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31557#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:32,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {31557#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31557#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:32,989 INFO L273 TraceCheckUtils]: 51: Hoare triple {31557#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31558#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:32,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {31558#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31558#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:32,991 INFO L273 TraceCheckUtils]: 53: Hoare triple {31558#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31559#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:32,991 INFO L273 TraceCheckUtils]: 54: Hoare triple {31559#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31559#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:32,992 INFO L273 TraceCheckUtils]: 55: Hoare triple {31559#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31560#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:32,992 INFO L273 TraceCheckUtils]: 56: Hoare triple {31560#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31560#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:32,993 INFO L273 TraceCheckUtils]: 57: Hoare triple {31560#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31561#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:32,994 INFO L273 TraceCheckUtils]: 58: Hoare triple {31561#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31561#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:32,994 INFO L273 TraceCheckUtils]: 59: Hoare triple {31561#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31562#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:32,995 INFO L273 TraceCheckUtils]: 60: Hoare triple {31562#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31562#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:32,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {31562#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31563#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:32,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {31563#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31563#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:32,997 INFO L273 TraceCheckUtils]: 63: Hoare triple {31563#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31564#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:32,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {31564#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31564#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:32,998 INFO L273 TraceCheckUtils]: 65: Hoare triple {31564#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31565#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:32,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {31565#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31565#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:32,999 INFO L273 TraceCheckUtils]: 67: Hoare triple {31565#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31566#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:33,000 INFO L273 TraceCheckUtils]: 68: Hoare triple {31566#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31566#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:33,001 INFO L273 TraceCheckUtils]: 69: Hoare triple {31566#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31567#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:33,001 INFO L273 TraceCheckUtils]: 70: Hoare triple {31567#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31567#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:33,021 INFO L273 TraceCheckUtils]: 71: Hoare triple {31567#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31568#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:33,035 INFO L273 TraceCheckUtils]: 72: Hoare triple {31568#(<= main_~i~0 33)} assume !(~i~0 < 100000); {31534#false} is VALID [2018-11-23 12:11:33,035 INFO L273 TraceCheckUtils]: 73: Hoare triple {31534#false} ~i~0 := 0; {31534#false} is VALID [2018-11-23 12:11:33,035 INFO L273 TraceCheckUtils]: 74: Hoare triple {31534#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31534#false} is VALID [2018-11-23 12:11:33,036 INFO L256 TraceCheckUtils]: 75: Hoare triple {31534#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {31534#false} is VALID [2018-11-23 12:11:33,036 INFO L273 TraceCheckUtils]: 76: Hoare triple {31534#false} ~cond := #in~cond; {31534#false} is VALID [2018-11-23 12:11:33,036 INFO L273 TraceCheckUtils]: 77: Hoare triple {31534#false} assume 0 == ~cond; {31534#false} is VALID [2018-11-23 12:11:33,036 INFO L273 TraceCheckUtils]: 78: Hoare triple {31534#false} assume !false; {31534#false} is VALID [2018-11-23 12:11:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:33,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:33,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:33,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:11:36,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 12:11:36,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:37,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:37,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {31533#true} call ULTIMATE.init(); {31533#true} is VALID [2018-11-23 12:11:37,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {31533#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31533#true} is VALID [2018-11-23 12:11:37,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {31533#true} assume true; {31533#true} is VALID [2018-11-23 12:11:37,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31533#true} {31533#true} #54#return; {31533#true} is VALID [2018-11-23 12:11:37,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {31533#true} call #t~ret3 := main(); {31533#true} is VALID [2018-11-23 12:11:37,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {31533#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {31587#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:37,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {31587#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31587#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:37,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {31587#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31536#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:37,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {31536#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31536#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:37,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {31536#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31537#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:37,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {31537#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31537#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:37,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {31537#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31538#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:37,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {31538#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31538#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:37,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {31538#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31539#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:37,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {31539#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31539#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:37,226 INFO L273 TraceCheckUtils]: 15: Hoare triple {31539#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31540#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:37,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {31540#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31540#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:37,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {31540#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31541#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:37,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {31541#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31541#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:37,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {31541#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31542#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:37,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {31542#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31542#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:37,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {31542#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31543#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:37,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {31543#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31543#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:37,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {31543#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31544#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:37,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {31544#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31544#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:37,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {31544#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31545#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:37,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {31545#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31545#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:37,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {31545#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31546#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:37,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {31546#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31546#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:37,234 INFO L273 TraceCheckUtils]: 29: Hoare triple {31546#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31547#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:37,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {31547#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31547#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:37,236 INFO L273 TraceCheckUtils]: 31: Hoare triple {31547#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31548#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:37,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {31548#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31548#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:37,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {31548#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31549#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:37,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {31549#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31549#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:37,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {31549#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31550#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:37,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {31550#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31550#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:37,239 INFO L273 TraceCheckUtils]: 37: Hoare triple {31550#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31551#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:37,240 INFO L273 TraceCheckUtils]: 38: Hoare triple {31551#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31551#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:37,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {31551#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31552#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:37,241 INFO L273 TraceCheckUtils]: 40: Hoare triple {31552#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31552#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:37,242 INFO L273 TraceCheckUtils]: 41: Hoare triple {31552#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31553#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:37,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {31553#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31553#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:37,243 INFO L273 TraceCheckUtils]: 43: Hoare triple {31553#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31554#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:37,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {31554#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31554#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:37,244 INFO L273 TraceCheckUtils]: 45: Hoare triple {31554#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31555#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:37,244 INFO L273 TraceCheckUtils]: 46: Hoare triple {31555#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31555#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:37,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {31555#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31556#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:37,246 INFO L273 TraceCheckUtils]: 48: Hoare triple {31556#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31556#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:37,246 INFO L273 TraceCheckUtils]: 49: Hoare triple {31556#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31557#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:37,247 INFO L273 TraceCheckUtils]: 50: Hoare triple {31557#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31557#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:37,247 INFO L273 TraceCheckUtils]: 51: Hoare triple {31557#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31558#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:37,248 INFO L273 TraceCheckUtils]: 52: Hoare triple {31558#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31558#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:37,249 INFO L273 TraceCheckUtils]: 53: Hoare triple {31558#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31559#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:37,249 INFO L273 TraceCheckUtils]: 54: Hoare triple {31559#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31559#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:37,250 INFO L273 TraceCheckUtils]: 55: Hoare triple {31559#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31560#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:37,250 INFO L273 TraceCheckUtils]: 56: Hoare triple {31560#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31560#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:37,251 INFO L273 TraceCheckUtils]: 57: Hoare triple {31560#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31561#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:37,252 INFO L273 TraceCheckUtils]: 58: Hoare triple {31561#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31561#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:37,252 INFO L273 TraceCheckUtils]: 59: Hoare triple {31561#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31562#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:37,253 INFO L273 TraceCheckUtils]: 60: Hoare triple {31562#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31562#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:37,253 INFO L273 TraceCheckUtils]: 61: Hoare triple {31562#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31563#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:37,254 INFO L273 TraceCheckUtils]: 62: Hoare triple {31563#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31563#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:37,255 INFO L273 TraceCheckUtils]: 63: Hoare triple {31563#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31564#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:37,255 INFO L273 TraceCheckUtils]: 64: Hoare triple {31564#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31564#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:37,256 INFO L273 TraceCheckUtils]: 65: Hoare triple {31564#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31565#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:37,256 INFO L273 TraceCheckUtils]: 66: Hoare triple {31565#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31565#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:37,257 INFO L273 TraceCheckUtils]: 67: Hoare triple {31565#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31566#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:37,257 INFO L273 TraceCheckUtils]: 68: Hoare triple {31566#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31566#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:37,258 INFO L273 TraceCheckUtils]: 69: Hoare triple {31566#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31567#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:37,259 INFO L273 TraceCheckUtils]: 70: Hoare triple {31567#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31567#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:37,259 INFO L273 TraceCheckUtils]: 71: Hoare triple {31567#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31568#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:37,260 INFO L273 TraceCheckUtils]: 72: Hoare triple {31568#(<= main_~i~0 33)} assume !(~i~0 < 100000); {31534#false} is VALID [2018-11-23 12:11:37,260 INFO L273 TraceCheckUtils]: 73: Hoare triple {31534#false} ~i~0 := 0; {31534#false} is VALID [2018-11-23 12:11:37,260 INFO L273 TraceCheckUtils]: 74: Hoare triple {31534#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31534#false} is VALID [2018-11-23 12:11:37,261 INFO L256 TraceCheckUtils]: 75: Hoare triple {31534#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {31534#false} is VALID [2018-11-23 12:11:37,261 INFO L273 TraceCheckUtils]: 76: Hoare triple {31534#false} ~cond := #in~cond; {31534#false} is VALID [2018-11-23 12:11:37,261 INFO L273 TraceCheckUtils]: 77: Hoare triple {31534#false} assume 0 == ~cond; {31534#false} is VALID [2018-11-23 12:11:37,261 INFO L273 TraceCheckUtils]: 78: Hoare triple {31534#false} assume !false; {31534#false} is VALID [2018-11-23 12:11:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:37,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:37,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:11:37,290 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 79 [2018-11-23 12:11:37,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:37,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:11:37,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:37,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:11:37,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:11:37,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:11:37,399 INFO L87 Difference]: Start difference. First operand 249 states and 284 transitions. Second operand 37 states. [2018-11-23 12:11:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:39,256 INFO L93 Difference]: Finished difference Result 434 states and 506 transitions. [2018-11-23 12:11:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:11:39,256 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 79 [2018-11-23 12:11:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:11:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 309 transitions. [2018-11-23 12:11:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:11:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 309 transitions. [2018-11-23 12:11:39,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 309 transitions. [2018-11-23 12:11:39,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:39,608 INFO L225 Difference]: With dead ends: 434 [2018-11-23 12:11:39,608 INFO L226 Difference]: Without dead ends: 258 [2018-11-23 12:11:39,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:11:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-23 12:11:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-23 12:11:39,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:39,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2018-11-23 12:11:39,727 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2018-11-23 12:11:39,727 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2018-11-23 12:11:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:39,733 INFO L93 Difference]: Finished difference Result 258 states and 294 transitions. [2018-11-23 12:11:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 294 transitions. [2018-11-23 12:11:39,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:39,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:39,733 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2018-11-23 12:11:39,733 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2018-11-23 12:11:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:39,739 INFO L93 Difference]: Finished difference Result 258 states and 294 transitions. [2018-11-23 12:11:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 294 transitions. [2018-11-23 12:11:39,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:39,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:39,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:39,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 12:11:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 292 transitions. [2018-11-23 12:11:39,744 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 292 transitions. Word has length 79 [2018-11-23 12:11:39,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:39,745 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 292 transitions. [2018-11-23 12:11:39,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:11:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 292 transitions. [2018-11-23 12:11:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 12:11:39,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:39,746 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:39,746 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:39,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:39,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1213308371, now seen corresponding path program 34 times [2018-11-23 12:11:39,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:39,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:39,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:39,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:39,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:40,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {33301#true} call ULTIMATE.init(); {33301#true} is VALID [2018-11-23 12:11:40,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {33301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33301#true} is VALID [2018-11-23 12:11:40,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {33301#true} assume true; {33301#true} is VALID [2018-11-23 12:11:40,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33301#true} {33301#true} #54#return; {33301#true} is VALID [2018-11-23 12:11:40,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {33301#true} call #t~ret3 := main(); {33301#true} is VALID [2018-11-23 12:11:40,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {33301#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {33303#(= main_~i~0 0)} is VALID [2018-11-23 12:11:40,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {33303#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33303#(= main_~i~0 0)} is VALID [2018-11-23 12:11:40,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {33303#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33304#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:40,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {33304#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33304#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:40,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {33304#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33305#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:40,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {33305#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33305#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:40,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {33305#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33306#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:40,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {33306#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33306#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:40,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {33306#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33307#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:40,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {33307#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33307#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:40,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {33307#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33308#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:40,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {33308#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33308#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:40,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {33308#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33309#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:40,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {33309#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33309#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:40,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {33309#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33310#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:40,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {33310#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33310#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:40,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {33310#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33311#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:40,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {33311#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33311#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:40,441 INFO L273 TraceCheckUtils]: 23: Hoare triple {33311#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33312#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:40,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {33312#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33312#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:40,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {33312#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33313#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:40,443 INFO L273 TraceCheckUtils]: 26: Hoare triple {33313#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33313#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:40,444 INFO L273 TraceCheckUtils]: 27: Hoare triple {33313#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33314#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:40,444 INFO L273 TraceCheckUtils]: 28: Hoare triple {33314#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33314#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:40,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {33314#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33315#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:40,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {33315#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33315#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:40,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {33315#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33316#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:40,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {33316#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33316#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:40,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {33316#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33317#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:40,448 INFO L273 TraceCheckUtils]: 34: Hoare triple {33317#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33317#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:40,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {33317#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33318#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:40,449 INFO L273 TraceCheckUtils]: 36: Hoare triple {33318#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33318#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:40,450 INFO L273 TraceCheckUtils]: 37: Hoare triple {33318#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33319#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:40,451 INFO L273 TraceCheckUtils]: 38: Hoare triple {33319#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33319#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:40,451 INFO L273 TraceCheckUtils]: 39: Hoare triple {33319#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33320#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:40,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {33320#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33320#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:40,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {33320#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33321#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:40,453 INFO L273 TraceCheckUtils]: 42: Hoare triple {33321#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33321#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:40,454 INFO L273 TraceCheckUtils]: 43: Hoare triple {33321#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33322#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:40,455 INFO L273 TraceCheckUtils]: 44: Hoare triple {33322#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33322#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:40,455 INFO L273 TraceCheckUtils]: 45: Hoare triple {33322#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33323#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:40,456 INFO L273 TraceCheckUtils]: 46: Hoare triple {33323#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33323#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:40,457 INFO L273 TraceCheckUtils]: 47: Hoare triple {33323#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33324#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:40,457 INFO L273 TraceCheckUtils]: 48: Hoare triple {33324#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33324#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:40,458 INFO L273 TraceCheckUtils]: 49: Hoare triple {33324#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33325#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:40,458 INFO L273 TraceCheckUtils]: 50: Hoare triple {33325#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33325#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:40,459 INFO L273 TraceCheckUtils]: 51: Hoare triple {33325#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33326#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:40,460 INFO L273 TraceCheckUtils]: 52: Hoare triple {33326#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33326#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:40,460 INFO L273 TraceCheckUtils]: 53: Hoare triple {33326#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33327#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:40,461 INFO L273 TraceCheckUtils]: 54: Hoare triple {33327#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33327#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:40,462 INFO L273 TraceCheckUtils]: 55: Hoare triple {33327#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33328#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:40,462 INFO L273 TraceCheckUtils]: 56: Hoare triple {33328#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33328#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:40,463 INFO L273 TraceCheckUtils]: 57: Hoare triple {33328#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33329#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:40,464 INFO L273 TraceCheckUtils]: 58: Hoare triple {33329#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33329#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:40,464 INFO L273 TraceCheckUtils]: 59: Hoare triple {33329#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33330#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:40,465 INFO L273 TraceCheckUtils]: 60: Hoare triple {33330#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33330#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:40,466 INFO L273 TraceCheckUtils]: 61: Hoare triple {33330#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33331#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:40,466 INFO L273 TraceCheckUtils]: 62: Hoare triple {33331#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33331#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:40,467 INFO L273 TraceCheckUtils]: 63: Hoare triple {33331#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33332#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:40,467 INFO L273 TraceCheckUtils]: 64: Hoare triple {33332#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33332#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:40,468 INFO L273 TraceCheckUtils]: 65: Hoare triple {33332#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33333#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:40,469 INFO L273 TraceCheckUtils]: 66: Hoare triple {33333#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33333#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:40,469 INFO L273 TraceCheckUtils]: 67: Hoare triple {33333#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33334#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:40,470 INFO L273 TraceCheckUtils]: 68: Hoare triple {33334#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33334#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:40,471 INFO L273 TraceCheckUtils]: 69: Hoare triple {33334#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33335#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:40,471 INFO L273 TraceCheckUtils]: 70: Hoare triple {33335#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33335#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:40,472 INFO L273 TraceCheckUtils]: 71: Hoare triple {33335#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33336#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:40,474 INFO L273 TraceCheckUtils]: 72: Hoare triple {33336#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33336#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:40,475 INFO L273 TraceCheckUtils]: 73: Hoare triple {33336#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33337#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:40,476 INFO L273 TraceCheckUtils]: 74: Hoare triple {33337#(<= main_~i~0 34)} assume !(~i~0 < 100000); {33302#false} is VALID [2018-11-23 12:11:40,476 INFO L273 TraceCheckUtils]: 75: Hoare triple {33302#false} ~i~0 := 0; {33302#false} is VALID [2018-11-23 12:11:40,476 INFO L273 TraceCheckUtils]: 76: Hoare triple {33302#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33302#false} is VALID [2018-11-23 12:11:40,476 INFO L256 TraceCheckUtils]: 77: Hoare triple {33302#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {33302#false} is VALID [2018-11-23 12:11:40,476 INFO L273 TraceCheckUtils]: 78: Hoare triple {33302#false} ~cond := #in~cond; {33302#false} is VALID [2018-11-23 12:11:40,476 INFO L273 TraceCheckUtils]: 79: Hoare triple {33302#false} assume 0 == ~cond; {33302#false} is VALID [2018-11-23 12:11:40,476 INFO L273 TraceCheckUtils]: 80: Hoare triple {33302#false} assume !false; {33302#false} is VALID [2018-11-23 12:11:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:40,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:40,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:40,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:11:40,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:11:40,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:40,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:40,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {33301#true} call ULTIMATE.init(); {33301#true} is VALID [2018-11-23 12:11:40,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {33301#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33301#true} is VALID [2018-11-23 12:11:40,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {33301#true} assume true; {33301#true} is VALID [2018-11-23 12:11:40,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33301#true} {33301#true} #54#return; {33301#true} is VALID [2018-11-23 12:11:40,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {33301#true} call #t~ret3 := main(); {33301#true} is VALID [2018-11-23 12:11:40,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {33301#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {33356#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:40,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {33356#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33356#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:40,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {33356#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33304#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:40,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {33304#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33304#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:40,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {33304#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33305#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:40,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {33305#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33305#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:40,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {33305#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33306#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:40,940 INFO L273 TraceCheckUtils]: 12: Hoare triple {33306#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33306#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:40,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {33306#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33307#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:40,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {33307#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33307#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:40,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {33307#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33308#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:40,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {33308#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33308#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:40,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {33308#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33309#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:40,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {33309#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33309#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:40,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {33309#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33310#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:40,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {33310#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33310#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:40,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {33310#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33311#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:40,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {33311#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33311#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:40,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {33311#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33312#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:40,948 INFO L273 TraceCheckUtils]: 24: Hoare triple {33312#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33312#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:40,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {33312#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33313#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:40,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {33313#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33313#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:40,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {33313#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33314#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:40,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {33314#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33314#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:40,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {33314#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33315#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:40,951 INFO L273 TraceCheckUtils]: 30: Hoare triple {33315#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33315#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:40,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {33315#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33316#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:40,952 INFO L273 TraceCheckUtils]: 32: Hoare triple {33316#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33316#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:40,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {33316#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33317#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:40,953 INFO L273 TraceCheckUtils]: 34: Hoare triple {33317#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33317#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:40,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {33317#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33318#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:40,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {33318#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33318#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:40,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {33318#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33319#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:40,956 INFO L273 TraceCheckUtils]: 38: Hoare triple {33319#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33319#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:40,956 INFO L273 TraceCheckUtils]: 39: Hoare triple {33319#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33320#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:40,957 INFO L273 TraceCheckUtils]: 40: Hoare triple {33320#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33320#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:40,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {33320#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33321#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:40,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {33321#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33321#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:40,959 INFO L273 TraceCheckUtils]: 43: Hoare triple {33321#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33322#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:40,959 INFO L273 TraceCheckUtils]: 44: Hoare triple {33322#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33322#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:40,960 INFO L273 TraceCheckUtils]: 45: Hoare triple {33322#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33323#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:40,961 INFO L273 TraceCheckUtils]: 46: Hoare triple {33323#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33323#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:40,961 INFO L273 TraceCheckUtils]: 47: Hoare triple {33323#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33324#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:40,962 INFO L273 TraceCheckUtils]: 48: Hoare triple {33324#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33324#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:40,962 INFO L273 TraceCheckUtils]: 49: Hoare triple {33324#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33325#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:40,963 INFO L273 TraceCheckUtils]: 50: Hoare triple {33325#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33325#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:40,964 INFO L273 TraceCheckUtils]: 51: Hoare triple {33325#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33326#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:40,964 INFO L273 TraceCheckUtils]: 52: Hoare triple {33326#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33326#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:40,965 INFO L273 TraceCheckUtils]: 53: Hoare triple {33326#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33327#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:40,965 INFO L273 TraceCheckUtils]: 54: Hoare triple {33327#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33327#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:40,966 INFO L273 TraceCheckUtils]: 55: Hoare triple {33327#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33328#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:40,966 INFO L273 TraceCheckUtils]: 56: Hoare triple {33328#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33328#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:40,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {33328#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33329#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:40,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {33329#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33329#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:40,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {33329#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33330#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:40,969 INFO L273 TraceCheckUtils]: 60: Hoare triple {33330#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33330#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:40,970 INFO L273 TraceCheckUtils]: 61: Hoare triple {33330#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33331#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:40,970 INFO L273 TraceCheckUtils]: 62: Hoare triple {33331#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33331#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:40,971 INFO L273 TraceCheckUtils]: 63: Hoare triple {33331#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33332#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:40,971 INFO L273 TraceCheckUtils]: 64: Hoare triple {33332#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33332#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:40,972 INFO L273 TraceCheckUtils]: 65: Hoare triple {33332#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33333#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:40,991 INFO L273 TraceCheckUtils]: 66: Hoare triple {33333#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33333#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:41,004 INFO L273 TraceCheckUtils]: 67: Hoare triple {33333#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33334#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:41,017 INFO L273 TraceCheckUtils]: 68: Hoare triple {33334#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33334#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:41,026 INFO L273 TraceCheckUtils]: 69: Hoare triple {33334#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33335#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:41,041 INFO L273 TraceCheckUtils]: 70: Hoare triple {33335#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33335#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:41,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {33335#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33336#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:41,063 INFO L273 TraceCheckUtils]: 72: Hoare triple {33336#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33336#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:41,071 INFO L273 TraceCheckUtils]: 73: Hoare triple {33336#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33337#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:41,087 INFO L273 TraceCheckUtils]: 74: Hoare triple {33337#(<= main_~i~0 34)} assume !(~i~0 < 100000); {33302#false} is VALID [2018-11-23 12:11:41,087 INFO L273 TraceCheckUtils]: 75: Hoare triple {33302#false} ~i~0 := 0; {33302#false} is VALID [2018-11-23 12:11:41,087 INFO L273 TraceCheckUtils]: 76: Hoare triple {33302#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33302#false} is VALID [2018-11-23 12:11:41,087 INFO L256 TraceCheckUtils]: 77: Hoare triple {33302#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {33302#false} is VALID [2018-11-23 12:11:41,088 INFO L273 TraceCheckUtils]: 78: Hoare triple {33302#false} ~cond := #in~cond; {33302#false} is VALID [2018-11-23 12:11:41,088 INFO L273 TraceCheckUtils]: 79: Hoare triple {33302#false} assume 0 == ~cond; {33302#false} is VALID [2018-11-23 12:11:41,088 INFO L273 TraceCheckUtils]: 80: Hoare triple {33302#false} assume !false; {33302#false} is VALID [2018-11-23 12:11:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:41,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:41,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 12:11:41,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 81 [2018-11-23 12:11:41,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:41,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:11:41,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:41,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:11:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:11:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:11:41,320 INFO L87 Difference]: Start difference. First operand 256 states and 292 transitions. Second operand 38 states. [2018-11-23 12:11:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:44,227 INFO L93 Difference]: Finished difference Result 446 states and 520 transitions. [2018-11-23 12:11:44,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:11:44,227 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 81 [2018-11-23 12:11:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:11:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 317 transitions. [2018-11-23 12:11:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:11:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 317 transitions. [2018-11-23 12:11:44,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 317 transitions. [2018-11-23 12:11:44,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:44,542 INFO L225 Difference]: With dead ends: 446 [2018-11-23 12:11:44,542 INFO L226 Difference]: Without dead ends: 265 [2018-11-23 12:11:44,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:11:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-23 12:11:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2018-11-23 12:11:45,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:45,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand 263 states. [2018-11-23 12:11:45,016 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand 263 states. [2018-11-23 12:11:45,016 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 263 states. [2018-11-23 12:11:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:45,022 INFO L93 Difference]: Finished difference Result 265 states and 302 transitions. [2018-11-23 12:11:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 302 transitions. [2018-11-23 12:11:45,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:45,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:45,023 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand 265 states. [2018-11-23 12:11:45,023 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 265 states. [2018-11-23 12:11:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:45,029 INFO L93 Difference]: Finished difference Result 265 states and 302 transitions. [2018-11-23 12:11:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 302 transitions. [2018-11-23 12:11:45,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:45,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:45,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:45,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-23 12:11:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 300 transitions. [2018-11-23 12:11:45,035 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 300 transitions. Word has length 81 [2018-11-23 12:11:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:45,035 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 300 transitions. [2018-11-23 12:11:45,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:11:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 300 transitions. [2018-11-23 12:11:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:11:45,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:45,036 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:45,036 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:45,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:45,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1935395505, now seen corresponding path program 35 times [2018-11-23 12:11:45,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:45,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:45,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:45,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:45,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:46,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {35117#true} call ULTIMATE.init(); {35117#true} is VALID [2018-11-23 12:11:46,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {35117#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35117#true} is VALID [2018-11-23 12:11:46,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {35117#true} assume true; {35117#true} is VALID [2018-11-23 12:11:46,010 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35117#true} {35117#true} #54#return; {35117#true} is VALID [2018-11-23 12:11:46,010 INFO L256 TraceCheckUtils]: 4: Hoare triple {35117#true} call #t~ret3 := main(); {35117#true} is VALID [2018-11-23 12:11:46,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {35117#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {35119#(= main_~i~0 0)} is VALID [2018-11-23 12:11:46,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {35119#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35119#(= main_~i~0 0)} is VALID [2018-11-23 12:11:46,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {35119#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35120#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:46,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {35120#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35120#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:46,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {35120#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35121#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:46,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {35121#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35121#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:46,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {35121#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35122#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:46,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {35122#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35122#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:46,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {35122#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35123#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:46,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {35123#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35123#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:46,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {35123#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35124#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:46,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {35124#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35124#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:46,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {35124#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35125#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:46,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {35125#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35125#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:46,020 INFO L273 TraceCheckUtils]: 19: Hoare triple {35125#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35126#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:46,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {35126#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35126#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:46,021 INFO L273 TraceCheckUtils]: 21: Hoare triple {35126#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35127#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:46,021 INFO L273 TraceCheckUtils]: 22: Hoare triple {35127#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35127#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:46,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {35127#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35128#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:46,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {35128#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35128#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:46,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {35128#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35129#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:46,024 INFO L273 TraceCheckUtils]: 26: Hoare triple {35129#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35129#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:46,025 INFO L273 TraceCheckUtils]: 27: Hoare triple {35129#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35130#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:46,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {35130#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35130#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:46,026 INFO L273 TraceCheckUtils]: 29: Hoare triple {35130#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35131#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:46,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {35131#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35131#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:46,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {35131#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35132#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:46,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {35132#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35132#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:46,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {35132#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35133#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:46,029 INFO L273 TraceCheckUtils]: 34: Hoare triple {35133#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35133#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:46,030 INFO L273 TraceCheckUtils]: 35: Hoare triple {35133#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35134#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:46,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {35134#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35134#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:46,031 INFO L273 TraceCheckUtils]: 37: Hoare triple {35134#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35135#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:46,031 INFO L273 TraceCheckUtils]: 38: Hoare triple {35135#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35135#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:46,032 INFO L273 TraceCheckUtils]: 39: Hoare triple {35135#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35136#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:46,033 INFO L273 TraceCheckUtils]: 40: Hoare triple {35136#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35136#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:46,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {35136#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35137#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:46,034 INFO L273 TraceCheckUtils]: 42: Hoare triple {35137#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35137#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:46,035 INFO L273 TraceCheckUtils]: 43: Hoare triple {35137#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35138#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:46,035 INFO L273 TraceCheckUtils]: 44: Hoare triple {35138#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35138#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:46,036 INFO L273 TraceCheckUtils]: 45: Hoare triple {35138#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35139#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:46,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {35139#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35139#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:46,037 INFO L273 TraceCheckUtils]: 47: Hoare triple {35139#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35140#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:46,038 INFO L273 TraceCheckUtils]: 48: Hoare triple {35140#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35140#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:46,038 INFO L273 TraceCheckUtils]: 49: Hoare triple {35140#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35141#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:46,039 INFO L273 TraceCheckUtils]: 50: Hoare triple {35141#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35141#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:46,040 INFO L273 TraceCheckUtils]: 51: Hoare triple {35141#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35142#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:46,040 INFO L273 TraceCheckUtils]: 52: Hoare triple {35142#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35142#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:46,041 INFO L273 TraceCheckUtils]: 53: Hoare triple {35142#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35143#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:46,041 INFO L273 TraceCheckUtils]: 54: Hoare triple {35143#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35143#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:46,042 INFO L273 TraceCheckUtils]: 55: Hoare triple {35143#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35144#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:46,043 INFO L273 TraceCheckUtils]: 56: Hoare triple {35144#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35144#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:46,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {35144#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35145#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:46,044 INFO L273 TraceCheckUtils]: 58: Hoare triple {35145#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35145#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:46,045 INFO L273 TraceCheckUtils]: 59: Hoare triple {35145#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35146#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:46,045 INFO L273 TraceCheckUtils]: 60: Hoare triple {35146#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35146#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:46,046 INFO L273 TraceCheckUtils]: 61: Hoare triple {35146#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35147#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:46,046 INFO L273 TraceCheckUtils]: 62: Hoare triple {35147#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35147#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:46,047 INFO L273 TraceCheckUtils]: 63: Hoare triple {35147#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35148#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:46,048 INFO L273 TraceCheckUtils]: 64: Hoare triple {35148#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35148#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:46,048 INFO L273 TraceCheckUtils]: 65: Hoare triple {35148#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35149#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:46,049 INFO L273 TraceCheckUtils]: 66: Hoare triple {35149#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35149#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:46,050 INFO L273 TraceCheckUtils]: 67: Hoare triple {35149#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35150#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:46,050 INFO L273 TraceCheckUtils]: 68: Hoare triple {35150#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35150#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:46,051 INFO L273 TraceCheckUtils]: 69: Hoare triple {35150#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35151#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:46,051 INFO L273 TraceCheckUtils]: 70: Hoare triple {35151#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35151#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:46,052 INFO L273 TraceCheckUtils]: 71: Hoare triple {35151#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35152#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:46,053 INFO L273 TraceCheckUtils]: 72: Hoare triple {35152#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35152#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:46,053 INFO L273 TraceCheckUtils]: 73: Hoare triple {35152#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35153#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:46,054 INFO L273 TraceCheckUtils]: 74: Hoare triple {35153#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35153#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:46,055 INFO L273 TraceCheckUtils]: 75: Hoare triple {35153#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35154#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:46,055 INFO L273 TraceCheckUtils]: 76: Hoare triple {35154#(<= main_~i~0 35)} assume !(~i~0 < 100000); {35118#false} is VALID [2018-11-23 12:11:46,056 INFO L273 TraceCheckUtils]: 77: Hoare triple {35118#false} ~i~0 := 0; {35118#false} is VALID [2018-11-23 12:11:46,056 INFO L273 TraceCheckUtils]: 78: Hoare triple {35118#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35118#false} is VALID [2018-11-23 12:11:46,056 INFO L256 TraceCheckUtils]: 79: Hoare triple {35118#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {35118#false} is VALID [2018-11-23 12:11:46,056 INFO L273 TraceCheckUtils]: 80: Hoare triple {35118#false} ~cond := #in~cond; {35118#false} is VALID [2018-11-23 12:11:46,056 INFO L273 TraceCheckUtils]: 81: Hoare triple {35118#false} assume 0 == ~cond; {35118#false} is VALID [2018-11-23 12:11:46,056 INFO L273 TraceCheckUtils]: 82: Hoare triple {35118#false} assume !false; {35118#false} is VALID [2018-11-23 12:11:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:46,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:46,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:46,070 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:11:48,843 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 12:11:48,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:48,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:49,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {35117#true} call ULTIMATE.init(); {35117#true} is VALID [2018-11-23 12:11:49,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {35117#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35117#true} is VALID [2018-11-23 12:11:49,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {35117#true} assume true; {35117#true} is VALID [2018-11-23 12:11:49,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35117#true} {35117#true} #54#return; {35117#true} is VALID [2018-11-23 12:11:49,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {35117#true} call #t~ret3 := main(); {35117#true} is VALID [2018-11-23 12:11:49,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {35117#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {35173#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:49,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {35173#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35173#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:49,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {35173#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35120#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:49,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {35120#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35120#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:49,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {35120#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35121#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:49,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {35121#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35121#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:49,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {35121#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35122#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:49,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {35122#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35122#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:49,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {35122#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35123#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:49,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {35123#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35123#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:49,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {35123#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35124#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:49,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {35124#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35124#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:49,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {35124#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35125#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:49,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {35125#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35125#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:49,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {35125#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35126#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:49,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {35126#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35126#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:49,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {35126#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35127#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:49,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {35127#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35127#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:49,674 INFO L273 TraceCheckUtils]: 23: Hoare triple {35127#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35128#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:49,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {35128#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35128#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:49,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {35128#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35129#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:49,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {35129#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35129#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:49,677 INFO L273 TraceCheckUtils]: 27: Hoare triple {35129#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35130#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:49,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {35130#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35130#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:49,678 INFO L273 TraceCheckUtils]: 29: Hoare triple {35130#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35131#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:49,678 INFO L273 TraceCheckUtils]: 30: Hoare triple {35131#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35131#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:49,679 INFO L273 TraceCheckUtils]: 31: Hoare triple {35131#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35132#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:49,680 INFO L273 TraceCheckUtils]: 32: Hoare triple {35132#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35132#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:49,680 INFO L273 TraceCheckUtils]: 33: Hoare triple {35132#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35133#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:49,681 INFO L273 TraceCheckUtils]: 34: Hoare triple {35133#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35133#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:49,681 INFO L273 TraceCheckUtils]: 35: Hoare triple {35133#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35134#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:49,682 INFO L273 TraceCheckUtils]: 36: Hoare triple {35134#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35134#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:49,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {35134#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35135#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:49,683 INFO L273 TraceCheckUtils]: 38: Hoare triple {35135#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35135#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:49,684 INFO L273 TraceCheckUtils]: 39: Hoare triple {35135#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35136#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:49,685 INFO L273 TraceCheckUtils]: 40: Hoare triple {35136#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35136#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:49,685 INFO L273 TraceCheckUtils]: 41: Hoare triple {35136#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35137#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:49,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {35137#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35137#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:49,687 INFO L273 TraceCheckUtils]: 43: Hoare triple {35137#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35138#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:49,687 INFO L273 TraceCheckUtils]: 44: Hoare triple {35138#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35138#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:49,688 INFO L273 TraceCheckUtils]: 45: Hoare triple {35138#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35139#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:49,688 INFO L273 TraceCheckUtils]: 46: Hoare triple {35139#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35139#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:49,689 INFO L273 TraceCheckUtils]: 47: Hoare triple {35139#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35140#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:49,690 INFO L273 TraceCheckUtils]: 48: Hoare triple {35140#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35140#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:49,690 INFO L273 TraceCheckUtils]: 49: Hoare triple {35140#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35141#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:49,691 INFO L273 TraceCheckUtils]: 50: Hoare triple {35141#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35141#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:49,692 INFO L273 TraceCheckUtils]: 51: Hoare triple {35141#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35142#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:49,692 INFO L273 TraceCheckUtils]: 52: Hoare triple {35142#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35142#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:49,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {35142#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35143#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:49,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {35143#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35143#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:49,694 INFO L273 TraceCheckUtils]: 55: Hoare triple {35143#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35144#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:49,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {35144#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35144#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:49,695 INFO L273 TraceCheckUtils]: 57: Hoare triple {35144#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35145#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:49,696 INFO L273 TraceCheckUtils]: 58: Hoare triple {35145#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35145#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:49,697 INFO L273 TraceCheckUtils]: 59: Hoare triple {35145#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35146#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:49,697 INFO L273 TraceCheckUtils]: 60: Hoare triple {35146#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35146#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:49,698 INFO L273 TraceCheckUtils]: 61: Hoare triple {35146#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35147#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:49,698 INFO L273 TraceCheckUtils]: 62: Hoare triple {35147#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35147#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:49,699 INFO L273 TraceCheckUtils]: 63: Hoare triple {35147#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35148#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:49,700 INFO L273 TraceCheckUtils]: 64: Hoare triple {35148#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35148#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:49,700 INFO L273 TraceCheckUtils]: 65: Hoare triple {35148#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35149#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:49,701 INFO L273 TraceCheckUtils]: 66: Hoare triple {35149#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35149#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:49,702 INFO L273 TraceCheckUtils]: 67: Hoare triple {35149#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35150#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:49,702 INFO L273 TraceCheckUtils]: 68: Hoare triple {35150#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35150#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:49,703 INFO L273 TraceCheckUtils]: 69: Hoare triple {35150#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35151#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:49,703 INFO L273 TraceCheckUtils]: 70: Hoare triple {35151#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35151#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:49,704 INFO L273 TraceCheckUtils]: 71: Hoare triple {35151#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35152#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:49,705 INFO L273 TraceCheckUtils]: 72: Hoare triple {35152#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35152#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:49,705 INFO L273 TraceCheckUtils]: 73: Hoare triple {35152#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35153#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:49,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {35153#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35153#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:49,707 INFO L273 TraceCheckUtils]: 75: Hoare triple {35153#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {35154#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:49,707 INFO L273 TraceCheckUtils]: 76: Hoare triple {35154#(<= main_~i~0 35)} assume !(~i~0 < 100000); {35118#false} is VALID [2018-11-23 12:11:49,707 INFO L273 TraceCheckUtils]: 77: Hoare triple {35118#false} ~i~0 := 0; {35118#false} is VALID [2018-11-23 12:11:49,708 INFO L273 TraceCheckUtils]: 78: Hoare triple {35118#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35118#false} is VALID [2018-11-23 12:11:49,708 INFO L256 TraceCheckUtils]: 79: Hoare triple {35118#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {35118#false} is VALID [2018-11-23 12:11:49,708 INFO L273 TraceCheckUtils]: 80: Hoare triple {35118#false} ~cond := #in~cond; {35118#false} is VALID [2018-11-23 12:11:49,708 INFO L273 TraceCheckUtils]: 81: Hoare triple {35118#false} assume 0 == ~cond; {35118#false} is VALID [2018-11-23 12:11:49,708 INFO L273 TraceCheckUtils]: 82: Hoare triple {35118#false} assume !false; {35118#false} is VALID [2018-11-23 12:11:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:49,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:49,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 12:11:49,735 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 83 [2018-11-23 12:11:49,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:49,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:11:49,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:49,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:11:49,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:11:49,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:11:49,821 INFO L87 Difference]: Start difference. First operand 263 states and 300 transitions. Second operand 39 states. [2018-11-23 12:11:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:51,870 INFO L93 Difference]: Finished difference Result 458 states and 534 transitions. [2018-11-23 12:11:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:11:51,871 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 83 [2018-11-23 12:11:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:11:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 325 transitions. [2018-11-23 12:11:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:11:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 325 transitions. [2018-11-23 12:11:51,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 325 transitions. [2018-11-23 12:11:52,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:52,185 INFO L225 Difference]: With dead ends: 458 [2018-11-23 12:11:52,185 INFO L226 Difference]: Without dead ends: 272 [2018-11-23 12:11:52,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:11:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-23 12:11:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-11-23 12:11:52,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:52,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand 270 states. [2018-11-23 12:11:52,420 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand 270 states. [2018-11-23 12:11:52,420 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 270 states. [2018-11-23 12:11:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:52,426 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2018-11-23 12:11:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 310 transitions. [2018-11-23 12:11:52,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:52,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:52,427 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 272 states. [2018-11-23 12:11:52,427 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 272 states. [2018-11-23 12:11:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:52,433 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2018-11-23 12:11:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 310 transitions. [2018-11-23 12:11:52,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:52,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:52,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:52,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:52,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-23 12:11:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 308 transitions. [2018-11-23 12:11:52,441 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 308 transitions. Word has length 83 [2018-11-23 12:11:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:52,441 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 308 transitions. [2018-11-23 12:11:52,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:11:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 308 transitions. [2018-11-23 12:11:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 12:11:52,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:52,442 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:52,443 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:52,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash 76429327, now seen corresponding path program 36 times [2018-11-23 12:11:52,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:52,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:52,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:53,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {36981#true} call ULTIMATE.init(); {36981#true} is VALID [2018-11-23 12:11:53,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {36981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36981#true} is VALID [2018-11-23 12:11:53,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {36981#true} assume true; {36981#true} is VALID [2018-11-23 12:11:53,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36981#true} {36981#true} #54#return; {36981#true} is VALID [2018-11-23 12:11:53,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {36981#true} call #t~ret3 := main(); {36981#true} is VALID [2018-11-23 12:11:53,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {36981#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {36983#(= main_~i~0 0)} is VALID [2018-11-23 12:11:53,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {36983#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36983#(= main_~i~0 0)} is VALID [2018-11-23 12:11:53,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {36983#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36984#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:53,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {36984#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36984#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:53,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {36984#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36985#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:53,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {36985#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36985#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:53,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {36985#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36986#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:53,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {36986#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36986#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:53,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {36986#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36987#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:53,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {36987#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36987#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:53,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {36987#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36988#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:53,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {36988#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36988#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:53,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {36988#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36989#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:53,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {36989#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36989#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:53,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {36989#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36990#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:53,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {36990#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36990#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:53,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {36990#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36991#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:53,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {36991#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36991#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:53,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {36991#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36992#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:53,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {36992#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36992#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:53,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {36992#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36993#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:53,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {36993#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36993#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:53,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {36993#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36994#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:53,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {36994#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36994#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:53,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {36994#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36995#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:53,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {36995#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36995#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:53,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {36995#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36996#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:53,760 INFO L273 TraceCheckUtils]: 32: Hoare triple {36996#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36996#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:53,760 INFO L273 TraceCheckUtils]: 33: Hoare triple {36996#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36997#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:53,761 INFO L273 TraceCheckUtils]: 34: Hoare triple {36997#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36997#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:53,762 INFO L273 TraceCheckUtils]: 35: Hoare triple {36997#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36998#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:53,762 INFO L273 TraceCheckUtils]: 36: Hoare triple {36998#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36998#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:53,763 INFO L273 TraceCheckUtils]: 37: Hoare triple {36998#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36999#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:53,763 INFO L273 TraceCheckUtils]: 38: Hoare triple {36999#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36999#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:53,764 INFO L273 TraceCheckUtils]: 39: Hoare triple {36999#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37000#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:53,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {37000#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37000#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:53,765 INFO L273 TraceCheckUtils]: 41: Hoare triple {37000#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37001#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:53,766 INFO L273 TraceCheckUtils]: 42: Hoare triple {37001#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37001#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:53,767 INFO L273 TraceCheckUtils]: 43: Hoare triple {37001#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37002#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:53,767 INFO L273 TraceCheckUtils]: 44: Hoare triple {37002#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37002#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:53,768 INFO L273 TraceCheckUtils]: 45: Hoare triple {37002#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37003#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:53,768 INFO L273 TraceCheckUtils]: 46: Hoare triple {37003#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37003#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:53,769 INFO L273 TraceCheckUtils]: 47: Hoare triple {37003#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37004#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:53,770 INFO L273 TraceCheckUtils]: 48: Hoare triple {37004#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37004#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:53,770 INFO L273 TraceCheckUtils]: 49: Hoare triple {37004#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37005#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:53,771 INFO L273 TraceCheckUtils]: 50: Hoare triple {37005#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37005#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:53,772 INFO L273 TraceCheckUtils]: 51: Hoare triple {37005#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37006#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:53,772 INFO L273 TraceCheckUtils]: 52: Hoare triple {37006#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37006#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:53,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {37006#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37007#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:53,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {37007#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37007#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:53,774 INFO L273 TraceCheckUtils]: 55: Hoare triple {37007#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37008#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:53,775 INFO L273 TraceCheckUtils]: 56: Hoare triple {37008#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37008#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:53,775 INFO L273 TraceCheckUtils]: 57: Hoare triple {37008#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37009#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:53,776 INFO L273 TraceCheckUtils]: 58: Hoare triple {37009#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37009#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:53,777 INFO L273 TraceCheckUtils]: 59: Hoare triple {37009#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37010#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:53,777 INFO L273 TraceCheckUtils]: 60: Hoare triple {37010#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37010#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:53,778 INFO L273 TraceCheckUtils]: 61: Hoare triple {37010#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37011#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:53,778 INFO L273 TraceCheckUtils]: 62: Hoare triple {37011#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37011#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:53,779 INFO L273 TraceCheckUtils]: 63: Hoare triple {37011#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37012#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:53,780 INFO L273 TraceCheckUtils]: 64: Hoare triple {37012#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37012#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:53,780 INFO L273 TraceCheckUtils]: 65: Hoare triple {37012#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37013#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:53,781 INFO L273 TraceCheckUtils]: 66: Hoare triple {37013#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37013#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:53,782 INFO L273 TraceCheckUtils]: 67: Hoare triple {37013#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37014#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:53,782 INFO L273 TraceCheckUtils]: 68: Hoare triple {37014#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37014#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:53,783 INFO L273 TraceCheckUtils]: 69: Hoare triple {37014#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37015#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:53,783 INFO L273 TraceCheckUtils]: 70: Hoare triple {37015#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37015#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:53,784 INFO L273 TraceCheckUtils]: 71: Hoare triple {37015#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37016#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:53,785 INFO L273 TraceCheckUtils]: 72: Hoare triple {37016#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37016#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:53,785 INFO L273 TraceCheckUtils]: 73: Hoare triple {37016#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37017#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:53,786 INFO L273 TraceCheckUtils]: 74: Hoare triple {37017#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37017#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:53,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {37017#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37018#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:53,787 INFO L273 TraceCheckUtils]: 76: Hoare triple {37018#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37018#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:53,788 INFO L273 TraceCheckUtils]: 77: Hoare triple {37018#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37019#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:53,789 INFO L273 TraceCheckUtils]: 78: Hoare triple {37019#(<= main_~i~0 36)} assume !(~i~0 < 100000); {36982#false} is VALID [2018-11-23 12:11:53,789 INFO L273 TraceCheckUtils]: 79: Hoare triple {36982#false} ~i~0 := 0; {36982#false} is VALID [2018-11-23 12:11:53,789 INFO L273 TraceCheckUtils]: 80: Hoare triple {36982#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36982#false} is VALID [2018-11-23 12:11:53,789 INFO L256 TraceCheckUtils]: 81: Hoare triple {36982#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {36982#false} is VALID [2018-11-23 12:11:53,789 INFO L273 TraceCheckUtils]: 82: Hoare triple {36982#false} ~cond := #in~cond; {36982#false} is VALID [2018-11-23 12:11:53,790 INFO L273 TraceCheckUtils]: 83: Hoare triple {36982#false} assume 0 == ~cond; {36982#false} is VALID [2018-11-23 12:11:53,790 INFO L273 TraceCheckUtils]: 84: Hoare triple {36982#false} assume !false; {36982#false} is VALID [2018-11-23 12:11:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:11:53,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:53,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:53,805 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:12:30,264 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 12:12:30,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:30,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:30,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {36981#true} call ULTIMATE.init(); {36981#true} is VALID [2018-11-23 12:12:30,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {36981#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36981#true} is VALID [2018-11-23 12:12:30,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {36981#true} assume true; {36981#true} is VALID [2018-11-23 12:12:30,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36981#true} {36981#true} #54#return; {36981#true} is VALID [2018-11-23 12:12:30,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {36981#true} call #t~ret3 := main(); {36981#true} is VALID [2018-11-23 12:12:30,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {36981#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {37038#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:30,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {37038#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37038#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:30,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {37038#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36984#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:30,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {36984#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36984#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:30,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {36984#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36985#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:30,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {36985#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36985#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:30,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {36985#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36986#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:30,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {36986#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36986#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:30,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {36986#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36987#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:30,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {36987#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36987#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:30,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {36987#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36988#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:30,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {36988#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36988#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:30,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {36988#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36989#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:30,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {36989#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36989#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:30,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {36989#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36990#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:30,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {36990#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36990#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:30,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {36990#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36991#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:30,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {36991#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36991#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:30,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {36991#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36992#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:30,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {36992#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36992#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:30,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {36992#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36993#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:30,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {36993#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36993#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:30,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {36993#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36994#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:30,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {36994#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36994#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:30,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {36994#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36995#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:30,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {36995#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36995#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:30,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {36995#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36996#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:30,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {36996#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36996#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:30,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {36996#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36997#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:30,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {36997#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36997#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:30,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {36997#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36998#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:30,622 INFO L273 TraceCheckUtils]: 36: Hoare triple {36998#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36998#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:30,622 INFO L273 TraceCheckUtils]: 37: Hoare triple {36998#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36999#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:30,623 INFO L273 TraceCheckUtils]: 38: Hoare triple {36999#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36999#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:30,624 INFO L273 TraceCheckUtils]: 39: Hoare triple {36999#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37000#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:30,624 INFO L273 TraceCheckUtils]: 40: Hoare triple {37000#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37000#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:30,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {37000#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37001#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:30,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {37001#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37001#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:30,626 INFO L273 TraceCheckUtils]: 43: Hoare triple {37001#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37002#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:30,627 INFO L273 TraceCheckUtils]: 44: Hoare triple {37002#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37002#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:30,627 INFO L273 TraceCheckUtils]: 45: Hoare triple {37002#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37003#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:30,628 INFO L273 TraceCheckUtils]: 46: Hoare triple {37003#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37003#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:30,629 INFO L273 TraceCheckUtils]: 47: Hoare triple {37003#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37004#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:30,629 INFO L273 TraceCheckUtils]: 48: Hoare triple {37004#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37004#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:30,630 INFO L273 TraceCheckUtils]: 49: Hoare triple {37004#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37005#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:30,630 INFO L273 TraceCheckUtils]: 50: Hoare triple {37005#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37005#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:30,631 INFO L273 TraceCheckUtils]: 51: Hoare triple {37005#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37006#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:30,632 INFO L273 TraceCheckUtils]: 52: Hoare triple {37006#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37006#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:30,632 INFO L273 TraceCheckUtils]: 53: Hoare triple {37006#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37007#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:30,633 INFO L273 TraceCheckUtils]: 54: Hoare triple {37007#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37007#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:30,634 INFO L273 TraceCheckUtils]: 55: Hoare triple {37007#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37008#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:30,634 INFO L273 TraceCheckUtils]: 56: Hoare triple {37008#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37008#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:30,635 INFO L273 TraceCheckUtils]: 57: Hoare triple {37008#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37009#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:30,635 INFO L273 TraceCheckUtils]: 58: Hoare triple {37009#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37009#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:30,636 INFO L273 TraceCheckUtils]: 59: Hoare triple {37009#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37010#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:30,637 INFO L273 TraceCheckUtils]: 60: Hoare triple {37010#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37010#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:30,637 INFO L273 TraceCheckUtils]: 61: Hoare triple {37010#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37011#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:30,638 INFO L273 TraceCheckUtils]: 62: Hoare triple {37011#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37011#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:30,639 INFO L273 TraceCheckUtils]: 63: Hoare triple {37011#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37012#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:30,639 INFO L273 TraceCheckUtils]: 64: Hoare triple {37012#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37012#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:30,640 INFO L273 TraceCheckUtils]: 65: Hoare triple {37012#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37013#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:30,640 INFO L273 TraceCheckUtils]: 66: Hoare triple {37013#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37013#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:30,641 INFO L273 TraceCheckUtils]: 67: Hoare triple {37013#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37014#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:30,642 INFO L273 TraceCheckUtils]: 68: Hoare triple {37014#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37014#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:30,642 INFO L273 TraceCheckUtils]: 69: Hoare triple {37014#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37015#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:30,643 INFO L273 TraceCheckUtils]: 70: Hoare triple {37015#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37015#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:30,644 INFO L273 TraceCheckUtils]: 71: Hoare triple {37015#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37016#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:30,644 INFO L273 TraceCheckUtils]: 72: Hoare triple {37016#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37016#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:30,645 INFO L273 TraceCheckUtils]: 73: Hoare triple {37016#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37017#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:30,645 INFO L273 TraceCheckUtils]: 74: Hoare triple {37017#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37017#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:30,646 INFO L273 TraceCheckUtils]: 75: Hoare triple {37017#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37018#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:30,647 INFO L273 TraceCheckUtils]: 76: Hoare triple {37018#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37018#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:30,647 INFO L273 TraceCheckUtils]: 77: Hoare triple {37018#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37019#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:30,648 INFO L273 TraceCheckUtils]: 78: Hoare triple {37019#(<= main_~i~0 36)} assume !(~i~0 < 100000); {36982#false} is VALID [2018-11-23 12:12:30,648 INFO L273 TraceCheckUtils]: 79: Hoare triple {36982#false} ~i~0 := 0; {36982#false} is VALID [2018-11-23 12:12:30,648 INFO L273 TraceCheckUtils]: 80: Hoare triple {36982#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {36982#false} is VALID [2018-11-23 12:12:30,648 INFO L256 TraceCheckUtils]: 81: Hoare triple {36982#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {36982#false} is VALID [2018-11-23 12:12:30,649 INFO L273 TraceCheckUtils]: 82: Hoare triple {36982#false} ~cond := #in~cond; {36982#false} is VALID [2018-11-23 12:12:30,649 INFO L273 TraceCheckUtils]: 83: Hoare triple {36982#false} assume 0 == ~cond; {36982#false} is VALID [2018-11-23 12:12:30,649 INFO L273 TraceCheckUtils]: 84: Hoare triple {36982#false} assume !false; {36982#false} is VALID [2018-11-23 12:12:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:12:30,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:12:30,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 12:12:30,681 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 85 [2018-11-23 12:12:30,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:30,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:12:30,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:30,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:12:30,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:12:30,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:12:30,768 INFO L87 Difference]: Start difference. First operand 270 states and 308 transitions. Second operand 40 states. [2018-11-23 12:12:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:33,243 INFO L93 Difference]: Finished difference Result 470 states and 548 transitions. [2018-11-23 12:12:33,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:12:33,243 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 85 [2018-11-23 12:12:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:12:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 333 transitions. [2018-11-23 12:12:33,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:12:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 333 transitions. [2018-11-23 12:12:33,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 333 transitions. [2018-11-23 12:12:33,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:33,566 INFO L225 Difference]: With dead ends: 470 [2018-11-23 12:12:33,566 INFO L226 Difference]: Without dead ends: 279 [2018-11-23 12:12:33,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:12:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-23 12:12:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-11-23 12:12:34,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:34,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand 277 states. [2018-11-23 12:12:34,109 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand 277 states. [2018-11-23 12:12:34,109 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 277 states. [2018-11-23 12:12:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:34,117 INFO L93 Difference]: Finished difference Result 279 states and 318 transitions. [2018-11-23 12:12:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2018-11-23 12:12:34,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:34,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:34,118 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand 279 states. [2018-11-23 12:12:34,118 INFO L87 Difference]: Start difference. First operand 277 states. Second operand 279 states. [2018-11-23 12:12:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:34,125 INFO L93 Difference]: Finished difference Result 279 states and 318 transitions. [2018-11-23 12:12:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2018-11-23 12:12:34,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:34,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:34,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:34,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-23 12:12:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 316 transitions. [2018-11-23 12:12:34,134 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 316 transitions. Word has length 85 [2018-11-23 12:12:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:34,134 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 316 transitions. [2018-11-23 12:12:34,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:12:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 316 transitions. [2018-11-23 12:12:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 12:12:34,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:34,135 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:34,135 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:34,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:34,136 INFO L82 PathProgramCache]: Analyzing trace with hash 316327405, now seen corresponding path program 37 times [2018-11-23 12:12:34,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:34,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:34,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:34,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:34,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:34,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {38893#true} call ULTIMATE.init(); {38893#true} is VALID [2018-11-23 12:12:34,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {38893#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38893#true} is VALID [2018-11-23 12:12:34,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {38893#true} assume true; {38893#true} is VALID [2018-11-23 12:12:34,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38893#true} {38893#true} #54#return; {38893#true} is VALID [2018-11-23 12:12:34,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {38893#true} call #t~ret3 := main(); {38893#true} is VALID [2018-11-23 12:12:34,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {38893#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {38895#(= main_~i~0 0)} is VALID [2018-11-23 12:12:34,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {38895#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38895#(= main_~i~0 0)} is VALID [2018-11-23 12:12:34,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {38895#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38896#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:34,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {38896#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38896#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:34,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {38896#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38897#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:34,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {38897#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38897#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:34,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {38897#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38898#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:34,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {38898#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38898#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:34,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {38898#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38899#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:34,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {38899#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38899#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:34,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {38899#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38900#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:34,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {38900#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38900#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:34,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {38900#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38901#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:34,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {38901#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38901#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:34,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {38901#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38902#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:34,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {38902#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38902#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:34,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {38902#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38903#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:34,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {38903#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38903#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:34,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {38903#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38904#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:34,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {38904#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38904#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:34,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {38904#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38905#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:34,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {38905#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38905#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:34,957 INFO L273 TraceCheckUtils]: 27: Hoare triple {38905#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38906#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:34,957 INFO L273 TraceCheckUtils]: 28: Hoare triple {38906#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38906#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:34,958 INFO L273 TraceCheckUtils]: 29: Hoare triple {38906#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38907#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:34,959 INFO L273 TraceCheckUtils]: 30: Hoare triple {38907#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38907#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:34,959 INFO L273 TraceCheckUtils]: 31: Hoare triple {38907#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38908#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:34,960 INFO L273 TraceCheckUtils]: 32: Hoare triple {38908#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38908#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:34,961 INFO L273 TraceCheckUtils]: 33: Hoare triple {38908#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38909#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:34,961 INFO L273 TraceCheckUtils]: 34: Hoare triple {38909#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38909#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:34,962 INFO L273 TraceCheckUtils]: 35: Hoare triple {38909#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38910#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:34,962 INFO L273 TraceCheckUtils]: 36: Hoare triple {38910#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38910#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:34,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {38910#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38911#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:34,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {38911#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38911#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:34,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {38911#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38912#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:34,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {38912#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38912#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:34,966 INFO L273 TraceCheckUtils]: 41: Hoare triple {38912#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38913#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:34,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {38913#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38913#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:34,967 INFO L273 TraceCheckUtils]: 43: Hoare triple {38913#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38914#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:34,967 INFO L273 TraceCheckUtils]: 44: Hoare triple {38914#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38914#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:34,968 INFO L273 TraceCheckUtils]: 45: Hoare triple {38914#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38915#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:34,970 INFO L273 TraceCheckUtils]: 46: Hoare triple {38915#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38915#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:34,971 INFO L273 TraceCheckUtils]: 47: Hoare triple {38915#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38916#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:34,972 INFO L273 TraceCheckUtils]: 48: Hoare triple {38916#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38916#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:34,973 INFO L273 TraceCheckUtils]: 49: Hoare triple {38916#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38917#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:34,973 INFO L273 TraceCheckUtils]: 50: Hoare triple {38917#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38917#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:34,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {38917#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38918#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:34,974 INFO L273 TraceCheckUtils]: 52: Hoare triple {38918#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38918#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:34,975 INFO L273 TraceCheckUtils]: 53: Hoare triple {38918#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38919#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:34,976 INFO L273 TraceCheckUtils]: 54: Hoare triple {38919#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38919#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:34,976 INFO L273 TraceCheckUtils]: 55: Hoare triple {38919#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38920#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:34,977 INFO L273 TraceCheckUtils]: 56: Hoare triple {38920#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38920#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:34,978 INFO L273 TraceCheckUtils]: 57: Hoare triple {38920#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38921#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:34,978 INFO L273 TraceCheckUtils]: 58: Hoare triple {38921#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38921#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:34,979 INFO L273 TraceCheckUtils]: 59: Hoare triple {38921#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38922#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:34,979 INFO L273 TraceCheckUtils]: 60: Hoare triple {38922#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38922#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:34,980 INFO L273 TraceCheckUtils]: 61: Hoare triple {38922#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38923#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:34,981 INFO L273 TraceCheckUtils]: 62: Hoare triple {38923#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38923#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:34,981 INFO L273 TraceCheckUtils]: 63: Hoare triple {38923#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38924#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:34,982 INFO L273 TraceCheckUtils]: 64: Hoare triple {38924#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38924#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:34,983 INFO L273 TraceCheckUtils]: 65: Hoare triple {38924#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38925#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:34,983 INFO L273 TraceCheckUtils]: 66: Hoare triple {38925#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38925#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:34,984 INFO L273 TraceCheckUtils]: 67: Hoare triple {38925#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38926#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:34,985 INFO L273 TraceCheckUtils]: 68: Hoare triple {38926#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38926#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:34,985 INFO L273 TraceCheckUtils]: 69: Hoare triple {38926#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38927#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:34,986 INFO L273 TraceCheckUtils]: 70: Hoare triple {38927#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38927#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:34,987 INFO L273 TraceCheckUtils]: 71: Hoare triple {38927#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38928#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:34,987 INFO L273 TraceCheckUtils]: 72: Hoare triple {38928#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38928#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:34,988 INFO L273 TraceCheckUtils]: 73: Hoare triple {38928#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38929#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:34,988 INFO L273 TraceCheckUtils]: 74: Hoare triple {38929#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38929#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:34,989 INFO L273 TraceCheckUtils]: 75: Hoare triple {38929#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38930#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:34,990 INFO L273 TraceCheckUtils]: 76: Hoare triple {38930#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38930#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:34,990 INFO L273 TraceCheckUtils]: 77: Hoare triple {38930#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38931#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:34,991 INFO L273 TraceCheckUtils]: 78: Hoare triple {38931#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38931#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:34,992 INFO L273 TraceCheckUtils]: 79: Hoare triple {38931#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38932#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:34,992 INFO L273 TraceCheckUtils]: 80: Hoare triple {38932#(<= main_~i~0 37)} assume !(~i~0 < 100000); {38894#false} is VALID [2018-11-23 12:12:34,992 INFO L273 TraceCheckUtils]: 81: Hoare triple {38894#false} ~i~0 := 0; {38894#false} is VALID [2018-11-23 12:12:34,993 INFO L273 TraceCheckUtils]: 82: Hoare triple {38894#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38894#false} is VALID [2018-11-23 12:12:34,993 INFO L256 TraceCheckUtils]: 83: Hoare triple {38894#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {38894#false} is VALID [2018-11-23 12:12:34,993 INFO L273 TraceCheckUtils]: 84: Hoare triple {38894#false} ~cond := #in~cond; {38894#false} is VALID [2018-11-23 12:12:34,993 INFO L273 TraceCheckUtils]: 85: Hoare triple {38894#false} assume 0 == ~cond; {38894#false} is VALID [2018-11-23 12:12:34,993 INFO L273 TraceCheckUtils]: 86: Hoare triple {38894#false} assume !false; {38894#false} is VALID [2018-11-23 12:12:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:12:35,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:35,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:35,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:35,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:35,316 INFO L256 TraceCheckUtils]: 0: Hoare triple {38893#true} call ULTIMATE.init(); {38893#true} is VALID [2018-11-23 12:12:35,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {38893#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {38893#true} is VALID [2018-11-23 12:12:35,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {38893#true} assume true; {38893#true} is VALID [2018-11-23 12:12:35,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {38893#true} {38893#true} #54#return; {38893#true} is VALID [2018-11-23 12:12:35,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {38893#true} call #t~ret3 := main(); {38893#true} is VALID [2018-11-23 12:12:35,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {38893#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {38951#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:35,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {38951#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38951#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:35,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {38951#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38896#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:35,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {38896#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38896#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:35,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {38896#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38897#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:35,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {38897#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38897#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:35,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {38897#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38898#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:35,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {38898#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38898#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:35,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {38898#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38899#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:35,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {38899#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38899#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:35,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {38899#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38900#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:35,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {38900#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38900#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:35,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {38900#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38901#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:35,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {38901#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38901#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:35,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {38901#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38902#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:35,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {38902#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38902#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:35,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {38902#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38903#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:35,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {38903#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38903#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:35,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {38903#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38904#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:35,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {38904#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38904#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:35,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {38904#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38905#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:35,330 INFO L273 TraceCheckUtils]: 26: Hoare triple {38905#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38905#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:35,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {38905#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38906#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:35,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {38906#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38906#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:35,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {38906#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38907#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:35,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {38907#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38907#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:35,333 INFO L273 TraceCheckUtils]: 31: Hoare triple {38907#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38908#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:35,333 INFO L273 TraceCheckUtils]: 32: Hoare triple {38908#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38908#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:35,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {38908#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38909#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:35,335 INFO L273 TraceCheckUtils]: 34: Hoare triple {38909#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38909#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:35,335 INFO L273 TraceCheckUtils]: 35: Hoare triple {38909#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38910#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:35,336 INFO L273 TraceCheckUtils]: 36: Hoare triple {38910#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38910#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:35,337 INFO L273 TraceCheckUtils]: 37: Hoare triple {38910#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38911#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:35,337 INFO L273 TraceCheckUtils]: 38: Hoare triple {38911#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38911#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:35,338 INFO L273 TraceCheckUtils]: 39: Hoare triple {38911#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38912#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:35,338 INFO L273 TraceCheckUtils]: 40: Hoare triple {38912#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38912#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:35,339 INFO L273 TraceCheckUtils]: 41: Hoare triple {38912#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38913#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:35,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {38913#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38913#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:35,340 INFO L273 TraceCheckUtils]: 43: Hoare triple {38913#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38914#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:35,341 INFO L273 TraceCheckUtils]: 44: Hoare triple {38914#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38914#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:35,342 INFO L273 TraceCheckUtils]: 45: Hoare triple {38914#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38915#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:35,342 INFO L273 TraceCheckUtils]: 46: Hoare triple {38915#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38915#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:35,343 INFO L273 TraceCheckUtils]: 47: Hoare triple {38915#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38916#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:35,343 INFO L273 TraceCheckUtils]: 48: Hoare triple {38916#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38916#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:35,344 INFO L273 TraceCheckUtils]: 49: Hoare triple {38916#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38917#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:35,345 INFO L273 TraceCheckUtils]: 50: Hoare triple {38917#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38917#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:35,345 INFO L273 TraceCheckUtils]: 51: Hoare triple {38917#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38918#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:35,346 INFO L273 TraceCheckUtils]: 52: Hoare triple {38918#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38918#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:35,347 INFO L273 TraceCheckUtils]: 53: Hoare triple {38918#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38919#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:35,347 INFO L273 TraceCheckUtils]: 54: Hoare triple {38919#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38919#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:35,348 INFO L273 TraceCheckUtils]: 55: Hoare triple {38919#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38920#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:35,348 INFO L273 TraceCheckUtils]: 56: Hoare triple {38920#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38920#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:35,350 INFO L273 TraceCheckUtils]: 57: Hoare triple {38920#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38921#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:35,351 INFO L273 TraceCheckUtils]: 58: Hoare triple {38921#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38921#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:35,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {38921#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38922#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:35,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {38922#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38922#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:35,353 INFO L273 TraceCheckUtils]: 61: Hoare triple {38922#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38923#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:35,353 INFO L273 TraceCheckUtils]: 62: Hoare triple {38923#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38923#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:35,354 INFO L273 TraceCheckUtils]: 63: Hoare triple {38923#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38924#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:35,354 INFO L273 TraceCheckUtils]: 64: Hoare triple {38924#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38924#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:35,354 INFO L273 TraceCheckUtils]: 65: Hoare triple {38924#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38925#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:35,355 INFO L273 TraceCheckUtils]: 66: Hoare triple {38925#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38925#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:35,355 INFO L273 TraceCheckUtils]: 67: Hoare triple {38925#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38926#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:35,356 INFO L273 TraceCheckUtils]: 68: Hoare triple {38926#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38926#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:35,356 INFO L273 TraceCheckUtils]: 69: Hoare triple {38926#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38927#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:35,357 INFO L273 TraceCheckUtils]: 70: Hoare triple {38927#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38927#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:35,358 INFO L273 TraceCheckUtils]: 71: Hoare triple {38927#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38928#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:35,358 INFO L273 TraceCheckUtils]: 72: Hoare triple {38928#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38928#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:35,359 INFO L273 TraceCheckUtils]: 73: Hoare triple {38928#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38929#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:35,360 INFO L273 TraceCheckUtils]: 74: Hoare triple {38929#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38929#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:35,360 INFO L273 TraceCheckUtils]: 75: Hoare triple {38929#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38930#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:35,361 INFO L273 TraceCheckUtils]: 76: Hoare triple {38930#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38930#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:35,361 INFO L273 TraceCheckUtils]: 77: Hoare triple {38930#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38931#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:35,362 INFO L273 TraceCheckUtils]: 78: Hoare triple {38931#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38931#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:35,363 INFO L273 TraceCheckUtils]: 79: Hoare triple {38931#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38932#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:35,363 INFO L273 TraceCheckUtils]: 80: Hoare triple {38932#(<= main_~i~0 37)} assume !(~i~0 < 100000); {38894#false} is VALID [2018-11-23 12:12:35,364 INFO L273 TraceCheckUtils]: 81: Hoare triple {38894#false} ~i~0 := 0; {38894#false} is VALID [2018-11-23 12:12:35,364 INFO L273 TraceCheckUtils]: 82: Hoare triple {38894#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {38894#false} is VALID [2018-11-23 12:12:35,364 INFO L256 TraceCheckUtils]: 83: Hoare triple {38894#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {38894#false} is VALID [2018-11-23 12:12:35,364 INFO L273 TraceCheckUtils]: 84: Hoare triple {38894#false} ~cond := #in~cond; {38894#false} is VALID [2018-11-23 12:12:35,364 INFO L273 TraceCheckUtils]: 85: Hoare triple {38894#false} assume 0 == ~cond; {38894#false} is VALID [2018-11-23 12:12:35,365 INFO L273 TraceCheckUtils]: 86: Hoare triple {38894#false} assume !false; {38894#false} is VALID [2018-11-23 12:12:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:12:35,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:12:35,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:12:35,391 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2018-11-23 12:12:35,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:35,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:12:35,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:35,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:12:35,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:12:35,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:12:35,486 INFO L87 Difference]: Start difference. First operand 277 states and 316 transitions. Second operand 41 states. [2018-11-23 12:12:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:37,926 INFO L93 Difference]: Finished difference Result 482 states and 562 transitions. [2018-11-23 12:12:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:12:37,926 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2018-11-23 12:12:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:12:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 341 transitions. [2018-11-23 12:12:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:12:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 341 transitions. [2018-11-23 12:12:37,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 341 transitions. [2018-11-23 12:12:38,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 341 edges. 341 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:38,266 INFO L225 Difference]: With dead ends: 482 [2018-11-23 12:12:38,266 INFO L226 Difference]: Without dead ends: 286 [2018-11-23 12:12:38,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:12:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-23 12:12:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-11-23 12:12:38,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:38,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand 284 states. [2018-11-23 12:12:38,553 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 284 states. [2018-11-23 12:12:38,553 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 284 states. [2018-11-23 12:12:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:38,559 INFO L93 Difference]: Finished difference Result 286 states and 326 transitions. [2018-11-23 12:12:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 326 transitions. [2018-11-23 12:12:38,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:38,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:38,560 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 286 states. [2018-11-23 12:12:38,560 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 286 states. [2018-11-23 12:12:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:38,566 INFO L93 Difference]: Finished difference Result 286 states and 326 transitions. [2018-11-23 12:12:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 326 transitions. [2018-11-23 12:12:38,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:38,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:38,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:38,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 12:12:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2018-11-23 12:12:38,573 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 87 [2018-11-23 12:12:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:38,573 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2018-11-23 12:12:38,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:12:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2018-11-23 12:12:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 12:12:38,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:38,574 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:38,574 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:38,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1069853621, now seen corresponding path program 38 times [2018-11-23 12:12:38,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:38,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:38,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:38,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:38,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:39,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {40853#true} call ULTIMATE.init(); {40853#true} is VALID [2018-11-23 12:12:39,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {40853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40853#true} is VALID [2018-11-23 12:12:39,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {40853#true} assume true; {40853#true} is VALID [2018-11-23 12:12:39,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40853#true} {40853#true} #54#return; {40853#true} is VALID [2018-11-23 12:12:39,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {40853#true} call #t~ret3 := main(); {40853#true} is VALID [2018-11-23 12:12:39,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {40853#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {40855#(= main_~i~0 0)} is VALID [2018-11-23 12:12:39,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {40855#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40855#(= main_~i~0 0)} is VALID [2018-11-23 12:12:39,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {40855#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40856#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:39,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {40856#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40856#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:39,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {40856#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40857#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:39,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {40857#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40857#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:39,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {40857#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40858#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:39,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {40858#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40858#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:39,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {40858#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40859#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:39,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {40859#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40859#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:39,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {40859#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40860#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:39,440 INFO L273 TraceCheckUtils]: 16: Hoare triple {40860#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40860#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:39,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {40860#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40861#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:39,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {40861#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40861#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:39,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {40861#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40862#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:39,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {40862#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40862#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:39,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {40862#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40863#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:39,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {40863#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40863#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:39,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {40863#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40864#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:39,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {40864#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40864#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:39,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {40864#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40865#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:39,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {40865#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40865#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:39,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {40865#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40866#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:39,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {40866#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40866#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:39,449 INFO L273 TraceCheckUtils]: 29: Hoare triple {40866#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40867#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:39,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {40867#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40867#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:39,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {40867#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40868#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:39,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {40868#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40868#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:39,451 INFO L273 TraceCheckUtils]: 33: Hoare triple {40868#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40869#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:39,452 INFO L273 TraceCheckUtils]: 34: Hoare triple {40869#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40869#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:39,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {40869#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40870#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:39,453 INFO L273 TraceCheckUtils]: 36: Hoare triple {40870#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40870#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 37: Hoare triple {40870#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40871#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:39,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {40871#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40871#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:39,455 INFO L273 TraceCheckUtils]: 39: Hoare triple {40871#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40872#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:39,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {40872#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40872#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:39,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {40872#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40873#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:39,457 INFO L273 TraceCheckUtils]: 42: Hoare triple {40873#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40873#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:39,457 INFO L273 TraceCheckUtils]: 43: Hoare triple {40873#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40874#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:39,458 INFO L273 TraceCheckUtils]: 44: Hoare triple {40874#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40874#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:39,459 INFO L273 TraceCheckUtils]: 45: Hoare triple {40874#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40875#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:39,459 INFO L273 TraceCheckUtils]: 46: Hoare triple {40875#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40875#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:39,460 INFO L273 TraceCheckUtils]: 47: Hoare triple {40875#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40876#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:39,460 INFO L273 TraceCheckUtils]: 48: Hoare triple {40876#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40876#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:39,461 INFO L273 TraceCheckUtils]: 49: Hoare triple {40876#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40877#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:39,462 INFO L273 TraceCheckUtils]: 50: Hoare triple {40877#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40877#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:39,462 INFO L273 TraceCheckUtils]: 51: Hoare triple {40877#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40878#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:39,463 INFO L273 TraceCheckUtils]: 52: Hoare triple {40878#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40878#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:39,464 INFO L273 TraceCheckUtils]: 53: Hoare triple {40878#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40879#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:39,464 INFO L273 TraceCheckUtils]: 54: Hoare triple {40879#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40879#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:39,465 INFO L273 TraceCheckUtils]: 55: Hoare triple {40879#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40880#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:39,465 INFO L273 TraceCheckUtils]: 56: Hoare triple {40880#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40880#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:39,466 INFO L273 TraceCheckUtils]: 57: Hoare triple {40880#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40881#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:39,467 INFO L273 TraceCheckUtils]: 58: Hoare triple {40881#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40881#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:39,467 INFO L273 TraceCheckUtils]: 59: Hoare triple {40881#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40882#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:39,468 INFO L273 TraceCheckUtils]: 60: Hoare triple {40882#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40882#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:39,469 INFO L273 TraceCheckUtils]: 61: Hoare triple {40882#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40883#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:39,469 INFO L273 TraceCheckUtils]: 62: Hoare triple {40883#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40883#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:39,470 INFO L273 TraceCheckUtils]: 63: Hoare triple {40883#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40884#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:39,470 INFO L273 TraceCheckUtils]: 64: Hoare triple {40884#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40884#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:39,471 INFO L273 TraceCheckUtils]: 65: Hoare triple {40884#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40885#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:39,472 INFO L273 TraceCheckUtils]: 66: Hoare triple {40885#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40885#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:39,472 INFO L273 TraceCheckUtils]: 67: Hoare triple {40885#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40886#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:39,473 INFO L273 TraceCheckUtils]: 68: Hoare triple {40886#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40886#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:39,474 INFO L273 TraceCheckUtils]: 69: Hoare triple {40886#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40887#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:39,474 INFO L273 TraceCheckUtils]: 70: Hoare triple {40887#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40887#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:39,475 INFO L273 TraceCheckUtils]: 71: Hoare triple {40887#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40888#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:39,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {40888#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40888#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:39,476 INFO L273 TraceCheckUtils]: 73: Hoare triple {40888#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40889#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:39,477 INFO L273 TraceCheckUtils]: 74: Hoare triple {40889#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40889#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:39,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {40889#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40890#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:39,478 INFO L273 TraceCheckUtils]: 76: Hoare triple {40890#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40890#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:39,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {40890#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40891#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:39,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {40891#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40891#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:39,480 INFO L273 TraceCheckUtils]: 79: Hoare triple {40891#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40892#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:39,480 INFO L273 TraceCheckUtils]: 80: Hoare triple {40892#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40892#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:39,481 INFO L273 TraceCheckUtils]: 81: Hoare triple {40892#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40893#(<= main_~i~0 38)} is VALID [2018-11-23 12:12:39,482 INFO L273 TraceCheckUtils]: 82: Hoare triple {40893#(<= main_~i~0 38)} assume !(~i~0 < 100000); {40854#false} is VALID [2018-11-23 12:12:39,482 INFO L273 TraceCheckUtils]: 83: Hoare triple {40854#false} ~i~0 := 0; {40854#false} is VALID [2018-11-23 12:12:39,482 INFO L273 TraceCheckUtils]: 84: Hoare triple {40854#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40854#false} is VALID [2018-11-23 12:12:39,482 INFO L256 TraceCheckUtils]: 85: Hoare triple {40854#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {40854#false} is VALID [2018-11-23 12:12:39,483 INFO L273 TraceCheckUtils]: 86: Hoare triple {40854#false} ~cond := #in~cond; {40854#false} is VALID [2018-11-23 12:12:39,483 INFO L273 TraceCheckUtils]: 87: Hoare triple {40854#false} assume 0 == ~cond; {40854#false} is VALID [2018-11-23 12:12:39,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {40854#false} assume !false; {40854#false} is VALID [2018-11-23 12:12:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:12:39,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:39,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:39,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:12:39,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:12:39,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:39,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:39,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {40853#true} call ULTIMATE.init(); {40853#true} is VALID [2018-11-23 12:12:39,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {40853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40853#true} is VALID [2018-11-23 12:12:39,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {40853#true} assume true; {40853#true} is VALID [2018-11-23 12:12:39,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40853#true} {40853#true} #54#return; {40853#true} is VALID [2018-11-23 12:12:39,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {40853#true} call #t~ret3 := main(); {40853#true} is VALID [2018-11-23 12:12:39,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {40853#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {40912#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:39,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {40912#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40912#(<= main_~i~0 0)} is VALID [2018-11-23 12:12:39,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {40912#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40856#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:39,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {40856#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40856#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:39,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {40856#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40857#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:39,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {40857#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40857#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:39,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {40857#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40858#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:39,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {40858#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40858#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:39,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {40858#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40859#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:39,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {40859#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40859#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:39,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {40859#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40860#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:39,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {40860#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40860#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:39,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {40860#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40861#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:39,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {40861#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40861#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:39,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {40861#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40862#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:39,868 INFO L273 TraceCheckUtils]: 20: Hoare triple {40862#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40862#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:39,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {40862#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40863#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:39,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {40863#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40863#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:39,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {40863#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40864#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:39,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {40864#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40864#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:39,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {40864#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40865#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:39,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {40865#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40865#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:39,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {40865#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40866#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:39,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {40866#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40866#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:39,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {40866#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40867#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:39,874 INFO L273 TraceCheckUtils]: 30: Hoare triple {40867#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40867#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:39,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {40867#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40868#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:39,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {40868#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40868#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:39,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {40868#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40869#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:39,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {40869#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40869#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:39,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {40869#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40870#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:39,878 INFO L273 TraceCheckUtils]: 36: Hoare triple {40870#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40870#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:39,878 INFO L273 TraceCheckUtils]: 37: Hoare triple {40870#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40871#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:39,879 INFO L273 TraceCheckUtils]: 38: Hoare triple {40871#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40871#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:39,880 INFO L273 TraceCheckUtils]: 39: Hoare triple {40871#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40872#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:39,880 INFO L273 TraceCheckUtils]: 40: Hoare triple {40872#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40872#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:39,881 INFO L273 TraceCheckUtils]: 41: Hoare triple {40872#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40873#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:39,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {40873#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40873#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:39,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {40873#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40874#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:39,883 INFO L273 TraceCheckUtils]: 44: Hoare triple {40874#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40874#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:39,883 INFO L273 TraceCheckUtils]: 45: Hoare triple {40874#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40875#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:39,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {40875#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40875#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:39,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {40875#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40876#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:39,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {40876#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40876#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:39,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {40876#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40877#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:39,886 INFO L273 TraceCheckUtils]: 50: Hoare triple {40877#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40877#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:39,887 INFO L273 TraceCheckUtils]: 51: Hoare triple {40877#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40878#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:39,888 INFO L273 TraceCheckUtils]: 52: Hoare triple {40878#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40878#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:39,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {40878#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40879#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:39,889 INFO L273 TraceCheckUtils]: 54: Hoare triple {40879#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40879#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:39,890 INFO L273 TraceCheckUtils]: 55: Hoare triple {40879#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40880#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:39,890 INFO L273 TraceCheckUtils]: 56: Hoare triple {40880#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40880#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:39,891 INFO L273 TraceCheckUtils]: 57: Hoare triple {40880#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40881#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:39,891 INFO L273 TraceCheckUtils]: 58: Hoare triple {40881#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40881#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:39,892 INFO L273 TraceCheckUtils]: 59: Hoare triple {40881#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40882#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:39,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {40882#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40882#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:39,893 INFO L273 TraceCheckUtils]: 61: Hoare triple {40882#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40883#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:39,894 INFO L273 TraceCheckUtils]: 62: Hoare triple {40883#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40883#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:39,894 INFO L273 TraceCheckUtils]: 63: Hoare triple {40883#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40884#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:39,895 INFO L273 TraceCheckUtils]: 64: Hoare triple {40884#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40884#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:39,896 INFO L273 TraceCheckUtils]: 65: Hoare triple {40884#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40885#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:39,896 INFO L273 TraceCheckUtils]: 66: Hoare triple {40885#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40885#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:39,897 INFO L273 TraceCheckUtils]: 67: Hoare triple {40885#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40886#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:39,898 INFO L273 TraceCheckUtils]: 68: Hoare triple {40886#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40886#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:39,898 INFO L273 TraceCheckUtils]: 69: Hoare triple {40886#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40887#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:39,899 INFO L273 TraceCheckUtils]: 70: Hoare triple {40887#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40887#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:39,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {40887#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40888#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:39,900 INFO L273 TraceCheckUtils]: 72: Hoare triple {40888#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40888#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:39,905 INFO L273 TraceCheckUtils]: 73: Hoare triple {40888#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40889#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:39,905 INFO L273 TraceCheckUtils]: 74: Hoare triple {40889#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40889#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:39,906 INFO L273 TraceCheckUtils]: 75: Hoare triple {40889#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40890#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:39,906 INFO L273 TraceCheckUtils]: 76: Hoare triple {40890#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40890#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:39,907 INFO L273 TraceCheckUtils]: 77: Hoare triple {40890#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40891#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:39,907 INFO L273 TraceCheckUtils]: 78: Hoare triple {40891#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40891#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:39,907 INFO L273 TraceCheckUtils]: 79: Hoare triple {40891#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40892#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:39,908 INFO L273 TraceCheckUtils]: 80: Hoare triple {40892#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40892#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:39,908 INFO L273 TraceCheckUtils]: 81: Hoare triple {40892#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {40893#(<= main_~i~0 38)} is VALID [2018-11-23 12:12:39,909 INFO L273 TraceCheckUtils]: 82: Hoare triple {40893#(<= main_~i~0 38)} assume !(~i~0 < 100000); {40854#false} is VALID [2018-11-23 12:12:39,909 INFO L273 TraceCheckUtils]: 83: Hoare triple {40854#false} ~i~0 := 0; {40854#false} is VALID [2018-11-23 12:12:39,910 INFO L273 TraceCheckUtils]: 84: Hoare triple {40854#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40854#false} is VALID [2018-11-23 12:12:39,910 INFO L256 TraceCheckUtils]: 85: Hoare triple {40854#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {40854#false} is VALID [2018-11-23 12:12:39,910 INFO L273 TraceCheckUtils]: 86: Hoare triple {40854#false} ~cond := #in~cond; {40854#false} is VALID [2018-11-23 12:12:39,910 INFO L273 TraceCheckUtils]: 87: Hoare triple {40854#false} assume 0 == ~cond; {40854#false} is VALID [2018-11-23 12:12:39,910 INFO L273 TraceCheckUtils]: 88: Hoare triple {40854#false} assume !false; {40854#false} is VALID [2018-11-23 12:12:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:12:39,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:12:39,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:12:39,937 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 89 [2018-11-23 12:12:39,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:39,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:12:40,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:40,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:12:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:12:40,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:12:40,092 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand 42 states. [2018-11-23 12:12:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:43,641 INFO L93 Difference]: Finished difference Result 494 states and 576 transitions. [2018-11-23 12:12:43,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:12:43,642 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 89 [2018-11-23 12:12:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:12:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 349 transitions. [2018-11-23 12:12:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:12:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 349 transitions. [2018-11-23 12:12:43,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 349 transitions. [2018-11-23 12:12:43,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:43,972 INFO L225 Difference]: With dead ends: 494 [2018-11-23 12:12:43,972 INFO L226 Difference]: Without dead ends: 293 [2018-11-23 12:12:43,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:12:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-23 12:12:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-11-23 12:12:44,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:44,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand 291 states. [2018-11-23 12:12:44,103 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand 291 states. [2018-11-23 12:12:44,103 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 291 states. [2018-11-23 12:12:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:44,110 INFO L93 Difference]: Finished difference Result 293 states and 334 transitions. [2018-11-23 12:12:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 334 transitions. [2018-11-23 12:12:44,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:44,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:44,111 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 293 states. [2018-11-23 12:12:44,111 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 293 states. [2018-11-23 12:12:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:44,117 INFO L93 Difference]: Finished difference Result 293 states and 334 transitions. [2018-11-23 12:12:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 334 transitions. [2018-11-23 12:12:44,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:44,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:44,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:44,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-23 12:12:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 332 transitions. [2018-11-23 12:12:44,124 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 332 transitions. Word has length 89 [2018-11-23 12:12:44,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:44,124 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 332 transitions. [2018-11-23 12:12:44,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:12:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 332 transitions. [2018-11-23 12:12:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:12:44,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:44,125 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:44,125 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:44,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1749957847, now seen corresponding path program 39 times [2018-11-23 12:12:44,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:44,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:44,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:44,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:12:44,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:45,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {42861#true} call ULTIMATE.init(); {42861#true} is VALID [2018-11-23 12:12:45,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {42861#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42861#true} is VALID [2018-11-23 12:12:45,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {42861#true} assume true; {42861#true} is VALID [2018-11-23 12:12:45,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42861#true} {42861#true} #54#return; {42861#true} is VALID [2018-11-23 12:12:45,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {42861#true} call #t~ret3 := main(); {42861#true} is VALID [2018-11-23 12:12:45,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {42861#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {42863#(= main_~i~0 0)} is VALID [2018-11-23 12:12:45,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {42863#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42863#(= main_~i~0 0)} is VALID [2018-11-23 12:12:45,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {42863#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42864#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:45,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {42864#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42864#(<= main_~i~0 1)} is VALID [2018-11-23 12:12:45,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {42864#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42865#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:45,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {42865#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42865#(<= main_~i~0 2)} is VALID [2018-11-23 12:12:45,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {42865#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42866#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:45,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {42866#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42866#(<= main_~i~0 3)} is VALID [2018-11-23 12:12:45,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {42866#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42867#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:45,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {42867#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42867#(<= main_~i~0 4)} is VALID [2018-11-23 12:12:45,053 INFO L273 TraceCheckUtils]: 15: Hoare triple {42867#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42868#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:45,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {42868#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42868#(<= main_~i~0 5)} is VALID [2018-11-23 12:12:45,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {42868#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42869#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:45,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {42869#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42869#(<= main_~i~0 6)} is VALID [2018-11-23 12:12:45,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {42869#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42870#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:45,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {42870#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42870#(<= main_~i~0 7)} is VALID [2018-11-23 12:12:45,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {42870#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42871#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:45,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {42871#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42871#(<= main_~i~0 8)} is VALID [2018-11-23 12:12:45,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {42871#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42872#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:45,057 INFO L273 TraceCheckUtils]: 24: Hoare triple {42872#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42872#(<= main_~i~0 9)} is VALID [2018-11-23 12:12:45,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {42872#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42873#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:45,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {42873#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42873#(<= main_~i~0 10)} is VALID [2018-11-23 12:12:45,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {42873#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42874#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:45,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {42874#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42874#(<= main_~i~0 11)} is VALID [2018-11-23 12:12:45,060 INFO L273 TraceCheckUtils]: 29: Hoare triple {42874#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42875#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:45,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {42875#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42875#(<= main_~i~0 12)} is VALID [2018-11-23 12:12:45,061 INFO L273 TraceCheckUtils]: 31: Hoare triple {42875#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42876#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:45,061 INFO L273 TraceCheckUtils]: 32: Hoare triple {42876#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42876#(<= main_~i~0 13)} is VALID [2018-11-23 12:12:45,062 INFO L273 TraceCheckUtils]: 33: Hoare triple {42876#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42877#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:45,063 INFO L273 TraceCheckUtils]: 34: Hoare triple {42877#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42877#(<= main_~i~0 14)} is VALID [2018-11-23 12:12:45,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {42877#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42878#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:45,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {42878#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42878#(<= main_~i~0 15)} is VALID [2018-11-23 12:12:45,064 INFO L273 TraceCheckUtils]: 37: Hoare triple {42878#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42879#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:45,065 INFO L273 TraceCheckUtils]: 38: Hoare triple {42879#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42879#(<= main_~i~0 16)} is VALID [2018-11-23 12:12:45,066 INFO L273 TraceCheckUtils]: 39: Hoare triple {42879#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42880#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:45,066 INFO L273 TraceCheckUtils]: 40: Hoare triple {42880#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42880#(<= main_~i~0 17)} is VALID [2018-11-23 12:12:45,067 INFO L273 TraceCheckUtils]: 41: Hoare triple {42880#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42881#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:45,067 INFO L273 TraceCheckUtils]: 42: Hoare triple {42881#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42881#(<= main_~i~0 18)} is VALID [2018-11-23 12:12:45,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {42881#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42882#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:45,068 INFO L273 TraceCheckUtils]: 44: Hoare triple {42882#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42882#(<= main_~i~0 19)} is VALID [2018-11-23 12:12:45,069 INFO L273 TraceCheckUtils]: 45: Hoare triple {42882#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42883#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:45,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {42883#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42883#(<= main_~i~0 20)} is VALID [2018-11-23 12:12:45,070 INFO L273 TraceCheckUtils]: 47: Hoare triple {42883#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42884#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:45,071 INFO L273 TraceCheckUtils]: 48: Hoare triple {42884#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42884#(<= main_~i~0 21)} is VALID [2018-11-23 12:12:45,071 INFO L273 TraceCheckUtils]: 49: Hoare triple {42884#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42885#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:45,072 INFO L273 TraceCheckUtils]: 50: Hoare triple {42885#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42885#(<= main_~i~0 22)} is VALID [2018-11-23 12:12:45,073 INFO L273 TraceCheckUtils]: 51: Hoare triple {42885#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42886#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:45,073 INFO L273 TraceCheckUtils]: 52: Hoare triple {42886#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42886#(<= main_~i~0 23)} is VALID [2018-11-23 12:12:45,074 INFO L273 TraceCheckUtils]: 53: Hoare triple {42886#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42887#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:45,074 INFO L273 TraceCheckUtils]: 54: Hoare triple {42887#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42887#(<= main_~i~0 24)} is VALID [2018-11-23 12:12:45,075 INFO L273 TraceCheckUtils]: 55: Hoare triple {42887#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42888#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:45,075 INFO L273 TraceCheckUtils]: 56: Hoare triple {42888#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42888#(<= main_~i~0 25)} is VALID [2018-11-23 12:12:45,076 INFO L273 TraceCheckUtils]: 57: Hoare triple {42888#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42889#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:45,077 INFO L273 TraceCheckUtils]: 58: Hoare triple {42889#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42889#(<= main_~i~0 26)} is VALID [2018-11-23 12:12:45,077 INFO L273 TraceCheckUtils]: 59: Hoare triple {42889#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42890#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:45,078 INFO L273 TraceCheckUtils]: 60: Hoare triple {42890#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42890#(<= main_~i~0 27)} is VALID [2018-11-23 12:12:45,078 INFO L273 TraceCheckUtils]: 61: Hoare triple {42890#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42891#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:45,079 INFO L273 TraceCheckUtils]: 62: Hoare triple {42891#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42891#(<= main_~i~0 28)} is VALID [2018-11-23 12:12:45,080 INFO L273 TraceCheckUtils]: 63: Hoare triple {42891#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42892#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:45,080 INFO L273 TraceCheckUtils]: 64: Hoare triple {42892#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42892#(<= main_~i~0 29)} is VALID [2018-11-23 12:12:45,081 INFO L273 TraceCheckUtils]: 65: Hoare triple {42892#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42893#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:45,081 INFO L273 TraceCheckUtils]: 66: Hoare triple {42893#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42893#(<= main_~i~0 30)} is VALID [2018-11-23 12:12:45,082 INFO L273 TraceCheckUtils]: 67: Hoare triple {42893#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42894#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:45,082 INFO L273 TraceCheckUtils]: 68: Hoare triple {42894#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42894#(<= main_~i~0 31)} is VALID [2018-11-23 12:12:45,083 INFO L273 TraceCheckUtils]: 69: Hoare triple {42894#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42895#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:45,084 INFO L273 TraceCheckUtils]: 70: Hoare triple {42895#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42895#(<= main_~i~0 32)} is VALID [2018-11-23 12:12:45,084 INFO L273 TraceCheckUtils]: 71: Hoare triple {42895#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42896#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:45,085 INFO L273 TraceCheckUtils]: 72: Hoare triple {42896#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42896#(<= main_~i~0 33)} is VALID [2018-11-23 12:12:45,085 INFO L273 TraceCheckUtils]: 73: Hoare triple {42896#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42897#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:45,086 INFO L273 TraceCheckUtils]: 74: Hoare triple {42897#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42897#(<= main_~i~0 34)} is VALID [2018-11-23 12:12:45,087 INFO L273 TraceCheckUtils]: 75: Hoare triple {42897#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42898#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:45,087 INFO L273 TraceCheckUtils]: 76: Hoare triple {42898#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42898#(<= main_~i~0 35)} is VALID [2018-11-23 12:12:45,088 INFO L273 TraceCheckUtils]: 77: Hoare triple {42898#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42899#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:45,088 INFO L273 TraceCheckUtils]: 78: Hoare triple {42899#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42899#(<= main_~i~0 36)} is VALID [2018-11-23 12:12:45,089 INFO L273 TraceCheckUtils]: 79: Hoare triple {42899#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42900#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:45,089 INFO L273 TraceCheckUtils]: 80: Hoare triple {42900#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42900#(<= main_~i~0 37)} is VALID [2018-11-23 12:12:45,090 INFO L273 TraceCheckUtils]: 81: Hoare triple {42900#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42901#(<= main_~i~0 38)} is VALID [2018-11-23 12:12:45,091 INFO L273 TraceCheckUtils]: 82: Hoare triple {42901#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(10, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42901#(<= main_~i~0 38)} is VALID [2018-11-23 12:12:45,091 INFO L273 TraceCheckUtils]: 83: Hoare triple {42901#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {42902#(<= main_~i~0 39)} is VALID [2018-11-23 12:12:45,092 INFO L273 TraceCheckUtils]: 84: Hoare triple {42902#(<= main_~i~0 39)} assume !(~i~0 < 100000); {42862#false} is VALID [2018-11-23 12:12:45,092 INFO L273 TraceCheckUtils]: 85: Hoare triple {42862#false} ~i~0 := 0; {42862#false} is VALID [2018-11-23 12:12:45,092 INFO L273 TraceCheckUtils]: 86: Hoare triple {42862#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42862#false} is VALID [2018-11-23 12:12:45,092 INFO L256 TraceCheckUtils]: 87: Hoare triple {42862#false} call __VERIFIER_assert((if 10 == #t~mem2 then 1 else 0)); {42862#false} is VALID [2018-11-23 12:12:45,093 INFO L273 TraceCheckUtils]: 88: Hoare triple {42862#false} ~cond := #in~cond; {42862#false} is VALID [2018-11-23 12:12:45,093 INFO L273 TraceCheckUtils]: 89: Hoare triple {42862#false} assume 0 == ~cond; {42862#false} is VALID [2018-11-23 12:12:45,093 INFO L273 TraceCheckUtils]: 90: Hoare triple {42862#false} assume !false; {42862#false} is VALID [2018-11-23 12:12:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:12:45,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:45,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:12:45,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2