Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r500-smll-171649587400084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is HirschbergSinclair-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587400084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 13 03:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 03:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 03:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 284K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717240767958

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:19:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:19:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:19:29] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-06-01 11:19:29] [INFO ] Transformed 530 places.
[2024-06-01 11:19:29] [INFO ] Transformed 485 transitions.
[2024-06-01 11:19:29] [INFO ] Parsed PT model containing 530 places and 485 transitions and 1479 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-20-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 485/485 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 510 transition count 485
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 36 place count 494 transition count 469
Iterating global reduction 1 with 16 rules applied. Total rules applied 52 place count 494 transition count 469
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 67 place count 479 transition count 454
Iterating global reduction 1 with 15 rules applied. Total rules applied 82 place count 479 transition count 454
Applied a total of 82 rules in 271 ms. Remains 479 /530 variables (removed 51) and now considering 454/485 (removed 31) transitions.
// Phase 1: matrix 454 rows 479 cols
[2024-06-01 11:19:30] [INFO ] Computed 25 invariants in 48 ms
[2024-06-01 11:19:31] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-06-01 11:19:31] [INFO ] Invariant cache hit.
[2024-06-01 11:19:33] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3229 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-06-01 11:19:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 20/479 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (OVERLAPS) 454/933 variables, 479/504 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 933/933 variables, and 504 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30056 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/459 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/459 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 20/479 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (OVERLAPS) 454/933 variables, 479/504 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/933 variables, 434/938 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/933 variables, and 938 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints]
After SMT, in 60553ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60598ms
Starting structural reductions in LTL mode, iteration 1 : 479/530 places, 454/485 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64148 ms. Remains : 479/530 places, 454/485 transitions.
Support contains 44 out of 479 places after structural reductions.
[2024-06-01 11:20:34] [INFO ] Flatten gal took : 92 ms
[2024-06-01 11:20:34] [INFO ] Flatten gal took : 44 ms
[2024-06-01 11:20:35] [INFO ] Input system was already deterministic with 454 transitions.
RANDOM walk for 40000 steps (80 resets) in 1256 ms. (31 steps per ms) remains 1/37 properties
BEST_FIRST walk for 40002 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
[2024-06-01 11:20:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 293/296 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/437 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 454/891 variables, 437/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/933 variables, 42/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/933 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 519 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 293/296 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 141/437 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 454/891 variables, 437/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/933 variables, 42/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/933 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/933 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 505 constraints, problems are : Problem set: 0 solved, 1 unsolved in 566 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 479/479 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1103ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 179 ms.
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 454/454 transitions.
Graph (complete) has 912 edges and 479 vertex of which 473 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 197 rules applied. Total rules applied 198 place count 473 transition count 257
Reduce places removed 191 places and 0 transitions.
Graph (complete) has 498 edges and 282 vertex of which 248 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 192 rules applied. Total rules applied 390 place count 248 transition count 257
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 424 place count 248 transition count 223
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 426 place count 246 transition count 221
Iterating global reduction 3 with 2 rules applied. Total rules applied 428 place count 246 transition count 221
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 429 place count 246 transition count 220
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 431 edges and 245 vertex of which 243 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 431 place count 243 transition count 220
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 433 place count 243 transition count 218
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 434 place count 242 transition count 217
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 242 transition count 217
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 449 place count 242 transition count 203
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 463 place count 228 transition count 203
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 482 place count 209 transition count 184
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 7 with 45 rules applied. Total rules applied 527 place count 203 transition count 145
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 566 place count 164 transition count 145
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 15 Pre rules applied. Total rules applied 566 place count 164 transition count 130
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 596 place count 149 transition count 130
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 597 place count 148 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 597 place count 148 transition count 129
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 599 place count 147 transition count 129
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 605 place count 144 transition count 126
Applied a total of 605 rules in 131 ms. Remains 144 /479 variables (removed 335) and now considering 126/454 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 144/479 places, 126/454 transitions.
RANDOM walk for 40000 steps (312 resets) in 384 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (98 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 35026 steps, run visited all 1 properties in 187 ms. (steps per millisecond=187 )
Probabilistic random walk after 35026 steps, saw 9666 distinct states, run finished after 194 ms. (steps per millisecond=180 ) properties seen :1
FORMULA HirschbergSinclair-PT-20-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-20-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 479 stabilizing places and 454 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 479 transition count 454
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&F(p1))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 78 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2024-06-01 11:20:38] [INFO ] Computed 25 invariants in 8 ms
[2024-06-01 11:20:38] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-06-01 11:20:38] [INFO ] Invariant cache hit.
[2024-06-01 11:20:40] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 2752 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 11:20:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 495 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 425/920 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 920 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63067 ms. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 521 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-00 finished in 63802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p1||X(F(p2))))))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 64 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
[2024-06-01 11:21:41] [INFO ] Invariant cache hit.
[2024-06-01 11:21:42] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-06-01 11:21:42] [INFO ] Invariant cache hit.
[2024-06-01 11:21:43] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 11:21:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 495 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 425/920 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 920 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62481 ms. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 832 ms.
Product exploration explored 100000 steps with 50000 reset in 440 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-02 finished in 64226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 20 places and 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 459 transition count 232
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 404 place count 257 transition count 232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 252 transition count 227
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 252 transition count 227
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 415 place count 252 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 416 place count 251 transition count 226
Applied a total of 416 rules in 58 ms. Remains 251 /479 variables (removed 228) and now considering 226/454 (removed 228) transitions.
// Phase 1: matrix 226 rows 251 cols
[2024-06-01 11:22:45] [INFO ] Computed 25 invariants in 2 ms
[2024-06-01 11:22:46] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-06-01 11:22:46] [INFO ] Invariant cache hit.
[2024-06-01 11:22:47] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2024-06-01 11:22:47] [INFO ] Redundant transitions in 15 ms returned []
Running 187 sub problems to find dead transitions.
[2024-06-01 11:22:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 2/214 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 189/403 variables, 214/239 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/477 variables, and 239 constraints, problems are : Problem set: 0 solved, 187 unsolved in 13916 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 214/251 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 2/214 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 189/403 variables, 214/239 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 187/426 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/477 variables, and 426 constraints, problems are : Problem set: 0 solved, 187 unsolved in 13377 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 214/251 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 27335ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 27342ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/479 places, 226/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28690 ms. Remains : 251/479 places, 226/454 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-03
Stuttering criterion allowed to conclude after 1895 steps with 8 reset in 5 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-03 finished in 28748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 20 places and 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 459 transition count 232
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 1 with 202 rules applied. Total rules applied 404 place count 257 transition count 232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 252 transition count 227
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 252 transition count 227
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 415 place count 252 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 416 place count 251 transition count 226
Applied a total of 416 rules in 52 ms. Remains 251 /479 variables (removed 228) and now considering 226/454 (removed 228) transitions.
// Phase 1: matrix 226 rows 251 cols
[2024-06-01 11:23:14] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 11:23:15] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-06-01 11:23:15] [INFO ] Invariant cache hit.
[2024-06-01 11:23:16] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2024-06-01 11:23:16] [INFO ] Redundant transitions in 15 ms returned []
Running 187 sub problems to find dead transitions.
[2024-06-01 11:23:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 2/214 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 189/403 variables, 214/239 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/477 variables, and 239 constraints, problems are : Problem set: 0 solved, 187 unsolved in 13947 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 214/251 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 2/214 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 189/403 variables, 214/239 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 187/426 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/477 variables, and 426 constraints, problems are : Problem set: 0 solved, 187 unsolved in 17998 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 214/251 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 31990ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 31995ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/479 places, 226/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33572 ms. Remains : 251/479 places, 226/454 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-05
Product exploration explored 100000 steps with 407 reset in 428 ms.
Product exploration explored 100000 steps with 407 reset in 448 ms.
Computed a total of 251 stabilizing places and 226 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 251 transition count 226
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-05 finished in 34648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p1)&&p0)) U X((F(p3)&&p2))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 450
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 472 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 472 transition count 447
Applied a total of 14 rules in 52 ms. Remains 472 /479 variables (removed 7) and now considering 447/454 (removed 7) transitions.
// Phase 1: matrix 447 rows 472 cols
[2024-06-01 11:23:49] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 11:23:49] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-06-01 11:23:49] [INFO ] Invariant cache hit.
[2024-06-01 11:23:51] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-01 11:23:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 919/919 variables, and 497 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/919 variables, 427/924 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 919/919 variables, and 924 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 472/479 places, 447/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62305 ms. Remains : 472/479 places, 447/454 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-08 finished in 62681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 450
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 472 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 472 transition count 447
Applied a total of 14 rules in 47 ms. Remains 472 /479 variables (removed 7) and now considering 447/454 (removed 7) transitions.
// Phase 1: matrix 447 rows 472 cols
[2024-06-01 11:24:52] [INFO ] Computed 25 invariants in 6 ms
[2024-06-01 11:24:52] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-06-01 11:24:52] [INFO ] Invariant cache hit.
[2024-06-01 11:24:54] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned []
Implicit Place search using SMT with State Equation took 2850 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-01 11:24:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 919/919 variables, and 497 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 20/472 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 447/919 variables, 472/497 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/919 variables, 427/924 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 919/919 variables, and 924 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in LTL mode, iteration 1 : 472/479 places, 447/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63111 ms. Remains : 472/479 places, 447/454 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-09
Entered a terminal (fully accepting) state of product in 49 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-09 finished in 63305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 36 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2024-06-01 11:25:55] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 11:25:55] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-06-01 11:25:55] [INFO ] Invariant cache hit.
[2024-06-01 11:25:57] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 11:25:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 495 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 425/920 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 920 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62306 ms. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-10
Product exploration explored 100000 steps with 206 reset in 347 ms.
Product exploration explored 100000 steps with 206 reset in 393 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-10 finished in 63535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(!p1)))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 470 transition count 445
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 49 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
[2024-06-01 11:26:58] [INFO ] Invariant cache hit.
[2024-06-01 11:26:59] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-06-01 11:26:59] [INFO ] Invariant cache hit.
[2024-06-01 11:27:01] [INFO ] Implicit Places using invariants and state equation in 1870 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 11:27:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 915/915 variables, and 495 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 20/470 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 445/915 variables, 470/495 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 425/920 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 920 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 470/470 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62571 ms. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 234 ms :[p1, p1, p1, true, p0]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 496 ms.
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 24 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-11 finished in 63949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||(p2&&X(p3)))))'
Support contains 6 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 450
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 471 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 471 transition count 446
Applied a total of 16 rules in 51 ms. Remains 471 /479 variables (removed 8) and now considering 446/454 (removed 8) transitions.
// Phase 1: matrix 446 rows 471 cols
[2024-06-01 11:28:02] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 11:28:03] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-06-01 11:28:03] [INFO ] Invariant cache hit.
[2024-06-01 11:28:05] [INFO ] Implicit Places using invariants and state equation in 2377 ms returned []
Implicit Place search using SMT with State Equation took 2963 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-06-01 11:28:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/917 variables, and 496 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 426/922 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/917 variables, and 922 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Starting structural reductions in LTL mode, iteration 1 : 471/479 places, 446/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63251 ms. Remains : 471/479 places, 446/454 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 536 ms.
Product exploration explored 100000 steps with 33333 reset in 467 ms.
Computed a total of 471 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 471 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (F (G p3)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 19 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-20-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-12 finished in 64790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&(p1||F(p2))))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 450
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 471 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 471 transition count 446
Applied a total of 16 rules in 34 ms. Remains 471 /479 variables (removed 8) and now considering 446/454 (removed 8) transitions.
[2024-06-01 11:29:07] [INFO ] Invariant cache hit.
[2024-06-01 11:29:08] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-06-01 11:29:08] [INFO ] Invariant cache hit.
[2024-06-01 11:29:10] [INFO ] Implicit Places using invariants and state equation in 2112 ms returned []
Implicit Place search using SMT with State Equation took 2614 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-06-01 11:29:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 2.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/917 variables, and 496 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 426/922 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/917 variables, and 922 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 471/479 places, 446/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62828 ms. Remains : 471/479 places, 446/454 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-13
Entered a terminal (fully accepting) state of product in 166 steps with 1 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-13 finished in 63038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(p1)&&F(G(p0)))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 471 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 471 transition count 446
Applied a total of 16 rules in 30 ms. Remains 471 /479 variables (removed 8) and now considering 446/454 (removed 8) transitions.
// Phase 1: matrix 446 rows 471 cols
[2024-06-01 11:30:10] [INFO ] Computed 25 invariants in 5 ms
[2024-06-01 11:30:10] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-06-01 11:30:10] [INFO ] Invariant cache hit.
[2024-06-01 11:30:12] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-06-01 11:30:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/917 variables, and 496 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 20/471 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 446/917 variables, 471/496 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/917 variables, 426/922 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/917 variables, and 922 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 471/479 places, 446/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62198 ms. Remains : 471/479 places, 446/454 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, true, true, (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-14
Entered a terminal (fully accepting) state of product in 34 steps with 2 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-14 finished in 62388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||(p0&&G(p1)))) U (p0&&G(p2))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 19 places and 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 460 transition count 234
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 259 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 406 place count 255 transition count 230
Iterating global reduction 2 with 4 rules applied. Total rules applied 410 place count 255 transition count 230
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 411 place count 255 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 412 place count 254 transition count 229
Applied a total of 412 rules in 32 ms. Remains 254 /479 variables (removed 225) and now considering 229/454 (removed 225) transitions.
// Phase 1: matrix 229 rows 254 cols
[2024-06-01 11:31:13] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 11:31:13] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-06-01 11:31:13] [INFO ] Invariant cache hit.
[2024-06-01 11:31:13] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 11:31:14] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2024-06-01 11:31:14] [INFO ] Redundant transitions in 5 ms returned []
Running 193 sub problems to find dead transitions.
[2024-06-01 11:31:14] [INFO ] Invariant cache hit.
[2024-06-01 11:31:14] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 3/221 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 197/418 variables, 221/246 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 11/257 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 1/419 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/419 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/483 variables, and 258 constraints, problems are : Problem set: 0 solved, 193 unsolved in 22489 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 222/254 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 3/221 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 197/418 variables, 221/246 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 11/257 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 193/450 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 1/419 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 0/419 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/483 variables, and 451 constraints, problems are : Problem set: 0 solved, 193 unsolved in 24172 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 222/254 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 46696ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 46700ms
Starting structural reductions in SI_LTL mode, iteration 1 : 254/479 places, 229/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48195 ms. Remains : 254/479 places, 229/454 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-15
Entered a terminal (fully accepting) state of product in 201 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-15 finished in 48453 ms.
All properties solved by simple procedures.
Total runtime 751787 ms.
ITS solved all properties within timeout

BK_STOP 1717241521799

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649587400084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-20.tgz
mv HirschbergSinclair-PT-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;