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/real-life/PricedTimedAutomata/u2b04_multiple_broadcast_UNSAFE.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:12:52,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:12:52,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:12:52,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:12:52,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:12:52,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:12:52,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:12:52,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:12:52,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:12:52,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:12:52,581 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:12:52,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:12:52,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:12:52,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:12:52,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:12:52,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:12:52,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:12:52,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:12:52,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:12:52,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:12:52,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:12:52,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:12:52,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:12:52,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:12:52,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:12:52,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:12:52,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:12:52,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:12:52,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:12:52,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:12:52,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:12:52,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:12:52,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:12:52,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:12:52,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:12:52,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:12:52,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:12:52,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:12:52,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:12:52,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:12:52,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:12:52,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:12:52,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:12:52,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:12:52,695 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:12:52,696 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:12:52,696 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b04_multiple_broadcast_UNSAFE.bpl [2019-08-05 10:12:52,697 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b04_multiple_broadcast_UNSAFE.bpl' [2019-08-05 10:12:52,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:12:52,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:12:52,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:52,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:12:52,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:12:52,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/1) ... [2019-08-05 10:12:52,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/1) ... [2019-08-05 10:12:52,787 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:12:52,787 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:12:52,787 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:12:52,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:52,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:12:52,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:12:52,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:12:52,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/1) ... [2019-08-05 10:12:52,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/1) ... [2019-08-05 10:12:52,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/1) ... [2019-08-05 10:12:52,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/1) ... [2019-08-05 10:12:52,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/1) ... [2019-08-05 10:12:52,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/1) ... [2019-08-05 10:12:52,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/1) ... [2019-08-05 10:12:52,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:12:52,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:12:52,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:12:52,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:12:52,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (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:12:52,896 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:12:52,896 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:12:52,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:12:52,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:12:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_v [2019-08-05 10:12:53,024 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:12:54,224 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:12:54,225 INFO L283 CfgBuilder]: Removed 20 assume(true) statements. [2019-08-05 10:12:54,226 INFO L202 PluginConnector]: Adding new model u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:54 BoogieIcfgContainer [2019-08-05 10:12:54,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:12:54,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:12:54,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:12:54,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:12:54,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:52" (1/2) ... [2019-08-05 10:12:54,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afd76e and model type u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:12:54, skipping insertion in model container [2019-08-05 10:12:54,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:54" (2/2) ... [2019-08-05 10:12:54,235 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b04_multiple_broadcast_UNSAFE.bpl [2019-08-05 10:12:54,245 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:12:54,254 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:12:54,271 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:12:54,297 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:12:54,298 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:12:54,298 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:12:54,299 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:12:54,299 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:12:54,299 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:12:54,299 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:12:54,299 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:12:54,300 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:12:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-08-05 10:12:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:12:54,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:54,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:12:54,331 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:54,349 INFO L82 PathProgramCache]: Analyzing trace with hash 7722, now seen corresponding path program 1 times [2019-08-05 10:12:54,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:54,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:54,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:54,506 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:12:54,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:54,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:12:54,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:54,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:54,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:54,531 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-08-05 10:12:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:54,659 INFO L93 Difference]: Finished difference Result 55 states and 101 transitions. [2019-08-05 10:12:54,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:54,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:12:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:54,675 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:12:54,675 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:12:54,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:12:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-08-05 10:12:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:12:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2019-08-05 10:12:54,721 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 2 [2019-08-05 10:12:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:54,721 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2019-08-05 10:12:54,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2019-08-05 10:12:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:12:54,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:54,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:54,723 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1915356777, now seen corresponding path program 1 times [2019-08-05 10:12:54,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:54,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:54,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:54,780 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:12:54,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:54,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:54,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:54,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:54,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:54,784 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand 3 states. [2019-08-05 10:12:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:54,863 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2019-08-05 10:12:54,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:54,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-08-05 10:12:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:54,865 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:12:54,865 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:12:54,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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:12:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:12:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2019-08-05 10:12:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:12:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2019-08-05 10:12:54,876 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 9 [2019-08-05 10:12:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:54,877 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2019-08-05 10:12:54,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2019-08-05 10:12:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:12:54,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:54,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:54,879 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash 895723758, now seen corresponding path program 1 times [2019-08-05 10:12:54,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:54,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:54,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:54,930 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:12:54,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:54,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:54,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:54,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:54,932 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand 3 states. [2019-08-05 10:12:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:55,057 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2019-08-05 10:12:55,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:55,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-08-05 10:12:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:55,065 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:12:55,065 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:12:55,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:12:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:12:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2019-08-05 10:12:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:12:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2019-08-05 10:12:55,077 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 11 [2019-08-05 10:12:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:55,078 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2019-08-05 10:12:55,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2019-08-05 10:12:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:12:55,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:55,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:55,079 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:55,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:55,080 INFO L82 PathProgramCache]: Analyzing trace with hash 861204539, now seen corresponding path program 1 times [2019-08-05 10:12:55,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:55,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:55,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:55,144 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:12:55,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:55,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:55,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:55,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:55,146 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand 3 states. [2019-08-05 10:12:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:55,354 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2019-08-05 10:12:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:55,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:12:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:55,361 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:12:55,361 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:12:55,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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:12:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:12:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2019-08-05 10:12:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:12:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2019-08-05 10:12:55,375 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 14 [2019-08-05 10:12:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:55,376 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2019-08-05 10:12:55,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2019-08-05 10:12:55,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:12:55,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:55,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:55,377 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:55,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:55,378 INFO L82 PathProgramCache]: Analyzing trace with hash 970606724, now seen corresponding path program 1 times [2019-08-05 10:12:55,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:55,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:12:55,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:55,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:55,490 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:12:55,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:55,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:12:55,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:12:55,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:12:55,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:55,493 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand 4 states. [2019-08-05 10:12:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:55,663 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2019-08-05 10:12:55,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:12:55,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-08-05 10:12:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:55,666 INFO L225 Difference]: With dead ends: 232 [2019-08-05 10:12:55,666 INFO L226 Difference]: Without dead ends: 232 [2019-08-05 10:12:55,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:12:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-08-05 10:12:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 180. [2019-08-05 10:12:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:12:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2019-08-05 10:12:55,685 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 15 [2019-08-05 10:12:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:55,685 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2019-08-05 10:12:55,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:12:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2019-08-05 10:12:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:12:55,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:55,688 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:55,688 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:55,688 INFO L82 PathProgramCache]: Analyzing trace with hash -980000049, now seen corresponding path program 1 times [2019-08-05 10:12:55,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:55,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:55,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:55,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:55,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:55,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:55,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:55,781 INFO L87 Difference]: Start difference. First operand 180 states and 259 transitions. Second operand 3 states. [2019-08-05 10:12:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:55,930 INFO L93 Difference]: Finished difference Result 226 states and 314 transitions. [2019-08-05 10:12:55,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:55,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:12:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:55,936 INFO L225 Difference]: With dead ends: 226 [2019-08-05 10:12:55,936 INFO L226 Difference]: Without dead ends: 222 [2019-08-05 10:12:55,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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:12:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-08-05 10:12:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-08-05 10:12:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:12:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 309 transitions. [2019-08-05 10:12:55,947 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 309 transitions. Word has length 22 [2019-08-05 10:12:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:55,947 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 309 transitions. [2019-08-05 10:12:55,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 309 transitions. [2019-08-05 10:12:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:12:55,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:55,949 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:55,949 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:55,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:55,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1175627116, now seen corresponding path program 1 times [2019-08-05 10:12:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:55,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:12:55,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:56,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:56,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:12:56,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:12:56,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:12:56,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:56,045 INFO L87 Difference]: Start difference. First operand 220 states and 309 transitions. Second operand 4 states. [2019-08-05 10:12:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:56,127 INFO L93 Difference]: Finished difference Result 339 states and 462 transitions. [2019-08-05 10:12:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:12:56,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-08-05 10:12:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:56,130 INFO L225 Difference]: With dead ends: 339 [2019-08-05 10:12:56,130 INFO L226 Difference]: Without dead ends: 339 [2019-08-05 10:12:56,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:12:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-08-05 10:12:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 303. [2019-08-05 10:12:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-08-05 10:12:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 428 transitions. [2019-08-05 10:12:56,150 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 428 transitions. Word has length 25 [2019-08-05 10:12:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:56,153 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 428 transitions. [2019-08-05 10:12:56,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:12:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 428 transitions. [2019-08-05 10:12:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:12:56,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:56,154 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:56,155 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:56,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1854667335, now seen corresponding path program 1 times [2019-08-05 10:12:56,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:56,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:56,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:56,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:56,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:56,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:56,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:56,211 INFO L87 Difference]: Start difference. First operand 303 states and 428 transitions. Second operand 3 states. [2019-08-05 10:12:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:56,258 INFO L93 Difference]: Finished difference Result 282 states and 390 transitions. [2019-08-05 10:12:56,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:56,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:12:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:56,262 INFO L225 Difference]: With dead ends: 282 [2019-08-05 10:12:56,262 INFO L226 Difference]: Without dead ends: 267 [2019-08-05 10:12:56,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-08-05 10:12:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 257. [2019-08-05 10:12:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-05 10:12:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 355 transitions. [2019-08-05 10:12:56,270 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 355 transitions. Word has length 27 [2019-08-05 10:12:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:56,271 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 355 transitions. [2019-08-05 10:12:56,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 355 transitions. [2019-08-05 10:12:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:12:56,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:56,272 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:56,272 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:56,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1031479941, now seen corresponding path program 1 times [2019-08-05 10:12:56,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:56,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:12:56,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:56,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:56,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:56,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:12:56,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:12:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:12:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:12:56,400 INFO L87 Difference]: Start difference. First operand 257 states and 355 transitions. Second operand 5 states. [2019-08-05 10:12:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:56,882 INFO L93 Difference]: Finished difference Result 467 states and 625 transitions. [2019-08-05 10:12:56,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:12:56,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-08-05 10:12:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:56,886 INFO L225 Difference]: With dead ends: 467 [2019-08-05 10:12:56,886 INFO L226 Difference]: Without dead ends: 463 [2019-08-05 10:12:56,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-08-05 10:12:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 419. [2019-08-05 10:12:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-08-05 10:12:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 567 transitions. [2019-08-05 10:12:56,899 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 567 transitions. Word has length 30 [2019-08-05 10:12:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:56,899 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 567 transitions. [2019-08-05 10:12:56,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:12:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 567 transitions. [2019-08-05 10:12:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:12:56,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:56,902 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:56,902 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:56,902 INFO L82 PathProgramCache]: Analyzing trace with hash 133292730, now seen corresponding path program 1 times [2019-08-05 10:12:56,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:56,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:56,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:12:57,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:57,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:57,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:57,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:57,004 INFO L87 Difference]: Start difference. First operand 419 states and 567 transitions. Second operand 3 states. [2019-08-05 10:12:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:57,220 INFO L93 Difference]: Finished difference Result 530 states and 701 transitions. [2019-08-05 10:12:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:57,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-08-05 10:12:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:57,224 INFO L225 Difference]: With dead ends: 530 [2019-08-05 10:12:57,224 INFO L226 Difference]: Without dead ends: 505 [2019-08-05 10:12:57,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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:12:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-08-05 10:12:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 498. [2019-08-05 10:12:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-08-05 10:12:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 668 transitions. [2019-08-05 10:12:57,237 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 668 transitions. Word has length 37 [2019-08-05 10:12:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:57,237 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 668 transitions. [2019-08-05 10:12:57,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 668 transitions. [2019-08-05 10:12:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:12:57,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:57,244 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:57,245 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:57,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1135242164, now seen corresponding path program 1 times [2019-08-05 10:12:57,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:57,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:57,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:12:57,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:57,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:57,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:57,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:57,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:57,356 INFO L87 Difference]: Start difference. First operand 498 states and 668 transitions. Second operand 3 states. [2019-08-05 10:12:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:57,505 INFO L93 Difference]: Finished difference Result 468 states and 589 transitions. [2019-08-05 10:12:57,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:57,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-08-05 10:12:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:57,509 INFO L225 Difference]: With dead ends: 468 [2019-08-05 10:12:57,509 INFO L226 Difference]: Without dead ends: 468 [2019-08-05 10:12:57,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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:12:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-08-05 10:12:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 442. [2019-08-05 10:12:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-08-05 10:12:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2019-08-05 10:12:57,520 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 38 [2019-08-05 10:12:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:57,521 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2019-08-05 10:12:57,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2019-08-05 10:12:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:12:57,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:57,525 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:57,526 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 2026461761, now seen corresponding path program 1 times [2019-08-05 10:12:57,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:12:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:12:57,621 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:12:57,653 INFO L202 PluginConnector]: Adding new model u2b04_multiple_broadcast_UNSAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:12:57 BoogieIcfgContainer [2019-08-05 10:12:57,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:12:57,656 INFO L168 Benchmark]: Toolchain (without parser) took 4904.07 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 110.5 MB in the beginning and 124.8 MB in the end (delta: -14.4 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:57,657 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:12:57,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.91 ms. Allocated memory is still 141.6 MB. Free memory was 110.5 MB in the beginning and 108.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:57,659 INFO L168 Benchmark]: Boogie Preprocessor took 36.80 ms. Allocated memory is still 141.6 MB. Free memory was 108.5 MB in the beginning and 107.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:57,660 INFO L168 Benchmark]: RCFGBuilder took 1399.05 ms. Allocated memory is still 141.6 MB. Free memory was 107.0 MB in the beginning and 68.7 MB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:57,661 INFO L168 Benchmark]: TraceAbstraction took 3425.53 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 68.5 MB in the beginning and 124.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 6.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:12:57,665 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.91 ms. Allocated memory is still 141.6 MB. Free memory was 110.5 MB in the beginning and 108.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.80 ms. Allocated memory is still 141.6 MB. Free memory was 108.5 MB in the beginning and 107.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1399.05 ms. Allocated memory is still 141.6 MB. Free memory was 107.0 MB in the beginning and 68.7 MB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3425.53 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 68.5 MB in the beginning and 124.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 6.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 119]: assertion can be violated assertion can be violated We found a FailurePath: [L106-L108] requires v == 0; [L106-L109] requires v$new == v; [L106-L110] requires !v$reset; [L113] sync := sync_none; [L114] loc$A1_1 := id2_1; [L115] loc$A2_1 := id6_1; [L116] loc$A3_1 := id8_1; VAL [v=0, v$new=0, v$reset=false] [L119] assert v != 1; [L120] havoc delay; [L121] assume delay >= 0.0; VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L125] COND FALSE !(loc$A1_1 == id0_1) VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L130] COND FALSE !(loc$A1_1 == id1_1) VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L135] COND TRUE loc$A1_1 == id2_1 VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L142] COND FALSE !(loc$A2_1 == id3_1) VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L147] COND FALSE !(loc$A2_1 == id4_1) VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L152] COND FALSE !(loc$A2_1 == id5_1) VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L157] COND TRUE loc$A2_1 == id6_1 VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L164] COND FALSE !(loc$A3_1 == id7_1) VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L169] COND TRUE loc$A3_1 == id8_1 VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L187] assert v != 1; VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L190] COND TRUE sync == sync_none VAL [delay=0.0, v=0, v$new=0, v$reset=false] [L192] COND TRUE loc$A1_1 == id2_1 [L197] loc$A1_1 := id1_1; [L198] FCALL call schedule_reset_v(1); [L199] sync := sync_broadcast; [L200] sync_channel := chan_a; [L201] sender := A1_1; [L273] COND TRUE sender != A2_1 [L275] COND TRUE loc$A2_1 == id6_1 [L280] loc$A2_1 := id5_1; [L281] FCALL call schedule_reset_v(2); [L289] COND TRUE sender != A3_1 [L291] COND TRUE loc$A3_1 == id8_1 [L296] loc$A3_1 := id7_1; [L297] FCALL call schedule_reset_v(3); [L305] FCALL call perform_resets(); [L306] sync := sync_none; VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L119] assert v != 1; [L120] havoc delay; [L121] assume delay >= 0.0; VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L125] COND FALSE !(loc$A1_1 == id0_1) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L130] COND TRUE loc$A1_1 == id1_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L142] COND FALSE !(loc$A2_1 == id3_1) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L147] COND FALSE !(loc$A2_1 == id4_1) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L152] COND TRUE loc$A2_1 == id5_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L164] COND TRUE loc$A3_1 == id7_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L187] assert v != 1; VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L190] COND TRUE sync == sync_none VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L192] COND FALSE !(loc$A1_1 == id2_1) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L204] COND TRUE loc$A1_1 == id1_1 [L209] loc$A1_1 := id0_1; [L210] sync := waiting; [L211] sync_channel := chan_b; [L212] sender := A1_1; VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L232] COND FALSE !(sync == sync_none) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L235] COND TRUE sync == waiting && sender != A2_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L237] COND TRUE loc$A2_1 == id5_1 [L242] assume sync_channel == chan_b; [L243] loc$A2_1 := id4_1; [L244] sync := sync_none; [L245] FCALL call perform_resets(); VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L119] assert v != 1; [L120] havoc delay; [L121] assume delay >= 0.0; VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L125] COND TRUE loc$A1_1 == id0_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L142] COND FALSE !(loc$A2_1 == id3_1) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L147] COND TRUE loc$A2_1 == id4_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L164] COND TRUE loc$A3_1 == id7_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L187] assert v != 1; VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L190] COND TRUE sync == sync_none VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L192] COND FALSE !(loc$A1_1 == id2_1) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L204] COND FALSE !(loc$A1_1 == id1_1) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L215] COND TRUE loc$A1_1 == id0_1 [L220] loc$A1_1 := id2_1; [L221] sync := sync_broadcast; [L222] sync_channel := chan_c; [L223] sender := A1_1; [L312] COND TRUE sender != A2_1 [L314] COND TRUE loc$A2_1 == id4_1 [L319] loc$A2_1 := id3_1; [L327] COND TRUE sender != A3_1 [L329] COND FALSE !(loc$A3_1 == id9_1) [L342] FCALL call perform_resets(); [L343] sync := sync_none; VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L119] assert v != 1; [L120] havoc delay; [L121] assume delay >= 0.0; VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L125] COND FALSE !(loc$A1_1 == id0_1) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L130] COND FALSE !(loc$A1_1 == id1_1) VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L135] COND TRUE loc$A1_1 == id2_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L142] COND TRUE loc$A2_1 == id3_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L164] COND TRUE loc$A3_1 == id7_1 VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L187] assert v != 1; VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L190] COND TRUE sync == sync_none VAL [delay=0.0, v=3, v$new=3, v$reset=false] [L192] COND TRUE loc$A1_1 == id2_1 [L197] loc$A1_1 := id1_1; [L198] FCALL call schedule_reset_v(1); [L199] sync := sync_broadcast; [L200] sync_channel := chan_a; [L201] sender := A1_1; [L273] COND TRUE sender != A2_1 [L275] COND FALSE !(loc$A2_1 == id6_1) [L289] COND TRUE sender != A3_1 [L291] COND FALSE !(loc$A3_1 == id8_1) [L305] FCALL call perform_resets(); [L306] sync := sync_none; VAL [delay=0.0, v=1, v$new=1, v$reset=false] [L119] assert v != 1; VAL [delay=0.0, v=1, v$new=1, v$reset=false] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 2 error locations. UNSAFE Result, 3.3s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 562 SDtfs, 394 SDslu, 414 SDs, 0 SdLazy, 219 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 197 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498occurred in iteration=10, 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, 11 MinimizatonAttempts, 199 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 12000 SizeOfPredicates, 15 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 84/101 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...