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/concurrent/concurrentBoogie/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:52:05,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:52:05,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:52:05,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:52:05,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:52:05,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:52:05,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:52:05,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:52:05,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:52:05,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:52:05,329 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:52:05,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:52:05,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:52:05,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:52:05,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:52:05,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:52:05,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:52:05,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:52:05,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:52:05,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:52:05,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:52:05,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:52:05,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:52:05,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:52:05,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:52:05,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:52:05,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:52:05,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:52:05,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:52:05,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:52:05,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:52:05,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:52:05,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:52:05,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:52:05,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:52:05,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:52:05,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:52:05,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:52:05,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:52:05,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:52:05,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:52:05,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:52:05,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:52:05,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:52:05,441 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:52:05,442 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:52:05,443 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/showcase/FischerWithBug.bpl [2019-08-05 09:52:05,443 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/showcase/FischerWithBug.bpl' [2019-08-05 09:52:05,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:52:05,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:52:05,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:05,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:52:05,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:52:05,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:05,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:52:05,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:52:05,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:52:05,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... [2019-08-05 09:52:05,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:52:05,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:52:05,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:52:05,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:52:05,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 09:52:05,652 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2019-08-05 09:52:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2019-08-05 09:52:05,653 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2019-08-05 09:52:05,653 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2019-08-05 09:52:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2019-08-05 09:52:05,653 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2019-08-05 09:52:05,654 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 09:52:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 09:52:05,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 09:52:05,655 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2019-08-05 09:52:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2019-08-05 09:52:05,655 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2019-08-05 09:52:05,657 WARN L201 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-08-05 09:52:06,096 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 09:52:06,096 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 09:52:06,097 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:06 BoogieIcfgContainer [2019-08-05 09:52:06,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:52:06,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:52:06,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:52:06,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:52:06,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:05" (1/2) ... [2019-08-05 09:52:06,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb19ba3 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:52:06, skipping insertion in model container [2019-08-05 09:52:06,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:06" (2/2) ... [2019-08-05 09:52:06,106 INFO L109 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2019-08-05 09:52:06,137 WARN L317 ript$VariableManager]: TermVariabe Thread2_Process2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,138 WARN L317 ript$VariableManager]: TermVariabe Thread2_Process2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,138 WARN L317 ript$VariableManager]: TermVariabe Thread2_Process2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,138 WARN L317 ript$VariableManager]: TermVariabe Thread2_Process2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,139 WARN L317 ript$VariableManager]: TermVariabe Thread1_Process1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,140 WARN L317 ript$VariableManager]: TermVariabe Thread1_Process1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,140 WARN L317 ript$VariableManager]: TermVariabe Thread1_Process1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,141 WARN L317 ript$VariableManager]: TermVariabe Thread1_Process1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:06,186 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:52:06,194 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-05 09:52:06,211 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-05 09:52:06,241 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:52:06,241 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:52:06,242 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:52:06,242 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:52:06,242 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:52:06,244 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:52:06,244 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:52:06,244 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:52:06,244 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:52:06,258 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42places, 43 transitions [2019-08-05 09:52:06,370 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1403 states. [2019-08-05 09:52:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states. [2019-08-05 09:52:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 09:52:06,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:06,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:06,390 INFO L418 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:06,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1128357390, now seen corresponding path program 1 times [2019-08-05 09:52:06,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:06,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:06,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:06,550 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 09:52:06,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:06,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 09:52:06,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:06,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:06,569 INFO L87 Difference]: Start difference. First operand 1403 states. Second operand 3 states. [2019-08-05 09:52:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:06,687 INFO L93 Difference]: Finished difference Result 398 states and 1386 transitions. [2019-08-05 09:52:06,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:06,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 09:52:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:06,711 INFO L225 Difference]: With dead ends: 398 [2019-08-05 09:52:06,711 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 09:52:06,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 09:52:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 09:52:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 394. [2019-08-05 09:52:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-08-05 09:52:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2019-08-05 09:52:06,850 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 8 [2019-08-05 09:52:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:06,853 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2019-08-05 09:52:06,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2019-08-05 09:52:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 09:52:06,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:06,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:06,863 INFO L418 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:06,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:06,864 INFO L82 PathProgramCache]: Analyzing trace with hash 418067219, now seen corresponding path program 1 times [2019-08-05 09:52:06,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:06,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:06,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:06,925 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 09:52:06,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:06,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:06,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:06,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:06,928 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand 3 states. [2019-08-05 09:52:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,044 INFO L93 Difference]: Finished difference Result 619 states and 2131 transitions. [2019-08-05 09:52:07,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:07,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 09:52:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,052 INFO L225 Difference]: With dead ends: 619 [2019-08-05 09:52:07,052 INFO L226 Difference]: Without dead ends: 523 [2019-08-05 09:52:07,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 09:52:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-08-05 09:52:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 403. [2019-08-05 09:52:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-08-05 09:52:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1343 transitions. [2019-08-05 09:52:07,081 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1343 transitions. Word has length 12 [2019-08-05 09:52:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,081 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 1343 transitions. [2019-08-05 09:52:07,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1343 transitions. [2019-08-05 09:52:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 09:52:07,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:07,084 INFO L418 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash 930174509, now seen corresponding path program 2 times [2019-08-05 09:52:07,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,125 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 09:52:07,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:07,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:07,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:07,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,127 INFO L87 Difference]: Start difference. First operand 403 states and 1343 transitions. Second operand 3 states. [2019-08-05 09:52:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,258 INFO L93 Difference]: Finished difference Result 511 states and 1701 transitions. [2019-08-05 09:52:07,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:07,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 09:52:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,263 INFO L225 Difference]: With dead ends: 511 [2019-08-05 09:52:07,265 INFO L226 Difference]: Without dead ends: 511 [2019-08-05 09:52:07,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 09:52:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-08-05 09:52:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 459. [2019-08-05 09:52:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-08-05 09:52:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1523 transitions. [2019-08-05 09:52:07,298 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1523 transitions. Word has length 12 [2019-08-05 09:52:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,299 INFO L475 AbstractCegarLoop]: Abstraction has 459 states and 1523 transitions. [2019-08-05 09:52:07,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1523 transitions. [2019-08-05 09:52:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 09:52:07,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,303 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 09:52:07,304 INFO L418 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2010263990, now seen corresponding path program 1 times [2019-08-05 09:52:07,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,342 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 09:52:07,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:07,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:07,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:07,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,344 INFO L87 Difference]: Start difference. First operand 459 states and 1523 transitions. Second operand 3 states. [2019-08-05 09:52:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,458 INFO L93 Difference]: Finished difference Result 531 states and 1759 transitions. [2019-08-05 09:52:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:07,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 09:52:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,464 INFO L225 Difference]: With dead ends: 531 [2019-08-05 09:52:07,464 INFO L226 Difference]: Without dead ends: 531 [2019-08-05 09:52:07,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-08-05 09:52:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 507. [2019-08-05 09:52:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-08-05 09:52:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1675 transitions. [2019-08-05 09:52:07,483 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1675 transitions. Word has length 19 [2019-08-05 09:52:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,484 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 1675 transitions. [2019-08-05 09:52:07,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1675 transitions. [2019-08-05 09:52:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 09:52:07,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,489 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 09:52:07,489 INFO L418 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1368677934, now seen corresponding path program 1 times [2019-08-05 09:52:07,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,580 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 09:52:07,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:07,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:07,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:07,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,582 INFO L87 Difference]: Start difference. First operand 507 states and 1675 transitions. Second operand 3 states. [2019-08-05 09:52:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:07,727 INFO L93 Difference]: Finished difference Result 543 states and 1776 transitions. [2019-08-05 09:52:07,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:07,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 09:52:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:07,732 INFO L225 Difference]: With dead ends: 543 [2019-08-05 09:52:07,733 INFO L226 Difference]: Without dead ends: 447 [2019-08-05 09:52:07,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-08-05 09:52:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 423. [2019-08-05 09:52:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-08-05 09:52:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1364 transitions. [2019-08-05 09:52:07,750 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1364 transitions. Word has length 19 [2019-08-05 09:52:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:07,750 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 1364 transitions. [2019-08-05 09:52:07,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:07,751 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1364 transitions. [2019-08-05 09:52:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 09:52:07,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:07,753 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:07,753 INFO L418 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:07,753 INFO L82 PathProgramCache]: Analyzing trace with hash -335188387, now seen corresponding path program 1 times [2019-08-05 09:52:07,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:07,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:07,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:07,874 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 09:52:07,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:07,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 09:52:07,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:07,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:07,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:07,876 INFO L87 Difference]: Start difference. First operand 423 states and 1364 transitions. Second operand 4 states. [2019-08-05 09:52:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:08,164 INFO L93 Difference]: Finished difference Result 443 states and 1406 transitions. [2019-08-05 09:52:08,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:08,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-08-05 09:52:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:08,170 INFO L225 Difference]: With dead ends: 443 [2019-08-05 09:52:08,170 INFO L226 Difference]: Without dead ends: 443 [2019-08-05 09:52:08,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-08-05 09:52:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-08-05 09:52:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-08-05 09:52:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1406 transitions. [2019-08-05 09:52:08,189 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1406 transitions. Word has length 26 [2019-08-05 09:52:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:08,190 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 1406 transitions. [2019-08-05 09:52:08,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1406 transitions. [2019-08-05 09:52:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 09:52:08,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:08,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:08,192 INFO L418 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:08,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:08,193 INFO L82 PathProgramCache]: Analyzing trace with hash 310426618, now seen corresponding path program 1 times [2019-08-05 09:52:08,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:08,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:08,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:08,288 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 09:52:08,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:08,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 09:52:08,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:08,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:08,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:08,290 INFO L87 Difference]: Start difference. First operand 443 states and 1406 transitions. Second operand 4 states. [2019-08-05 09:52:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:08,475 INFO L93 Difference]: Finished difference Result 464 states and 1450 transitions. [2019-08-05 09:52:08,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:08,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-08-05 09:52:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:08,484 INFO L225 Difference]: With dead ends: 464 [2019-08-05 09:52:08,484 INFO L226 Difference]: Without dead ends: 464 [2019-08-05 09:52:08,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 09:52:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-08-05 09:52:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-08-05 09:52:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-08-05 09:52:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1450 transitions. [2019-08-05 09:52:08,500 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1450 transitions. Word has length 27 [2019-08-05 09:52:08,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:08,501 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 1450 transitions. [2019-08-05 09:52:08,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1450 transitions. [2019-08-05 09:52:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 09:52:08,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:08,503 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:08,504 INFO L418 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:08,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1090367921, now seen corresponding path program 2 times [2019-08-05 09:52:08,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 09:52:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 09:52:08,581 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 09:52:08,605 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-08-05 09:52:08,607 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:52:08 BasicIcfg [2019-08-05 09:52:08,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:52:08,612 INFO L168 Benchmark]: Toolchain (without parser) took 3112.65 ms. Allocated memory was 140.0 MB in the beginning and 177.7 MB in the end (delta: 37.7 MB). Free memory was 109.6 MB in the beginning and 47.3 MB in the end (delta: 62.3 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:08,613 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 09:52:08,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.52 ms. Allocated memory is still 140.0 MB. Free memory was 109.4 MB in the beginning and 107.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:08,615 INFO L168 Benchmark]: Boogie Preprocessor took 31.82 ms. Allocated memory is still 140.0 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:08,616 INFO L168 Benchmark]: RCFGBuilder took 524.82 ms. Allocated memory is still 140.0 MB. Free memory was 106.5 MB in the beginning and 93.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:08,617 INFO L168 Benchmark]: TraceAbstraction took 2509.68 ms. Allocated memory was 140.0 MB in the beginning and 177.7 MB in the end (delta: 37.7 MB). Free memory was 93.2 MB in the beginning and 47.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:08,632 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 140.0 MB. Free memory was 110.8 MB in the beginning and 110.6 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 41.52 ms. Allocated memory is still 140.0 MB. Free memory was 109.4 MB in the beginning and 107.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.82 ms. Allocated memory is still 140.0 MB. Free memory was 107.7 MB in the beginning and 106.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 524.82 ms. Allocated memory is still 140.0 MB. Free memory was 106.5 MB in the beginning and 93.4 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2509.68 ms. Allocated memory was 140.0 MB in the beginning and 177.7 MB in the end (delta: 37.7 MB). Free memory was 93.2 MB in the beginning and 47.3 MB in the end (delta: 45.9 MB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 66]: assertion can be violated assertion can be violated We found a FailurePath: [L28] -1 critical := 0; VAL [critical=0] [L29] -1 clk := 0; VAL [clk=0, critical=0] [L30] -1 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] -1 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK -1 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK -1 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 0 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 0 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L36] FORK -1 fork 2 Process2(); VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 1 lock != 2 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 1 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L59] 0 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 1 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L81] 1 lock := 2; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 1 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 1 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L44] 2 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L84] 1 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L85] 1 assume lock == 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L60] 0 lock := 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L61] 0 assume clk <= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L62] 0 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L44] 2 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L63] 0 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L64] 0 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L87] 1 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L88] 1 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L66] 0 assert critical == 0; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=1, wait=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 4 error locations. UNSAFE Result, 2.3s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 306 SDtfs, 150 SDslu, 171 SDs, 0 SdLazy, 84 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred in iteration=0, 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 224 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 4462 SizeOfPredicates, 10 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...