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_srvr_3.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:25,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:25,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:25,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:25,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:25,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:25,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:25,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:25,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:25,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:25,433 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:25,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:25,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:25,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:25,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:25,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:25,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:25,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:25,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:25,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:25,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:25,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:25,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:25,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:25,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:25,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:25,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:25,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:25,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:25,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:25,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:25,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:25,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:25,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:25,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:25,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:25,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:25,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:25,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:25,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:25,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:25,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:25,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:25,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:25,533 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:25,533 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:25,534 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl [2019-08-04 21:38:25,534 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl' [2019-08-04 21:38:25,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:25,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:25,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:25,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:25,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:25,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/1) ... [2019-08-04 21:38:25,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/1) ... [2019-08-04 21:38:25,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:25,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:25,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:25,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:25,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/1) ... [2019-08-04 21:38:25,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/1) ... [2019-08-04 21:38:25,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/1) ... [2019-08-04 21:38:25,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/1) ... [2019-08-04 21:38:25,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/1) ... [2019-08-04 21:38:25,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/1) ... [2019-08-04 21:38:25,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/1) ... [2019-08-04 21:38:25,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:25,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:25,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:25,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:25,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (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-04 21:38:25,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:25,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:26,510 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:26,510 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:38:26,512 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:26 BoogieIcfgContainer [2019-08-04 21:38:26,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:26,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:26,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:26,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:26,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:25" (1/2) ... [2019-08-04 21:38:26,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b2d9b4 and model type s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:26, skipping insertion in model container [2019-08-04 21:38:26,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:26" (2/2) ... [2019-08-04 21:38:26,520 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c_20.bpl [2019-08-04 21:38:26,529 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:26,538 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:26,554 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:26,578 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:26,579 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:26,579 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:26,580 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:26,580 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:26,580 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:26,580 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:26,581 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:26,581 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-08-04 21:38:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:38:26,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:26,603 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:26,605 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:26,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2019-08-04 21:38:26,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:26,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:26,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:26,778 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-04 21:38:26,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:26,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:26,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:26,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:26,805 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-08-04 21:38:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:26,938 INFO L93 Difference]: Finished difference Result 31 states and 52 transitions. [2019-08-04 21:38:26,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:26,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-08-04 21:38:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:26,953 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:38:26,953 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:38:26,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-04 21:38:26,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:38:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:38:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:38:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 52 transitions. [2019-08-04 21:38:26,995 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 52 transitions. Word has length 15 [2019-08-04 21:38:26,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:26,998 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 52 transitions. [2019-08-04 21:38:26,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 52 transitions. [2019-08-04 21:38:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:38:26,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:26,999 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:27,000 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash 994659063, now seen corresponding path program 1 times [2019-08-04 21:38:27,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:27,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:27,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:27,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:27,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:27,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:27,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:27,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:27,107 INFO L87 Difference]: Start difference. First operand 31 states and 52 transitions. Second operand 3 states. [2019-08-04 21:38:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:27,327 INFO L93 Difference]: Finished difference Result 35 states and 56 transitions. [2019-08-04 21:38:27,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:27,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-08-04 21:38:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:27,330 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:38:27,330 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:38:27,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-04 21:38:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:38:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:38:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:38:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2019-08-04 21:38:27,339 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 18 [2019-08-04 21:38:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:27,340 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-08-04 21:38:27,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2019-08-04 21:38:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:38:27,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:27,341 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:27,341 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:27,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1054659463, now seen corresponding path program 1 times [2019-08-04 21:38:27,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:27,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:27,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-04 21:38:27,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:27,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:27,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:27,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:27,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:27,430 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 3 states. [2019-08-04 21:38:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:27,586 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2019-08-04 21:38:27,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:27,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-04 21:38:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:27,588 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:38:27,588 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:38:27,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-04 21:38:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:38:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:38:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:38:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2019-08-04 21:38:27,600 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 22 [2019-08-04 21:38:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:27,600 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2019-08-04 21:38:27,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2019-08-04 21:38:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:38:27,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:27,603 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:27,603 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:27,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1471998087, now seen corresponding path program 1 times [2019-08-04 21:38:27,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:27,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:27,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-04 21:38:27,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:27,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:27,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:27,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:27,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:27,727 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand 3 states. [2019-08-04 21:38:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:27,833 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2019-08-04 21:38:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:27,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-04 21:38:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:27,835 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:38:27,836 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:38:27,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-04 21:38:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:38:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:38:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:38:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2019-08-04 21:38:27,843 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 27 [2019-08-04 21:38:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:27,844 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-08-04 21:38:27,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2019-08-04 21:38:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:38:27,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:27,846 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:27,846 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:27,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1270422339, now seen corresponding path program 1 times [2019-08-04 21:38:27,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:27,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:27,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-04 21:38:27,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:27,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:27,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:27,947 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand 3 states. [2019-08-04 21:38:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:28,215 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2019-08-04 21:38:28,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:28,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-08-04 21:38:28,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:28,217 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:38:28,218 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:38:28,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-04 21:38:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:38:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:38:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:38:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-08-04 21:38:28,228 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 33 [2019-08-04 21:38:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:28,229 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-08-04 21:38:28,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-08-04 21:38:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:38:28,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:28,231 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:28,231 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:28,233 INFO L82 PathProgramCache]: Analyzing trace with hash -983630985, now seen corresponding path program 1 times [2019-08-04 21:38:28,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:28,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:28,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-04 21:38:28,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:28,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:28,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:28,384 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 3 states. [2019-08-04 21:38:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:28,542 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2019-08-04 21:38:28,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:28,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-08-04 21:38:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:28,549 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:38:28,550 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:38:28,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-04 21:38:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:38:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:38:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:38:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2019-08-04 21:38:28,568 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 40 [2019-08-04 21:38:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:28,568 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2019-08-04 21:38:28,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2019-08-04 21:38:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:38:28,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:28,570 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:28,571 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:28,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:28,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2019-08-04 21:38:28,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:28,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:28,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-04 21:38:28,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:28,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:28,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:28,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:28,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:28,742 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 4 states. [2019-08-04 21:38:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:29,332 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2019-08-04 21:38:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:29,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-08-04 21:38:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:29,337 INFO L225 Difference]: With dead ends: 169 [2019-08-04 21:38:29,337 INFO L226 Difference]: Without dead ends: 157 [2019-08-04 21:38:29,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-04 21:38:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 121. [2019-08-04 21:38:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-04 21:38:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2019-08-04 21:38:29,347 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 48 [2019-08-04 21:38:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:29,348 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2019-08-04 21:38:29,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2019-08-04 21:38:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:38:29,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,350 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:29,351 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1913328135, now seen corresponding path program 1 times [2019-08-04 21:38:29,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:29,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:29,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-04 21:38:29,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:29,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:29,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:29,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:29,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:29,447 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand 3 states. [2019-08-04 21:38:29,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:29,552 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2019-08-04 21:38:29,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:29,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-08-04 21:38:29,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:29,554 INFO L225 Difference]: With dead ends: 151 [2019-08-04 21:38:29,555 INFO L226 Difference]: Without dead ends: 151 [2019-08-04 21:38:29,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-04 21:38:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-04 21:38:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-04 21:38:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-04 21:38:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 198 transitions. [2019-08-04 21:38:29,567 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 198 transitions. Word has length 57 [2019-08-04 21:38:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:29,567 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 198 transitions. [2019-08-04 21:38:29,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2019-08-04 21:38:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:38:29,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,570 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:29,570 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1816080585, now seen corresponding path program 1 times [2019-08-04 21:38:29,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:29,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:29,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-08-04 21:38:29,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:29,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:29,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:29,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:29,653 INFO L87 Difference]: Start difference. First operand 151 states and 198 transitions. Second operand 3 states. [2019-08-04 21:38:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:29,781 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2019-08-04 21:38:29,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:29,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-08-04 21:38:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:29,784 INFO L225 Difference]: With dead ends: 184 [2019-08-04 21:38:29,784 INFO L226 Difference]: Without dead ends: 184 [2019-08-04 21:38:29,784 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-04 21:38:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-04 21:38:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-04 21:38:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-04 21:38:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 231 transitions. [2019-08-04 21:38:29,793 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 231 transitions. Word has length 67 [2019-08-04 21:38:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:29,793 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 231 transitions. [2019-08-04 21:38:29,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 231 transitions. [2019-08-04 21:38:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:38:29,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,796 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:29,796 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:29,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1256666615, now seen corresponding path program 1 times [2019-08-04 21:38:29,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:29,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:29,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-08-04 21:38:29,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:29,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:29,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:29,871 INFO L87 Difference]: Start difference. First operand 184 states and 231 transitions. Second operand 3 states. [2019-08-04 21:38:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:29,983 INFO L93 Difference]: Finished difference Result 220 states and 267 transitions. [2019-08-04 21:38:29,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:29,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-08-04 21:38:29,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:29,986 INFO L225 Difference]: With dead ends: 220 [2019-08-04 21:38:29,986 INFO L226 Difference]: Without dead ends: 220 [2019-08-04 21:38:29,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-04 21:38:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-08-04 21:38:29,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-08-04 21:38:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-04 21:38:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 267 transitions. [2019-08-04 21:38:29,995 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 267 transitions. Word has length 78 [2019-08-04 21:38:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:29,996 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 267 transitions. [2019-08-04 21:38:29,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 267 transitions. [2019-08-04 21:38:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-04 21:38:29,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:29,999 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:29,999 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1673954584, now seen corresponding path program 1 times [2019-08-04 21:38:30,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-08-04 21:38:30,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:30,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:30,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:30,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:30,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:30,108 INFO L87 Difference]: Start difference. First operand 220 states and 267 transitions. Second operand 3 states. [2019-08-04 21:38:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,254 INFO L93 Difference]: Finished difference Result 259 states and 334 transitions. [2019-08-04 21:38:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:30,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-08-04 21:38:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,260 INFO L225 Difference]: With dead ends: 259 [2019-08-04 21:38:30,260 INFO L226 Difference]: Without dead ends: 259 [2019-08-04 21:38:30,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 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-04 21:38:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-08-04 21:38:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-08-04 21:38:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-04 21:38:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 334 transitions. [2019-08-04 21:38:30,269 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 334 transitions. Word has length 90 [2019-08-04 21:38:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,269 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 334 transitions. [2019-08-04 21:38:30,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 334 transitions. [2019-08-04 21:38:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-04 21:38:30,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,274 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:30,274 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1439385072, now seen corresponding path program 1 times [2019-08-04 21:38:30,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:30,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-04 21:38:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-08-04 21:38:30,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:30,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:30,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:30,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:30,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:30,556 INFO L87 Difference]: Start difference. First operand 259 states and 334 transitions. Second operand 4 states. [2019-08-04 21:38:30,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,658 INFO L93 Difference]: Finished difference Result 412 states and 520 transitions. [2019-08-04 21:38:30,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:30,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-08-04 21:38:30,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,662 INFO L225 Difference]: With dead ends: 412 [2019-08-04 21:38:30,662 INFO L226 Difference]: Without dead ends: 412 [2019-08-04 21:38:30,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-08-04 21:38:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 349. [2019-08-04 21:38:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-08-04 21:38:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 451 transitions. [2019-08-04 21:38:30,671 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 451 transitions. Word has length 103 [2019-08-04 21:38:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,671 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 451 transitions. [2019-08-04 21:38:30,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 451 transitions. [2019-08-04 21:38:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-04 21:38:30,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,674 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 8, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:30,674 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1755108375, now seen corresponding path program 2 times [2019-08-04 21:38:30,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:30,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:30,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-08-04 21:38:30,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:30,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:38:30,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:30,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:30,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:30,782 INFO L87 Difference]: Start difference. First operand 349 states and 451 transitions. Second operand 3 states. [2019-08-04 21:38:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:30,965 INFO L93 Difference]: Finished difference Result 362 states and 432 transitions. [2019-08-04 21:38:30,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:30,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-08-04 21:38:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:30,969 INFO L225 Difference]: With dead ends: 362 [2019-08-04 21:38:30,970 INFO L226 Difference]: Without dead ends: 362 [2019-08-04 21:38:30,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 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-04 21:38:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-08-04 21:38:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 348. [2019-08-04 21:38:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-08-04 21:38:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 418 transitions. [2019-08-04 21:38:30,977 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 418 transitions. Word has length 128 [2019-08-04 21:38:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:30,978 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 418 transitions. [2019-08-04 21:38:30,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 418 transitions. [2019-08-04 21:38:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-04 21:38:30,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:30,980 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:38:30,980 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:30,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1179294915, now seen corresponding path program 1 times [2019-08-04 21:38:30,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:31,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:31,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 736 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-08-04 21:38:31,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:31,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:31,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:31,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:31,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:31,201 INFO L87 Difference]: Start difference. First operand 348 states and 418 transitions. Second operand 4 states. [2019-08-04 21:38:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:31,574 INFO L93 Difference]: Finished difference Result 290 states and 342 transitions. [2019-08-04 21:38:31,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:31,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-08-04 21:38:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:31,574 INFO L225 Difference]: With dead ends: 290 [2019-08-04 21:38:31,575 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:38:31,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:31,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:38:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:38:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:38:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:38:31,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2019-08-04 21:38:31,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:31,576 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:38:31,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:38:31,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:38:31,581 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:31 BoogieIcfgContainer [2019-08-04 21:38:31,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:31,584 INFO L168 Benchmark]: Toolchain (without parser) took 5982.08 ms. Allocated memory was 135.3 MB in the beginning and 226.5 MB in the end (delta: 91.2 MB). Free memory was 110.7 MB in the beginning and 200.8 MB in the end (delta: -90.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:31,585 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 135.3 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:38:31,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.75 ms. Allocated memory is still 135.3 MB. Free memory was 110.5 MB in the beginning and 108.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:31,587 INFO L168 Benchmark]: Boogie Preprocessor took 34.20 ms. Allocated memory is still 135.3 MB. Free memory was 108.9 MB in the beginning and 107.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:31,587 INFO L168 Benchmark]: RCFGBuilder took 835.60 ms. Allocated memory is still 135.3 MB. Free memory was 107.2 MB in the beginning and 80.7 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:31,588 INFO L168 Benchmark]: TraceAbstraction took 5068.14 ms. Allocated memory was 135.3 MB in the beginning and 226.5 MB in the end (delta: 91.2 MB). Free memory was 80.5 MB in the beginning and 200.8 MB in the end (delta: -120.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:38:31,592 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.16 ms. Allocated memory is still 135.3 MB. Free memory was 113.0 MB in the beginning and 112.8 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 39.75 ms. Allocated memory is still 135.3 MB. Free memory was 110.5 MB in the beginning and 108.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.20 ms. Allocated memory is still 135.3 MB. Free memory was 108.9 MB in the beginning and 107.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.60 ms. Allocated memory is still 135.3 MB. Free memory was 107.2 MB in the beginning and 80.7 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5068.14 ms. Allocated memory was 135.3 MB in the beginning and 226.5 MB in the end (delta: 91.2 MB). Free memory was 80.5 MB in the beginning and 200.8 MB in the end (delta: -120.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: 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, 18 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 372 SDtfs, 55 SDslu, 125 SDs, 0 SdLazy, 482 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 897 GetRequests, 876 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=12, 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, 14 MinimizatonAttempts, 113 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 138440 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5404 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3288/3385 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...