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/RanFile057.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:03:49,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:03:49,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:03:49,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:03:49,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:03:49,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:03:49,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:03:49,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:03:49,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:03:49,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:03:49,667 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:03:49,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:03:49,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:03:49,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:03:49,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:03:49,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:03:49,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:03:49,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:03:49,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:03:49,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:03:49,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:03:49,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:03:49,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:03:49,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:03:49,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:03:49,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:03:49,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:03:49,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:03:49,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:03:49,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:03:49,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:03:49,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:03:49,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:03:49,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:03:49,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:03:49,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:03:49,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:03:49,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:03:49,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:03:49,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:03:49,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:03:49,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:03:49,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:03:49,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:03:49,770 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:03:49,770 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:03:49,771 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile057.bpl [2019-08-05 10:03:49,772 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile057.bpl' [2019-08-05 10:03:49,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:03:49,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:03:49,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:49,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:03:49,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:03:49,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/1) ... [2019-08-05 10:03:49,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/1) ... [2019-08-05 10:03:49,893 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:03:49,894 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:03:49,894 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:03:49,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:49,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:03:49,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:03:49,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:03:49,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/1) ... [2019-08-05 10:03:49,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/1) ... [2019-08-05 10:03:49,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/1) ... [2019-08-05 10:03:49,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/1) ... [2019-08-05 10:03:49,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/1) ... [2019-08-05 10:03:49,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/1) ... [2019-08-05 10:03:49,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/1) ... [2019-08-05 10:03:49,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:03:49,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:03:49,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:03:49,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:03:49,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (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:03:50,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:03:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:03:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:03:51,584 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:03:51,585 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:03:51,586 INFO L202 PluginConnector]: Adding new model RanFile057.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:51 BoogieIcfgContainer [2019-08-05 10:03:51,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:03:51,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:03:51,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:03:51,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:03:51,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:49" (1/2) ... [2019-08-05 10:03:51,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366986bb and model type RanFile057.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:03:51, skipping insertion in model container [2019-08-05 10:03:51,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile057.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:51" (2/2) ... [2019-08-05 10:03:51,594 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile057.bpl [2019-08-05 10:03:51,603 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:03:51,610 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:03:51,624 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:03:51,651 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:03:51,652 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:03:51,652 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:03:51,653 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:03:51,653 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:03:51,653 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:03:51,653 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:03:51,653 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:03:51,653 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:03:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-08-05 10:03:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:03:51,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:51,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:51,683 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:51,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1072795049, now seen corresponding path program 1 times [2019-08-05 10:03:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:51,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:03:51,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:51,859 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:51,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:51,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:51,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:51,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:51,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:51,885 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2019-08-05 10:03:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:52,496 INFO L93 Difference]: Finished difference Result 55 states and 98 transitions. [2019-08-05 10:03:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:52,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-08-05 10:03:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:52,510 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:03:52,510 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:03:52,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:03:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:03:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-08-05 10:03:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:03:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 93 transitions. [2019-08-05 10:03:52,552 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 93 transitions. Word has length 16 [2019-08-05 10:03:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:52,553 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 93 transitions. [2019-08-05 10:03:52,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 93 transitions. [2019-08-05 10:03:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:03:52,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:52,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:52,555 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:52,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:52,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2069786033, now seen corresponding path program 1 times [2019-08-05 10:03:52,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:52,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:03:52,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:52,587 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:52,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:52,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:52,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:52,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:52,591 INFO L87 Difference]: Start difference. First operand 52 states and 93 transitions. Second operand 3 states. [2019-08-05 10:03:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:53,043 INFO L93 Difference]: Finished difference Result 66 states and 119 transitions. [2019-08-05 10:03:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:53,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-08-05 10:03:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:53,049 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:03:53,049 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:03:53,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:03:53,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:03:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2019-08-05 10:03:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:03:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-08-05 10:03:53,059 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 16 [2019-08-05 10:03:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:53,060 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-08-05 10:03:53,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-08-05 10:03:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:03:53,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:53,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:53,062 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1244688692, now seen corresponding path program 1 times [2019-08-05 10:03:53,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:53,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:03:53,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:53,514 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:53,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:53,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:03:53,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:03:53,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:03:53,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:03:53,516 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 7 states. [2019-08-05 10:03:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:54,323 INFO L93 Difference]: Finished difference Result 75 states and 136 transitions. [2019-08-05 10:03:54,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:03:54,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-08-05 10:03:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:54,327 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:03:54,327 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:03:54,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:03:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:03:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-08-05 10:03:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:03:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 115 transitions. [2019-08-05 10:03:54,336 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 115 transitions. Word has length 17 [2019-08-05 10:03:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:54,336 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 115 transitions. [2019-08-05 10:03:54,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:03:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 115 transitions. [2019-08-05 10:03:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:03:54,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:54,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:54,338 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 349986453, now seen corresponding path program 1 times [2019-08-05 10:03:54,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:54,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:03:54,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:54,501 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:54,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:54,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:54,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:03:54,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:03:54,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:03:54,504 INFO L87 Difference]: Start difference. First operand 64 states and 115 transitions. Second operand 4 states. [2019-08-05 10:03:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:54,766 INFO L93 Difference]: Finished difference Result 95 states and 170 transitions. [2019-08-05 10:03:54,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:03:54,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-08-05 10:03:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:54,769 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:03:54,769 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:03:54,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:03:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:03:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2019-08-05 10:03:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:03:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 165 transitions. [2019-08-05 10:03:54,781 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 165 transitions. Word has length 17 [2019-08-05 10:03:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:54,781 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 165 transitions. [2019-08-05 10:03:54,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:03:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 165 transitions. [2019-08-05 10:03:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:03:54,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:54,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:54,783 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1004557744, now seen corresponding path program 1 times [2019-08-05 10:03:54,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:54,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:03:54,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:55,495 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:03:55,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:55,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:03:55,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:03:55,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:03:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:55,497 INFO L87 Difference]: Start difference. First operand 90 states and 165 transitions. Second operand 12 states. [2019-08-05 10:03:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:57,598 INFO L93 Difference]: Finished difference Result 112 states and 197 transitions. [2019-08-05 10:03:57,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:03:57,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 10:03:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:57,600 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:03:57,600 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:03:57,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:03:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:03:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2019-08-05 10:03:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:03:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 174 transitions. [2019-08-05 10:03:57,609 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 174 transitions. Word has length 18 [2019-08-05 10:03:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:57,610 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 174 transitions. [2019-08-05 10:03:57,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:03:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 174 transitions. [2019-08-05 10:03:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:03:57,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:57,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:57,612 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:57,612 INFO L82 PathProgramCache]: Analyzing trace with hash -36448406, now seen corresponding path program 1 times [2019-08-05 10:03:57,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:57,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:03:57,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:57,702 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:57,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:57,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:03:57,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:03:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:03:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:03:57,703 INFO L87 Difference]: Start difference. First operand 96 states and 174 transitions. Second operand 5 states. [2019-08-05 10:03:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:58,031 INFO L93 Difference]: Finished difference Result 130 states and 227 transitions. [2019-08-05 10:03:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:03:58,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-08-05 10:03:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:58,035 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:03:58,035 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:03:58,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:03:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:03:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2019-08-05 10:03:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:03:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 192 transitions. [2019-08-05 10:03:58,045 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 192 transitions. Word has length 18 [2019-08-05 10:03:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:58,046 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 192 transitions. [2019-08-05 10:03:58,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:03:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 192 transitions. [2019-08-05 10:03:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:03:58,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:58,048 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:58,048 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:58,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2035321498, now seen corresponding path program 1 times [2019-08-05 10:03:58,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:58,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:03:58,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:58,120 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:58,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:58,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:03:58,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:03:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:03:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:03:58,122 INFO L87 Difference]: Start difference. First operand 107 states and 192 transitions. Second operand 5 states. [2019-08-05 10:03:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:58,334 INFO L93 Difference]: Finished difference Result 125 states and 212 transitions. [2019-08-05 10:03:58,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:03:58,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-08-05 10:03:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:58,336 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:03:58,337 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:03:58,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:03:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2019-08-05 10:03:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:03:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 194 transitions. [2019-08-05 10:03:58,347 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 194 transitions. Word has length 18 [2019-08-05 10:03:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:58,348 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 194 transitions. [2019-08-05 10:03:58,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:03:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 194 transitions. [2019-08-05 10:03:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:03:58,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:58,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:58,350 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2035289849, now seen corresponding path program 1 times [2019-08-05 10:03:58,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:58,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:03:58,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:58,393 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:03:58,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:58,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:58,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:58,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:58,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:58,394 INFO L87 Difference]: Start difference. First operand 112 states and 194 transitions. Second operand 3 states. [2019-08-05 10:03:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:58,533 INFO L93 Difference]: Finished difference Result 128 states and 212 transitions. [2019-08-05 10:03:58,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:58,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-08-05 10:03:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:58,535 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:03:58,536 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:03:58,536 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-05 10:03:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:03:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2019-08-05 10:03:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:03:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 204 transitions. [2019-08-05 10:03:58,543 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 204 transitions. Word has length 18 [2019-08-05 10:03:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:58,544 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 204 transitions. [2019-08-05 10:03:58,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 204 transitions. [2019-08-05 10:03:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:03:58,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:58,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:58,546 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:58,546 INFO L82 PathProgramCache]: Analyzing trace with hash 147857840, now seen corresponding path program 1 times [2019-08-05 10:03:58,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:58,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:03:58,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:58,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:58,767 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:03:58,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:58,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:03:58,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:03:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:03:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:03:58,769 INFO L87 Difference]: Start difference. First operand 119 states and 204 transitions. Second operand 6 states. [2019-08-05 10:03:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:59,170 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2019-08-05 10:03:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:03:59,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-08-05 10:03:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:59,172 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:03:59,173 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:03:59,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:03:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:03:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2019-08-05 10:03:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:03:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 206 transitions. [2019-08-05 10:03:59,179 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 206 transitions. Word has length 18 [2019-08-05 10:03:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:59,180 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 206 transitions. [2019-08-05 10:03:59,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:03:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 206 transitions. [2019-08-05 10:03:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:03:59,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:59,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] [2019-08-05 10:03:59,182 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1154917208, now seen corresponding path program 1 times [2019-08-05 10:03:59,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:59,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:03:59,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:59,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:59,215 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:03:59,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:59,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:59,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:59,216 INFO L87 Difference]: Start difference. First operand 121 states and 206 transitions. Second operand 3 states. [2019-08-05 10:03:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:59,312 INFO L93 Difference]: Finished difference Result 124 states and 210 transitions. [2019-08-05 10:03:59,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:59,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:03:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:59,314 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:03:59,315 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:03:59,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 1 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:03:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:03:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:03:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:03:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-08-05 10:03:59,330 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 19 [2019-08-05 10:03:59,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:59,330 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-08-05 10:03:59,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-08-05 10:03:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:03:59,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:59,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:59,335 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash -504635296, now seen corresponding path program 1 times [2019-08-05 10:03:59,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:59,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:03:59,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:59,446 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:03:59,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:59,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:59,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:03:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:03:59,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:03:59,448 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 4 states. [2019-08-05 10:03:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:59,672 INFO L93 Difference]: Finished difference Result 153 states and 252 transitions. [2019-08-05 10:03:59,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:03:59,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-08-05 10:03:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:59,675 INFO L225 Difference]: With dead ends: 153 [2019-08-05 10:03:59,675 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:03:59,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:03:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:03:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2019-08-05 10:03:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:03:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 214 transitions. [2019-08-05 10:03:59,680 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 214 transitions. Word has length 19 [2019-08-05 10:03:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:59,681 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 214 transitions. [2019-08-05 10:03:59,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:03:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 214 transitions. [2019-08-05 10:03:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:03:59,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:59,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:59,682 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1399337535, now seen corresponding path program 1 times [2019-08-05 10:03:59,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:59,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:03:59,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:59,749 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:03:59,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:59,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:03:59,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:03:59,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:03:59,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:03:59,750 INFO L87 Difference]: Start difference. First operand 127 states and 214 transitions. Second operand 4 states. [2019-08-05 10:04:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:00,109 INFO L93 Difference]: Finished difference Result 135 states and 225 transitions. [2019-08-05 10:04:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:00,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-08-05 10:04:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:00,110 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:04:00,110 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:04:00,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:04:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-08-05 10:04:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:04:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 224 transitions. [2019-08-05 10:04:00,115 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 224 transitions. Word has length 19 [2019-08-05 10:04:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:00,116 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 224 transitions. [2019-08-05 10:04:00,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 224 transitions. [2019-08-05 10:04:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:04:00,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:00,117 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:00,117 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:00,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2144534348, now seen corresponding path program 2 times [2019-08-05 10:04:00,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:04:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:04:00,194 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:04:00,223 INFO L202 PluginConnector]: Adding new model RanFile057.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:04:00 BoogieIcfgContainer [2019-08-05 10:04:00,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:04:00,225 INFO L168 Benchmark]: Toolchain (without parser) took 10383.54 ms. Allocated memory was 132.6 MB in the beginning and 239.6 MB in the end (delta: 107.0 MB). Free memory was 109.4 MB in the beginning and 68.8 MB in the end (delta: 40.6 MB). Peak memory consumption was 147.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:04:00,226 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 132.6 MB. Free memory is still 111.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:04:00,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.52 ms. Allocated memory is still 132.6 MB. Free memory was 109.4 MB in the beginning and 107.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:04:00,227 INFO L168 Benchmark]: Boogie Preprocessor took 69.53 ms. Allocated memory is still 132.6 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:04:00,228 INFO L168 Benchmark]: RCFGBuilder took 1619.08 ms. Allocated memory was 132.6 MB in the beginning and 172.0 MB in the end (delta: 39.3 MB). Free memory was 105.5 MB in the beginning and 147.0 MB in the end (delta: -41.5 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:04:00,229 INFO L168 Benchmark]: TraceAbstraction took 8635.94 ms. Allocated memory was 172.0 MB in the beginning and 239.6 MB in the end (delta: 67.6 MB). Free memory was 145.8 MB in the beginning and 68.8 MB in the end (delta: 77.0 MB). Peak memory consumption was 144.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:04:00,233 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 132.6 MB. Free memory is still 111.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.52 ms. Allocated memory is still 132.6 MB. Free memory was 109.4 MB in the beginning and 107.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.53 ms. Allocated memory is still 132.6 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. * RCFGBuilder took 1619.08 ms. Allocated memory was 132.6 MB in the beginning and 172.0 MB in the end (delta: 39.3 MB). Free memory was 105.5 MB in the beginning and 147.0 MB in the end (delta: -41.5 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8635.94 ms. Allocated memory was 172.0 MB in the beginning and 239.6 MB in the end (delta: 67.6 MB). Free memory was 145.8 MB in the beginning and 68.8 MB in the end (delta: 77.0 MB). Peak memory consumption was 144.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 192]: assertion can be violated assertion can be violated We found a FailurePath: [L9] COND FALSE !(qrrswwv > zjwdcwa + emntcyx + emntcyx + 97 + 67 || qrrswwv > 27 + 40 + zjwdcwa + oesehyb) VAL [emntcyx=-108, oesehyb=-239, qrrswwv=-374, zjwdcwa=501] [L21] COND FALSE !(emntcyx < emntcyx + emntcyx + oesehyb + 40 + 100) VAL [emntcyx=-108, oesehyb=-239, qrrswwv=-374, zjwdcwa=501] [L28] COND FALSE !(emntcyx > 32 - 79 && zjwdcwa < 54 + 69 + oesehyb + 81) [L31] zjwdcwa := zjwdcwa + 74 + 53 + qrrswwv; VAL [emntcyx=-108, oesehyb=-239, qrrswwv=-374, zjwdcwa=254] [L32] COND FALSE !(zjwdcwa < 71 + 80 + 2 + 100) VAL [emntcyx=-108, oesehyb=-239, qrrswwv=-374, zjwdcwa=254] [L37] vuiiwzs := vuiiwzs + 94 + 89; VAL [emntcyx=-108, oesehyb=-239, qrrswwv=-374, vuiiwzs=-274, zjwdcwa=254] [L38] COND FALSE !(qrrswwv < qrrswwv + qrrswwv + 6 + 100) [L59] qrrswwv := qrrswwv + oesehyb + 82 + emntcyx; VAL [emntcyx=-108, oesehyb=-239, qrrswwv=-639, vuiiwzs=-274, zjwdcwa=254] [L60] COND FALSE !(vuiiwzs < 44 + 93 + 2 + vuiiwzs + oesehyb + 100) VAL [emntcyx=-108, oesehyb=-239, qrrswwv=-639, vuiiwzs=-274, zjwdcwa=254] [L84] COND FALSE !(qrrswwv < qrrswwv + emntcyx + 100) [L101] zjwdcwa := zjwdcwa + zjwdcwa; [L102] emntcyx := emntcyx + 60 + 93 + emntcyx + emntcyx; VAL [emntcyx=-171, oesehyb=-239, qrrswwv=-639, vuiiwzs=-274, zjwdcwa=508] [L103] COND FALSE !(vuiiwzs < 44 - vuiiwzs + emntcyx - zjwdcwa && vuiiwzs > zjwdcwa + emntcyx) [L117] qrrswwv := qrrswwv + 28; [L118] COND FALSE !(vuiiwzs < vuiiwzs - 78) [L120] zjwdcwa := zjwdcwa + qrrswwv + emntcyx + vuiiwzs + 90; VAL [emntcyx=-171, oesehyb=-239, qrrswwv=-611, vuiiwzs=-274, zjwdcwa=-458] [L122] COND TRUE qrrswwv < qrrswwv + qrrswwv + 46 + 1 + 54 + 100 || zjwdcwa < 10 - emntcyx + 16 [L123] qrrswwv := zjwdcwa + 60 - 50 - qrrswwv + emntcyx; [L124] emntcyx := 67 - vuiiwzs + emntcyx + 52; VAL [emntcyx=222, oesehyb=-239, qrrswwv=-8, vuiiwzs=-274, zjwdcwa=-458] [L122] COND TRUE qrrswwv < qrrswwv + qrrswwv + 46 + 1 + 54 + 100 || zjwdcwa < 10 - emntcyx + 16 [L123] qrrswwv := zjwdcwa + 60 - 50 - qrrswwv + emntcyx; [L124] emntcyx := 67 - vuiiwzs + emntcyx + 52; VAL [emntcyx=615, oesehyb=-239, qrrswwv=-218, vuiiwzs=-274, zjwdcwa=-458] [L122] COND FALSE !(qrrswwv < qrrswwv + qrrswwv + 46 + 1 + 54 + 100 || zjwdcwa < 10 - emntcyx + 16) VAL [emntcyx=615, oesehyb=-239, qrrswwv=-218, vuiiwzs=-274, zjwdcwa=-458] [L127] vuiiwzs := vuiiwzs + 62; [L128] emntcyx := emntcyx + 5 + oesehyb + 59 + zjwdcwa; VAL [emntcyx=-18, oesehyb=-239, qrrswwv=-218, vuiiwzs=-212, zjwdcwa=-458] [L129] COND FALSE !(vuiiwzs < 76 + qrrswwv + qrrswwv + 21 + 100) [L140] emntcyx := emntcyx + 26 + 91 + 51 + qrrswwv; VAL [emntcyx=-68, oesehyb=-239, qrrswwv=-218, vuiiwzs=-212, zjwdcwa=-458] [L141] COND TRUE qrrswwv < oesehyb + 42 + 10 - 30 VAL [emntcyx=-68, oesehyb=-239, qrrswwv=-218, vuiiwzs=-212, zjwdcwa=-458] [L149] COND FALSE !(qrrswwv < 98 + 41 + zjwdcwa + 100) [L161] vuiiwzs := vuiiwzs + 60 + vuiiwzs + zjwdcwa + 64; VAL [emntcyx=-68, oesehyb=-239, qrrswwv=-218, vuiiwzs=-758, zjwdcwa=-458] [L162] COND FALSE !(vuiiwzs < emntcyx + 99 + oesehyb + zjwdcwa + 100 && vuiiwzs > vuiiwzs + 28 + emntcyx + 40) VAL [emntcyx=-68, oesehyb=-239, qrrswwv=-218, vuiiwzs=-758, zjwdcwa=-458] [L185] COND FALSE !(qrrswwv < 35 + 72 + zjwdcwa + 100) VAL [emntcyx=-68, oesehyb=-239, qrrswwv=-218, vuiiwzs=-758, zjwdcwa=-458] [L192] assert zjwdcwa > 37 - 29; VAL [emntcyx=-68, oesehyb=-239, qrrswwv=-218, vuiiwzs=-758, zjwdcwa=-458] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 3 error locations. UNSAFE Result, 8.5s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 716 SDtfs, 348 SDslu, 372 SDs, 0 SdLazy, 2555 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred 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, 12 MinimizatonAttempts, 109 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 201 ConstructedInterpolants, 37 QuantifiedInterpolants, 20102 SizeOfPredicates, 23 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...