java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/Backtranslation/regression/bpl/SpecificationsInvariant.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:52:16,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:52:16,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:52:16,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:52:16,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:52:16,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:52:16,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:52:16,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:52:16,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:52:16,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:52:16,163 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:52:16,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:52:16,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:52:16,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:52:16,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:52:16,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:52:16,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:52:16,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:52:16,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:52:16,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:52:16,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:52:16,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:52:16,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:52:16,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:52:16,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:52:16,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:52:16,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:52:16,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:52:16,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:52:16,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:52:16,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:52:16,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:52:16,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:52:16,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:52:16,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:52:16,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:52:16,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:52:16,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:52:16,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:52:16,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:52:16,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:52:16,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:52:16,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:52:16,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:52:16,268 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:52:16,269 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:52:16,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Backtranslation/regression/bpl/SpecificationsInvariant.bpl [2019-08-05 09:52:16,270 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Backtranslation/regression/bpl/SpecificationsInvariant.bpl' [2019-08-05 09:52:16,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:52:16,307 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:52:16,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:16,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:52:16,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:52:16,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/1) ... [2019-08-05 09:52:16,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/1) ... [2019-08-05 09:52:16,343 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 09:52:16,344 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 09:52:16,344 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 09:52:16,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:16,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:52:16,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:52:16,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:52:16,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/1) ... [2019-08-05 09:52:16,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/1) ... [2019-08-05 09:52:16,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/1) ... [2019-08-05 09:52:16,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/1) ... [2019-08-05 09:52:16,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/1) ... [2019-08-05 09:52:16,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/1) ... [2019-08-05 09:52:16,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/1) ... [2019-08-05 09:52:16,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:52:16,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:52:16,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:52:16,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:52:16,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 09:52:16,463 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Main given in one single declaration [2019-08-05 09:52:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 09:52:16,464 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 09:52:16,465 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2019-08-05 09:52:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2019-08-05 09:52:16,465 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2019-08-05 09:52:16,786 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 09:52:16,956 INFO L275 CfgBuilder]: Using library mode [2019-08-05 09:52:16,956 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 09:52:16,958 INFO L202 PluginConnector]: Adding new model SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:16 BoogieIcfgContainer [2019-08-05 09:52:16,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:52:16,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:52:16,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:52:16,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:52:16,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:16" (1/2) ... [2019-08-05 09:52:16,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7935ff3a and model type SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:52:16, skipping insertion in model container [2019-08-05 09:52:16,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:16" (2/2) ... [2019-08-05 09:52:16,966 INFO L109 eAbstractionObserver]: Analyzing ICFG SpecificationsInvariant.bpl [2019-08-05 09:52:16,975 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:52:16,982 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-08-05 09:52:16,996 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-08-05 09:52:17,021 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:52:17,022 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:52:17,022 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:52:17,023 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:52:17,023 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:52:17,023 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:52:17,023 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:52:17,023 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:52:17,023 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:52:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-08-05 09:52:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 09:52:17,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:17,048 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 09:52:17,051 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:17,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1942, now seen corresponding path program 1 times [2019-08-05 09:52:17,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:17,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:17,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:17,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:17,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 09:52:17,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:17,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:17,186 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-08-05 09:52:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:17,251 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 09:52:17,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:17,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 09:52:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:17,264 INFO L225 Difference]: With dead ends: 21 [2019-08-05 09:52:17,265 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 09:52:17,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 09:52:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 09:52:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 09:52:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 09:52:17,301 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 2 [2019-08-05 09:52:17,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:17,302 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 09:52:17,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 09:52:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 09:52:17,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:17,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 09:52:17,304 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:17,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:17,304 INFO L82 PathProgramCache]: Analyzing trace with hash 962, now seen corresponding path program 1 times [2019-08-05 09:52:17,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:17,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:17,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:17,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:17,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 09:52:17,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:17,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:17,359 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 3 states. [2019-08-05 09:52:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:17,389 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 09:52:17,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:17,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 09:52:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:17,391 INFO L225 Difference]: With dead ends: 18 [2019-08-05 09:52:17,391 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 09:52:17,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 09:52:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 09:52:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 09:52:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 09:52:17,397 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 2 [2019-08-05 09:52:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:17,397 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 09:52:17,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 09:52:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 09:52:17,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:17,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 09:52:17,399 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-08-05 09:52:17,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:17,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:17,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:17,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:17,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 09:52:17,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:17,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:17,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:17,424 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2019-08-05 09:52:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:17,454 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 09:52:17,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:17,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 09:52:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:17,456 INFO L225 Difference]: With dead ends: 20 [2019-08-05 09:52:17,457 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 09:52:17,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 09:52:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 09:52:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 09:52:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 09:52:17,463 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 3 [2019-08-05 09:52:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:17,464 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 09:52:17,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 09:52:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 09:52:17,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:17,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 09:52:17,465 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:17,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1867987, now seen corresponding path program 1 times [2019-08-05 09:52:17,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:17,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:17,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:17,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:17,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 09:52:17,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:17,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:17,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:17,503 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2019-08-05 09:52:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:17,557 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 09:52:17,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:17,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 09:52:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:17,559 INFO L225 Difference]: With dead ends: 22 [2019-08-05 09:52:17,559 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 09:52:17,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 09:52:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 09:52:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 09:52:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 09:52:17,563 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 4 [2019-08-05 09:52:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:17,563 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 09:52:17,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 09:52:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 09:52:17,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:17,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 09:52:17,565 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:17,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:17,565 INFO L82 PathProgramCache]: Analyzing trace with hash 28693790, now seen corresponding path program 1 times [2019-08-05 09:52:17,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:17,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:17,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:17,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:17,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 09:52:17,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:17,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:17,646 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 4 states. [2019-08-05 09:52:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:17,697 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 09:52:17,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:17,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 09:52:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:17,699 INFO L225 Difference]: With dead ends: 24 [2019-08-05 09:52:17,699 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 09:52:17,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 09:52:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 09:52:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 09:52:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 09:52:17,704 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 5 [2019-08-05 09:52:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:17,704 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 09:52:17,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 09:52:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 09:52:17,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:17,705 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1] [2019-08-05 09:52:17,705 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1795137232, now seen corresponding path program 2 times [2019-08-05 09:52:17,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:17,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 09:52:17,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:17,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:17,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 09:52:17,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:52:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:52:17,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:17,796 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 5 states. [2019-08-05 09:52:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:17,964 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 09:52:17,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:52:17,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 09:52:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:17,965 INFO L225 Difference]: With dead ends: 26 [2019-08-05 09:52:17,965 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 09:52:17,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 09:52:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 09:52:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 09:52:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 09:52:17,970 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 6 [2019-08-05 09:52:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:17,970 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 09:52:17,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:52:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 09:52:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 09:52:17,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:17,971 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 09:52:17,972 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1804929627, now seen corresponding path program 2 times [2019-08-05 09:52:17,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:17,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 09:52:17,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:18,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:18,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 09:52:18,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:52:18,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:52:18,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:18,064 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 5 states. [2019-08-05 09:52:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:18,220 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 09:52:18,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:52:18,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 09:52:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:18,221 INFO L225 Difference]: With dead ends: 28 [2019-08-05 09:52:18,221 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 09:52:18,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 09:52:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 09:52:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 09:52:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 09:52:18,226 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 7 [2019-08-05 09:52:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:18,226 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 09:52:18,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:52:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 09:52:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 09:52:18,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:18,227 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1] [2019-08-05 09:52:18,227 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1449971315, now seen corresponding path program 3 times [2019-08-05 09:52:18,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:18,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 09:52:18,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:18,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:18,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 09:52:18,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 09:52:18,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 09:52:18,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:18,343 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 6 states. [2019-08-05 09:52:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:18,386 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 09:52:18,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 09:52:18,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 09:52:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:18,387 INFO L225 Difference]: With dead ends: 26 [2019-08-05 09:52:18,388 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 09:52:18,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 09:52:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 09:52:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 09:52:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 09:52:18,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 8 [2019-08-05 09:52:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:18,392 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 09:52:18,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 09:52:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 09:52:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 09:52:18,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:18,393 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-05 09:52:18,394 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:18,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash -629414824, now seen corresponding path program 3 times [2019-08-05 09:52:18,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:18,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 09:52:18,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:18,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:18,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 09:52:18,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 09:52:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 09:52:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:18,527 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 6 states. [2019-08-05 09:52:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:18,634 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 09:52:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 09:52:18,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 09:52:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:18,635 INFO L225 Difference]: With dead ends: 23 [2019-08-05 09:52:18,635 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 09:52:18,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 09:52:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 09:52:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 09:52:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 09:52:18,639 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 9 [2019-08-05 09:52:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:18,639 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 09:52:18,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 09:52:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 09:52:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 09:52:18,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:18,640 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1] [2019-08-05 09:52:18,640 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr1ASSERT_VIOLATIONINVARIANTandASSERT, MainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, MainErr2ASSERT_VIOLATIONPOST_CONDITIONandASSERT, MainErr3ASSERT_VIOLATIONPOST_CONDITIONandASSERT, incErr0ASSERT_VIOLATIONINVARIANTandASSERT, incErr1ENSURES_VIOLATIONPOST_CONDITION, incErr2ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 09:52:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1853028086, now seen corresponding path program 4 times [2019-08-05 09:52:18,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 09:52:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 09:52:18,684 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 09:52:18,700 INFO L202 PluginConnector]: Adding new model SpecificationsInvariant.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:52:18 BoogieIcfgContainer [2019-08-05 09:52:18,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:52:18,703 INFO L168 Benchmark]: Toolchain (without parser) took 2395.28 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 110.7 MB in the beginning and 110.3 MB in the end (delta: 383.8 kB). Peak memory consumption was 38.1 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:18,704 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 09:52:18,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.98 ms. Allocated memory is still 133.2 MB. Free memory was 110.7 MB in the beginning and 108.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:18,706 INFO L168 Benchmark]: Boogie Preprocessor took 25.29 ms. Allocated memory is still 133.2 MB. Free memory was 108.5 MB in the beginning and 107.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:18,707 INFO L168 Benchmark]: RCFGBuilder took 571.31 ms. Allocated memory is still 133.2 MB. Free memory was 107.2 MB in the beginning and 95.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:18,708 INFO L168 Benchmark]: TraceAbstraction took 1741.26 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 95.4 MB in the beginning and 110.3 MB in the end (delta: -14.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:18,712 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.98 ms. Allocated memory is still 133.2 MB. Free memory was 110.7 MB in the beginning and 108.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.29 ms. Allocated memory is still 133.2 MB. Free memory was 108.5 MB in the beginning and 107.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 571.31 ms. Allocated memory is still 133.2 MB. Free memory was 107.2 MB in the beginning and 95.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1741.26 ms. Allocated memory was 133.2 MB in the beginning and 170.9 MB in the end (delta: 37.7 MB). Free memory was 95.4 MB in the beginning and 110.3 MB in the end (delta: -14.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: loop invariant can be violated and assertion can be violated loop invariant can be violated and assertion can be violated We found a FailurePath: [L2-L3] requires x > 0; [L8] y := 4; VAL [x=1, y=4] [L10] invariant y > 0; VAL [x=1, y=4] [L9] COND TRUE y > 0 [L12] res := res + x; [L13] y := y - 1; VAL [res=-3, x=1, y=3] [L10] invariant y > 0; VAL [res=-3, x=1, y=3] [L9] COND TRUE y > 0 [L12] res := res + x; [L13] y := y - 1; VAL [res=-2, x=1, y=2] [L10] invariant y > 0; VAL [res=-2, x=1, y=2] [L9] COND TRUE y > 0 [L12] res := res + x; [L13] y := y - 1; VAL [res=-1, x=1, y=1] [L10] invariant y > 0; VAL [res=-1, x=1, y=1] [L9] COND TRUE y > 0 [L12] res := res + x; [L13] y := y - 1; VAL [res=0, x=1, y=0] [L10] invariant y > 0; VAL [res=0, x=1, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 7 error locations. UNSAFE Result, 1.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 28 SDslu, 137 SDs, 0 SdLazy, 81 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 575 SizeOfPredicates, 1 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 0/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...