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/random/RanFile071.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:02:05,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:02:05,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:02:05,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:02:05,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:02:05,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:02:05,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:02:05,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:02:05,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:02:05,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:02:05,489 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:02:05,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:02:05,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:02:05,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:02:05,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:02:05,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:02:05,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:02:05,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:02:05,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:02:05,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:02:05,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:02:05,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:02:05,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:02:05,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:02:05,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:02:05,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:02:05,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:02:05,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:02:05,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:02:05,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:02:05,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:02:05,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:02:05,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:02:05,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:02:05,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:02:05,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:02:05,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:02:05,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:02:05,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:02:05,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:02:05,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:02:05,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:02:05,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:02:05,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:02:05,594 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:02:05,594 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:02:05,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile071.bpl [2019-08-05 10:02:05,595 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile071.bpl' [2019-08-05 10:02:05,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:02:05,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:02:05,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:02:05,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:02:05,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:02:05,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/1) ... [2019-08-05 10:02:05,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/1) ... [2019-08-05 10:02:05,729 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:02:05,730 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:02:05,731 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:02:05,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:02:05,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:02:05,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:02:05,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:02:05,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/1) ... [2019-08-05 10:02:05,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/1) ... [2019-08-05 10:02:05,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/1) ... [2019-08-05 10:02:05,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/1) ... [2019-08-05 10:02:05,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/1) ... [2019-08-05 10:02:05,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/1) ... [2019-08-05 10:02:05,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/1) ... [2019-08-05 10:02:05,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:02:05,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:02:05,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:02:05,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:02:05,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (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:02:05,941 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:02:05,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:02:05,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:02:09,358 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:02:09,359 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:02:09,360 INFO L202 PluginConnector]: Adding new model RanFile071.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:02:09 BoogieIcfgContainer [2019-08-05 10:02:09,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:02:09,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:02:09,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:02:09,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:02:09,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:05" (1/2) ... [2019-08-05 10:02:09,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661b1c25 and model type RanFile071.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:02:09, skipping insertion in model container [2019-08-05 10:02:09,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile071.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:02:09" (2/2) ... [2019-08-05 10:02:09,370 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile071.bpl [2019-08-05 10:02:09,380 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:02:09,391 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:02:09,414 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:02:09,452 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:02:09,454 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:02:09,455 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:02:09,455 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:02:09,455 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:02:09,456 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:02:09,458 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:02:09,458 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:02:09,458 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:02:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2019-08-05 10:02:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:02:09,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:09,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:09,497 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:09,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash -334865355, now seen corresponding path program 1 times [2019-08-05 10:02:09,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:09,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:02:09,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:09,804 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:02:09,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:09,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:02:09,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:02:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:02:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:02:09,835 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 3 states. [2019-08-05 10:02:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:11,113 INFO L93 Difference]: Finished difference Result 110 states and 194 transitions. [2019-08-05 10:02:11,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:02:11,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:02:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:11,129 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:02:11,129 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:02:11,131 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:02:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:02:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2019-08-05 10:02:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:02:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 181 transitions. [2019-08-05 10:02:11,178 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 181 transitions. Word has length 25 [2019-08-05 10:02:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:11,179 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 181 transitions. [2019-08-05 10:02:11,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:02:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 181 transitions. [2019-08-05 10:02:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:02:11,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:11,181 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:11,182 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash 317012400, now seen corresponding path program 1 times [2019-08-05 10:02:11,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:11,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:02:11,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:12,575 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:02:12,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:12,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:02:12,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:02:12,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:02:12,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:02:12,579 INFO L87 Difference]: Start difference. First operand 99 states and 181 transitions. Second operand 11 states. [2019-08-05 10:02:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:17,633 INFO L93 Difference]: Finished difference Result 131 states and 233 transitions. [2019-08-05 10:02:17,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:02:17,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-08-05 10:02:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:17,640 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:02:17,641 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:02:17,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:02:17,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:02:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2019-08-05 10:02:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:02:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 205 transitions. [2019-08-05 10:02:17,655 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 205 transitions. Word has length 27 [2019-08-05 10:02:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:17,655 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 205 transitions. [2019-08-05 10:02:17,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:02:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 205 transitions. [2019-08-05 10:02:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:02:17,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:17,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:17,658 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash -475966384, now seen corresponding path program 1 times [2019-08-05 10:02:17,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:17,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:02:17,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:02:18,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:02:18,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:02:18,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:02:18,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:02:18,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:02:18,562 INFO L87 Difference]: Start difference. First operand 113 states and 205 transitions. Second operand 12 states. [2019-08-05 10:03:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:38,393 INFO L93 Difference]: Finished difference Result 245 states and 444 transitions. [2019-08-05 10:03:38,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:03:38,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-08-05 10:03:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:38,398 INFO L225 Difference]: With dead ends: 245 [2019-08-05 10:03:38,398 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 10:03:38,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:03:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 10:03:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 162. [2019-08-05 10:03:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:03:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 296 transitions. [2019-08-05 10:03:38,414 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 296 transitions. Word has length 28 [2019-08-05 10:03:38,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:38,414 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 296 transitions. [2019-08-05 10:03:38,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:03:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 296 transitions. [2019-08-05 10:03:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:03:38,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:38,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:38,417 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1237452436, now seen corresponding path program 1 times [2019-08-05 10:03:38,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:38,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:03:38,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:39,820 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:03:39,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:39,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-08-05 10:03:39,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:03:39,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:03:39,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:03:39,822 INFO L87 Difference]: Start difference. First operand 162 states and 296 transitions. Second operand 14 states. [2019-08-05 10:04:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:19,350 INFO L93 Difference]: Finished difference Result 174 states and 318 transitions. [2019-08-05 10:04:19,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:04:19,351 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-08-05 10:04:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:19,354 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:04:19,354 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 10:04:19,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=40, Invalid=231, Unknown=1, NotChecked=0, Total=272 [2019-08-05 10:04:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 10:04:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 149. [2019-08-05 10:04:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:04:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 273 transitions. [2019-08-05 10:04:19,364 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 273 transitions. Word has length 28 [2019-08-05 10:04:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:19,364 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 273 transitions. [2019-08-05 10:04:19,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:04:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 273 transitions. [2019-08-05 10:04:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:19,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:19,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:19,367 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:19,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1239026306, now seen corresponding path program 1 times [2019-08-05 10:04:19,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:19,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:19,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:19,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:19,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:04:19,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:19,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:19,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:19,530 INFO L87 Difference]: Start difference. First operand 149 states and 273 transitions. Second operand 4 states. [2019-08-05 10:04:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:20,088 INFO L93 Difference]: Finished difference Result 212 states and 379 transitions. [2019-08-05 10:04:20,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:20,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-08-05 10:04:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:20,093 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:04:20,093 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 10:04:20,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-05 10:04:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 10:04:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2019-08-05 10:04:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:04:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 288 transitions. [2019-08-05 10:04:20,104 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 288 transitions. Word has length 28 [2019-08-05 10:04:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:20,104 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 288 transitions. [2019-08-05 10:04:20,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 288 transitions. [2019-08-05 10:04:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:20,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:20,106 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:20,107 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:20,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1126200857, now seen corresponding path program 1 times [2019-08-05 10:04:20,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:20,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:20,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:20,412 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:04:20,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:20,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:04:20,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:20,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:20,414 INFO L87 Difference]: Start difference. First operand 158 states and 288 transitions. Second operand 7 states. [2019-08-05 10:04:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,346 INFO L93 Difference]: Finished difference Result 179 states and 325 transitions. [2019-08-05 10:04:22,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:04:22,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-08-05 10:04:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,349 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:04:22,349 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:04:22,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:04:22,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 164. [2019-08-05 10:04:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:04:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 299 transitions. [2019-08-05 10:04:22,357 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 299 transitions. Word has length 28 [2019-08-05 10:04:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,358 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 299 transitions. [2019-08-05 10:04:22,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 299 transitions. [2019-08-05 10:04:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:22,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,360 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1086224930, now seen corresponding path program 1 times [2019-08-05 10:04:22,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:23,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:23,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-08-05 10:04:23,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:04:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:04:23,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:04:23,207 INFO L87 Difference]: Start difference. First operand 164 states and 299 transitions. Second operand 15 states. [2019-08-05 10:04:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:57,742 INFO L93 Difference]: Finished difference Result 196 states and 355 transitions. [2019-08-05 10:04:57,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:04:57,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-08-05 10:04:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:57,745 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:04:57,745 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:04:57,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:04:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:04:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 178. [2019-08-05 10:04:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 10:04:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 324 transitions. [2019-08-05 10:04:57,753 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 324 transitions. Word has length 29 [2019-08-05 10:04:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:57,753 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 324 transitions. [2019-08-05 10:04:57,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:04:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 324 transitions. [2019-08-05 10:04:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:57,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:57,755 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:57,755 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:57,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash -243313680, now seen corresponding path program 2 times [2019-08-05 10:04:57,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:57,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:04:57,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:57,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:57,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:04:57,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:57,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:57,825 INFO L87 Difference]: Start difference. First operand 178 states and 324 transitions. Second operand 4 states. [2019-08-05 10:04:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:58,321 INFO L93 Difference]: Finished difference Result 249 states and 446 transitions. [2019-08-05 10:04:58,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:58,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-08-05 10:04:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:58,330 INFO L225 Difference]: With dead ends: 249 [2019-08-05 10:04:58,330 INFO L226 Difference]: Without dead ends: 240 [2019-08-05 10:04:58,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-08-05 10:04:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 171. [2019-08-05 10:04:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-05 10:04:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 311 transitions. [2019-08-05 10:04:58,340 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 311 transitions. Word has length 29 [2019-08-05 10:04:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:58,341 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 311 transitions. [2019-08-05 10:04:58,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 311 transitions. [2019-08-05 10:04:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:58,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:58,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:58,343 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash -129319953, now seen corresponding path program 1 times [2019-08-05 10:04:58,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:58,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:58,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:58,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:58,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:58,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:58,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:58,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:58,576 INFO L87 Difference]: Start difference. First operand 171 states and 311 transitions. Second operand 8 states. [2019-08-05 10:04:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:59,547 INFO L93 Difference]: Finished difference Result 347 states and 620 transitions. [2019-08-05 10:04:59,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:59,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-08-05 10:04:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:59,550 INFO L225 Difference]: With dead ends: 347 [2019-08-05 10:04:59,551 INFO L226 Difference]: Without dead ends: 347 [2019-08-05 10:04:59,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-08-05 10:04:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 265. [2019-08-05 10:04:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-08-05 10:04:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 482 transitions. [2019-08-05 10:04:59,560 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 482 transitions. Word has length 29 [2019-08-05 10:04:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:59,560 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 482 transitions. [2019-08-05 10:04:59,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 482 transitions. [2019-08-05 10:04:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:59,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:59,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:59,562 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:59,563 INFO L82 PathProgramCache]: Analyzing trace with hash 357583042, now seen corresponding path program 1 times [2019-08-05 10:04:59,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:59,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:04:59,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:59,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:59,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:59,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:59,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:59,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:59,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:59,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:00,338 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-08-05 10:05:00,947 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-08-05 10:05:00,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:06:12,879 WARN L188 SmtUtils]: Spent 1.20 m on a formula simplification. DAG size of input: 141 DAG size of output: 126 Received shutdown request... [2019-08-05 10:06:51,386 WARN L196 SmtUtils]: Removed 3 from assertion stack [2019-08-05 10:06:51,387 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:06:51,387 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:06:51,392 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:06:51,392 INFO L202 PluginConnector]: Adding new model RanFile071.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:06:51 BoogieIcfgContainer [2019-08-05 10:06:51,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:06:51,395 INFO L168 Benchmark]: Toolchain (without parser) took 285725.14 ms. Allocated memory was 139.5 MB in the beginning and 312.5 MB in the end (delta: 173.0 MB). Free memory was 107.6 MB in the beginning and 113.6 MB in the end (delta: -6.0 MB). Peak memory consumption was 167.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:06:51,396 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:06:51,397 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.14 ms. Allocated memory is still 139.5 MB. Free memory was 107.6 MB in the beginning and 105.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:06:51,398 INFO L168 Benchmark]: Boogie Preprocessor took 127.78 ms. Allocated memory is still 139.5 MB. Free memory was 105.5 MB in the beginning and 102.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:06:51,399 INFO L168 Benchmark]: RCFGBuilder took 3497.73 ms. Allocated memory was 139.5 MB in the beginning and 174.6 MB in the end (delta: 35.1 MB). Free memory was 102.8 MB in the beginning and 79.2 MB in the end (delta: 23.6 MB). Peak memory consumption was 58.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:06:51,400 INFO L168 Benchmark]: TraceAbstraction took 282030.73 ms. Allocated memory was 174.6 MB in the beginning and 312.5 MB in the end (delta: 137.9 MB). Free memory was 78.5 MB in the beginning and 113.6 MB in the end (delta: -35.1 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:06:51,404 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 110.8 MB in the beginning and 110.6 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 64.14 ms. Allocated memory is still 139.5 MB. Free memory was 107.6 MB in the beginning and 105.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.78 ms. Allocated memory is still 139.5 MB. Free memory was 105.5 MB in the beginning and 102.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3497.73 ms. Allocated memory was 139.5 MB in the beginning and 174.6 MB in the end (delta: 35.1 MB). Free memory was 102.8 MB in the beginning and 79.2 MB in the end (delta: 23.6 MB). Peak memory consumption was 58.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 282030.73 ms. Allocated memory was 174.6 MB in the beginning and 312.5 MB in the end (delta: 137.9 MB). Free memory was 78.5 MB in the beginning and 113.6 MB in the end (delta: -35.1 MB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 498]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 498). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 167 for 38390ms.. - TimeoutResultAtElement [Line: 497]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 497). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 167 for 38390ms.. - TimeoutResultAtElement [Line: 496]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 496). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 1,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 167 for 38390ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 101 locations, 3 error locations. TIMEOUT Result, 281.9s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 164.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1331 SDtfs, 679 SDslu, 592 SDs, 0 SdLazy, 10414 SolverSat, 57 SolverUnsat, 60 SolverUnknown, 0 SolverNotchecked, 146.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=9, 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, 9 MinimizatonAttempts, 370 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 242 ConstructedInterpolants, 53 QuantifiedInterpolants, 75912 SizeOfPredicates, 33 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 4/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown