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/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:16:42,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:16:42,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:16:42,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:16:42,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:16:42,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:16:42,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:16:42,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:16:42,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:16:42,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:16:42,401 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:16:42,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:16:42,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:16:42,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:16:42,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:16:42,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:16:42,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:16:42,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:16:42,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:16:42,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:16:42,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:16:42,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:16:42,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:16:42,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:16:42,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:16:42,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:16:42,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:16:42,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:16:42,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:16:42,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:16:42,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:16:42,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:16:42,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:16:42,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:16:42,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:16:42,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:16:42,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:16:42,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:16:42,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:16:42,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:16:42,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:16:42,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:16:42,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:16:42,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:16:42,485 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:16:42,486 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:16:42,486 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl [2019-08-05 10:16:42,487 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl' [2019-08-05 10:16:42,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:16:42,553 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:16:42,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:42,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:16:42,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:16:42,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/1) ... [2019-08-05 10:16:42,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/1) ... [2019-08-05 10:16:42,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:42,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:16:42,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:16:42,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:16:42,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/1) ... [2019-08-05 10:16:42,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/1) ... [2019-08-05 10:16:42,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/1) ... [2019-08-05 10:16:42,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/1) ... [2019-08-05 10:16:42,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/1) ... [2019-08-05 10:16:42,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/1) ... [2019-08-05 10:16:42,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/1) ... [2019-08-05 10:16:42,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:16:42,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:16:42,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:16:42,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:16:42,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (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 10:16:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:16:42,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:16:43,517 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:16:43,772 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:16:43,772 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:16:43,774 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:43 BoogieIcfgContainer [2019-08-05 10:16:43,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:16:43,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:16:43,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:16:43,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:16:43,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:42" (1/2) ... [2019-08-05 10:16:43,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530435a3 and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:16:43, skipping insertion in model container [2019-08-05 10:16:43,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:43" (2/2) ... [2019-08-05 10:16:43,785 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2019-08-05 10:16:43,795 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:16:43,803 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:16:43,820 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:16:43,848 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:16:43,849 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:16:43,849 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:16:43,849 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:16:43,849 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:16:43,849 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:16:43,850 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:16:43,850 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:16:43,850 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:16:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-08-05 10:16:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:16:43,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:43,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:43,877 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2019-08-05 10:16:43,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:44,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:44,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:44,105 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 10:16:44,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:44,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:16:44,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:44,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:44,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:44,129 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-08-05 10:16:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:44,266 INFO L93 Difference]: Finished difference Result 25 states and 37 transitions. [2019-08-05 10:16:44,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:44,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 10:16:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:44,283 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:16:44,283 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:16:44,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 10:16:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:16:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:16:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:16:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2019-08-05 10:16:44,319 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 10 [2019-08-05 10:16:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:44,319 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2019-08-05 10:16:44,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2019-08-05 10:16:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:16:44,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:44,321 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:44,321 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash 15529573, now seen corresponding path program 1 times [2019-08-05 10:16:44,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:44,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:44,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:44,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:44,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:44,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:44,420 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 3 states. [2019-08-05 10:16:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:44,720 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2019-08-05 10:16:44,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:44,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:16:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:44,722 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:16:44,722 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:16:44,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 10:16:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:16:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:16:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:16:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2019-08-05 10:16:44,729 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 14 [2019-08-05 10:16:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:44,730 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2019-08-05 10:16:44,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2019-08-05 10:16:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:16:44,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:44,731 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:44,732 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1956022969, now seen corresponding path program 1 times [2019-08-05 10:16:44,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:44,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:44,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:16:44,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:44,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:44,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:44,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:44,800 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand 3 states. [2019-08-05 10:16:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:45,107 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2019-08-05 10:16:45,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:45,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:16:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:45,112 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:16:45,112 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:16:45,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 10:16:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:16:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:16:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:16:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-08-05 10:16:45,125 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 19 [2019-08-05 10:16:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:45,126 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-08-05 10:16:45,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2019-08-05 10:16:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:16:45,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:45,128 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:45,130 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash -300028270, now seen corresponding path program 1 times [2019-08-05 10:16:45,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:45,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:45,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:16:45,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:45,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:45,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:45,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:45,234 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand 3 states. [2019-08-05 10:16:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:45,382 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-08-05 10:16:45,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:45,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:16:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:45,385 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:16:45,385 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:16:45,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 10:16:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:16:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:16:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:16:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-08-05 10:16:45,391 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 25 [2019-08-05 10:16:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:45,392 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-08-05 10:16:45,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-08-05 10:16:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:16:45,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:45,393 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:45,394 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash 119072766, now seen corresponding path program 1 times [2019-08-05 10:16:45,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:45,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:16:45,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:45,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:16:45,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:45,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:16:45,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:16:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:16:45,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:45,522 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 5 states. [2019-08-05 10:16:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:45,704 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2019-08-05 10:16:45,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:45,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-08-05 10:16:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:45,707 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:16:45,707 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:16:45,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:16:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:16:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:16:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2019-08-05 10:16:45,715 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 32 [2019-08-05 10:16:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:45,715 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2019-08-05 10:16:45,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:16:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2019-08-05 10:16:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:16:45,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:45,717 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:45,717 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:45,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2031998631, now seen corresponding path program 2 times [2019-08-05 10:16:45,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:45,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:45,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 10:16:45,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:45,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:45,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:45,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:45,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:45,823 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand 3 states. [2019-08-05 10:16:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,014 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2019-08-05 10:16:46,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:46,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-08-05 10:16:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,018 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:16:46,018 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:16:46,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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 10:16:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:16:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-08-05 10:16:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:16:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-08-05 10:16:46,027 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 45 [2019-08-05 10:16:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,028 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-08-05 10:16:46,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-08-05 10:16:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:16:46,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,030 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:46,030 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash 248350197, now seen corresponding path program 1 times [2019-08-05 10:16:46,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:16:46,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:46,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:46,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:46,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:46,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:46,100 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 3 states. [2019-08-05 10:16:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,444 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2019-08-05 10:16:46,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:46,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-08-05 10:16:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,447 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:16:46,447 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:16:46,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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 10:16:46,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:16:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2019-08-05 10:16:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:16:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2019-08-05 10:16:46,481 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 51 [2019-08-05 10:16:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,481 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2019-08-05 10:16:46,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2019-08-05 10:16:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:16:46,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,489 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:46,489 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash -823167015, now seen corresponding path program 1 times [2019-08-05 10:16:46,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:16:46,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:46,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:46,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:46,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:46,605 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand 3 states. [2019-08-05 10:16:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:46,682 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2019-08-05 10:16:46,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:46,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-08-05 10:16:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:46,684 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:16:46,684 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:16:46,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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 10:16:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:16:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:16:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:16:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2019-08-05 10:16:46,696 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 58 [2019-08-05 10:16:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:46,696 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2019-08-05 10:16:46,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2019-08-05 10:16:46,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:16:46,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:46,698 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 7, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:46,698 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:46,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:46,699 INFO L82 PathProgramCache]: Analyzing trace with hash -689843027, now seen corresponding path program 1 times [2019-08-05 10:16:46,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:46,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:46,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-05 10:16:46,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:46,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:46,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:46,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:46,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:46,823 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand 3 states. [2019-08-05 10:16:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,121 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2019-08-05 10:16:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:47,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:16:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,123 INFO L225 Difference]: With dead ends: 163 [2019-08-05 10:16:47,123 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:16:47,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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 10:16:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:16:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2019-08-05 10:16:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:16:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 173 transitions. [2019-08-05 10:16:47,133 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 173 transitions. Word has length 60 [2019-08-05 10:16:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,133 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 173 transitions. [2019-08-05 10:16:47,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 173 transitions. [2019-08-05 10:16:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:16:47,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,135 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:47,136 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash -840979935, now seen corresponding path program 1 times [2019-08-05 10:16:47,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-05 10:16:47,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:47,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:47,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:47,196 INFO L87 Difference]: Start difference. First operand 142 states and 173 transitions. Second operand 3 states. [2019-08-05 10:16:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,291 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2019-08-05 10:16:47,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:47,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-08-05 10:16:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,295 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:16:47,295 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:16:47,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 10:16:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:16:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-08-05 10:16:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:16:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 191 transitions. [2019-08-05 10:16:47,301 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 191 transitions. Word has length 67 [2019-08-05 10:16:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,301 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 191 transitions. [2019-08-05 10:16:47,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 191 transitions. [2019-08-05 10:16:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:16:47,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,303 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:47,303 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1586174281, now seen corresponding path program 1 times [2019-08-05 10:16:47,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-08-05 10:16:47,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:47,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:47,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:47,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:47,391 INFO L87 Difference]: Start difference. First operand 160 states and 191 transitions. Second operand 3 states. [2019-08-05 10:16:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,529 INFO L93 Difference]: Finished difference Result 175 states and 210 transitions. [2019-08-05 10:16:47,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:47,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-08-05 10:16:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,532 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:16:47,532 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:16:47,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 10:16:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:16:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 162. [2019-08-05 10:16:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:16:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 191 transitions. [2019-08-05 10:16:47,538 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 191 transitions. Word has length 69 [2019-08-05 10:16:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,538 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 191 transitions. [2019-08-05 10:16:47,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 191 transitions. [2019-08-05 10:16:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:16:47,542 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,542 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:47,543 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1809848535, now seen corresponding path program 1 times [2019-08-05 10:16:47,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:47,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:47,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:47,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:47,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:47,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:47,668 INFO L87 Difference]: Start difference. First operand 162 states and 191 transitions. Second operand 4 states. [2019-08-05 10:16:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,806 INFO L93 Difference]: Finished difference Result 205 states and 234 transitions. [2019-08-05 10:16:47,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:16:47,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-08-05 10:16:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,809 INFO L225 Difference]: With dead ends: 205 [2019-08-05 10:16:47,809 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 10:16:47,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 10:16:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2019-08-05 10:16:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-05 10:16:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 228 transitions. [2019-08-05 10:16:47,816 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 228 transitions. Word has length 76 [2019-08-05 10:16:47,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,817 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 228 transitions. [2019-08-05 10:16:47,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 228 transitions. [2019-08-05 10:16:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:16:47,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,818 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:47,819 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1729106847, now seen corresponding path program 2 times [2019-08-05 10:16:47,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:48,371 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-08-05 10:16:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 238 proven. 22 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:48,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:16:48,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:16:48,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:16:48,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:48,490 INFO L87 Difference]: Start difference. First operand 199 states and 228 transitions. Second operand 5 states. [2019-08-05 10:16:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:48,807 INFO L93 Difference]: Finished difference Result 235 states and 264 transitions. [2019-08-05 10:16:48,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:48,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-08-05 10:16:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:48,809 INFO L225 Difference]: With dead ends: 235 [2019-08-05 10:16:48,809 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 10:16:48,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 10:16:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2019-08-05 10:16:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-08-05 10:16:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2019-08-05 10:16:48,814 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 86 [2019-08-05 10:16:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:48,815 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2019-08-05 10:16:48,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:16:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2019-08-05 10:16:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:16:48,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:48,816 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:48,816 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1042523285, now seen corresponding path program 3 times [2019-08-05 10:16:48,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:48,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:16:48,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:49,359 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-08-05 10:16:49,547 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-08-05 10:16:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 294 proven. 48 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:49,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:49,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:16:49,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:16:49,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:16:49,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:49,700 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand 6 states. [2019-08-05 10:16:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:50,692 INFO L93 Difference]: Finished difference Result 265 states and 294 transitions. [2019-08-05 10:16:50,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:16:50,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-08-05 10:16:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:50,695 INFO L225 Difference]: With dead ends: 265 [2019-08-05 10:16:50,695 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 10:16:50,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 10:16:50,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2019-08-05 10:16:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-05 10:16:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 288 transitions. [2019-08-05 10:16:50,701 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 288 transitions. Word has length 96 [2019-08-05 10:16:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:50,702 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 288 transitions. [2019-08-05 10:16:50,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:16:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 288 transitions. [2019-08-05 10:16:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:16:50,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:50,703 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:50,704 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1371994635, now seen corresponding path program 4 times [2019-08-05 10:16:50,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:50,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:16:50,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:51,147 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:16:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 350 proven. 84 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:51,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:51,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:16:51,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:16:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:16:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:51,334 INFO L87 Difference]: Start difference. First operand 259 states and 288 transitions. Second operand 7 states. [2019-08-05 10:16:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:51,941 INFO L93 Difference]: Finished difference Result 180 states and 187 transitions. [2019-08-05 10:16:51,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:16:51,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-08-05 10:16:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:51,942 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:16:51,942 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:16:51,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:16:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:16:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:16:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:16:51,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-08-05 10:16:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:51,945 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:16:51,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:16:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:16:51,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:16:51,950 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:16:51 BoogieIcfgContainer [2019-08-05 10:16:51,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:16:51,952 INFO L168 Benchmark]: Toolchain (without parser) took 9399.23 ms. Allocated memory was 138.9 MB in the beginning and 240.6 MB in the end (delta: 101.7 MB). Free memory was 107.1 MB in the beginning and 111.6 MB in the end (delta: -4.5 MB). Peak memory consumption was 97.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:51,953 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:16:51,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.68 ms. Allocated memory is still 138.9 MB. Free memory was 106.8 MB in the beginning and 105.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:51,955 INFO L168 Benchmark]: Boogie Preprocessor took 54.34 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 103.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:51,956 INFO L168 Benchmark]: RCFGBuilder took 1114.40 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 67.4 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:51,957 INFO L168 Benchmark]: TraceAbstraction took 8174.80 ms. Allocated memory was 138.9 MB in the beginning and 240.6 MB in the end (delta: 101.7 MB). Free memory was 67.2 MB in the beginning and 111.6 MB in the end (delta: -44.4 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:51,961 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.68 ms. Allocated memory is still 138.9 MB. Free memory was 106.8 MB in the beginning and 105.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.34 ms. Allocated memory is still 138.9 MB. Free memory was 105.1 MB in the beginning and 103.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1114.40 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 67.4 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8174.80 ms. Allocated memory was 138.9 MB in the beginning and 240.6 MB in the end (delta: 101.7 MB). Free memory was 67.2 MB in the beginning and 111.6 MB in the end (delta: -44.4 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 8.1s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 74 SDslu, 170 SDs, 0 SdLazy, 996 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=14, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 64 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 814 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 799 ConstructedInterpolants, 0 QuantifiedInterpolants, 292007 SizeOfPredicates, 56 NumberOfNonLiveVariables, 4630 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 2629/2808 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...