Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654446000467.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-PT-S05J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:43 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 PolyORBNT-PT-S05J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J60-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716888085857

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:21:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 09:21:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:21:27] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2024-05-28 09:21:28] [INFO ] Transformed 909 places.
[2024-05-28 09:21:28] [INFO ] Transformed 1970 transitions.
[2024-05-28 09:21:28] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 693 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 519 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Applied a total of 5 rules in 132 ms. Remains 904 /909 variables (removed 5) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-05-28 09:21:28] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2024-05-28 09:21:29] [INFO ] Computed 137 invariants in 127 ms
[2024-05-28 09:21:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 44056ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 44169ms
[2024-05-28 09:22:12] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 09:22:12] [INFO ] Invariant cache hit.
[2024-05-28 09:22:13] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-28 09:22:13] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 09:22:13] [INFO ] Invariant cache hit.
[2024-05-28 09:22:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:22:17] [INFO ] Implicit Places using invariants and state equation in 3709 ms returned []
Implicit Place search using SMT with State Equation took 4352 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-05-28 09:22:17] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 09:22:17] [INFO ] Invariant cache hit.
[2024-05-28 09:22:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD267 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD949 is UNSAT
At refinement iteration 3 (OVERLAPS) 6/904 variables, 6/137 constraints. Problems are: Problem set: 32 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/2215 variables, and 137 constraints, problems are : Problem set: 32 solved, 1277 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 63050ms problems are : Problem set: 32 solved, 1277 unsolved
Search for dead transitions found 32 dead transitions in 63081ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 904/909 places, 1283/1315 transitions.
Applied a total of 0 rules in 17 ms. Remains 904 /904 variables (removed 0) and now considering 1283/1283 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111870 ms. Remains : 904/909 places, 1283/1315 transitions.
Support contains 519 out of 904 places after structural reductions.
[2024-05-28 09:23:21] [INFO ] Flatten gal took : 281 ms
[2024-05-28 09:23:21] [INFO ] Flatten gal took : 125 ms
[2024-05-28 09:23:21] [INFO ] Input system was already deterministic with 1283 transitions.
Support contains 518 out of 904 places (down from 519) after GAL structural reductions.
RANDOM walk for 40000 steps (2789 resets) in 2192 ms. (18 steps per ms) remains 8/25 properties
BEST_FIRST walk for 40004 steps (491 resets) in 478 ms. (83 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (549 resets) in 341 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (993 resets) in 326 ms. (122 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (545 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (55 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (426 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (409 resets) in 221 ms. (180 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1212 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
[2024-05-28 09:23:23] [INFO ] Flow matrix only has 1279 transitions (discarded 4 similar events)
// Phase 1: matrix 1279 rows 904 cols
[2024-05-28 09:23:23] [INFO ] Computed 137 invariants in 72 ms
[2024-05-28 09:23:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 727/797 variables, 110/110 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/797 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 3 (OVERLAPS) 104/901 variables, 25/135 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/135 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/903 variables, 2/137 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/137 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1279/2182 variables, 903/1040 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2182 variables, 1/1041 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2182 variables, 0/1041 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2183 variables, 1/1042 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2183 variables, 0/1042 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2183 variables, 0/1042 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2183/2183 variables, and 1042 constraints, problems are : Problem set: 7 solved, 1 unsolved in 1509 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 904/904 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/197 variables, 2/3 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/479 variables, 47/50 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/50 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 235/714 variables, 47/97 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/714 variables, 0/97 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 888/2183 variables, and 122 constraints, problems are : Problem set: 8 solved, 0 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 97/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1971ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p0))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1283/1283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1282
Applied a total of 2 rules in 99 ms. Remains 903 /904 variables (removed 1) and now considering 1282/1283 (removed 1) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 09:23:25] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
// Phase 1: matrix 1278 rows 903 cols
[2024-05-28 09:23:25] [INFO ] Computed 137 invariants in 38 ms
[2024-05-28 09:23:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)timeout

(s197 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2181 variables, and 131 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2181 variables, and 131 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 0/0 constraints]
After SMT, in 43026ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 43070ms
[2024-05-28 09:24:08] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:24:08] [INFO ] Invariant cache hit.
[2024-05-28 09:24:10] [INFO ] Implicit Places using invariants in 1669 ms returned []
[2024-05-28 09:24:10] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:24:10] [INFO ] Invariant cache hit.
[2024-05-28 09:24:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:24:29] [INFO ] Implicit Places using invariants and state equation in 18751 ms returned []
Implicit Place search using SMT with State Equation took 20433 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 09:24:29] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:24:29] [INFO ] Invariant cache hit.
[2024-05-28 09:24:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2181 variables, and 131 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 09:25:05] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 24 ms to minimize.
[2024-05-28 09:25:10] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 3 ms to minimize.
[2024-05-28 09:25:10] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 4 ms to minimize.
[2024-05-28 09:25:14] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2181 variables, and 135 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 4/4 constraints]
After SMT, in 62753ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 62764ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1282/1283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126377 ms. Remains : 903/904 places, 1282/1283 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 478 ms.
Product exploration explored 100000 steps with 33333 reset in 504 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 27 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-01 finished in 127685 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) U p1) U (F((p2 U p3))&&p2)))'
Support contains 125 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1283/1283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1282
Applied a total of 2 rules in 124 ms. Remains 903 /904 variables (removed 1) and now considering 1282/1283 (removed 1) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 09:25:33] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:25:33] [INFO ] Invariant cache hit.
[2024-05-28 09:25:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2181 variables, and 131 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 09:25:58] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 2 ms to minimize.
[2024-05-28 09:26:03] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 2 ms to minimize.
[2024-05-28 09:26:03] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 2 ms to minimize.
[2024-05-28 09:26:07] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2181 variables, and 135 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 4/4 constraints]
After SMT, in 42466ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 42501ms
[2024-05-28 09:26:15] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:26:15] [INFO ] Invariant cache hit.
[2024-05-28 09:26:17] [INFO ] Implicit Places using invariants in 1281 ms returned []
[2024-05-28 09:26:17] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:26:17] [INFO ] Invariant cache hit.
[2024-05-28 09:26:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:26:31] [INFO ] Implicit Places using invariants and state equation in 14235 ms returned []
Implicit Place search using SMT with State Equation took 15521 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 09:26:31] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:26:31] [INFO ] Invariant cache hit.
[2024-05-28 09:26:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
SMT process timed out in 32843ms, After SMT, problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 32863ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1282/1283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91031 ms. Remains : 903/904 places, 1282/1283 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p3), true]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-04
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-04 finished in 91208 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(p0)))'
Support contains 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1283/1283 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1217
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1217
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1152
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1151
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1149
Applied a total of 268 rules in 268 ms. Remains 770 /904 variables (removed 134) and now considering 1149/1283 (removed 134) transitions.
Running 1143 sub problems to find dead transitions.
[2024-05-28 09:27:04] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
// Phase 1: matrix 1145 rows 770 cols
[2024-05-28 09:27:04] [INFO ] Computed 137 invariants in 25 ms
[2024-05-28 09:27:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 (/ 1.0 2.0))
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 3.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1915 variables, and 132 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1143/1143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-05-28 09:27:31] [INFO ] Deduced a trap composed of 336 places in 384 ms of which 6 ms to minimize.
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 133 places in 313 ms of which 4 ms to minimize.
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 252 places in 287 ms of which 4 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 248 places in 307 ms of which 4 ms to minimize.
[2024-05-28 09:27:39] [INFO ] Deduced a trap composed of 246 places in 299 ms of which 5 ms to minimize.
[2024-05-28 09:27:40] [INFO ] Deduced a trap composed of 326 places in 282 ms of which 4 ms to minimize.
[2024-05-28 09:27:43] [INFO ] Deduced a trap composed of 346 places in 311 ms of which 5 ms to minimize.
[2024-05-28 09:27:44] [INFO ] Deduced a trap composed of 256 places in 276 ms of which 4 ms to minimize.
[2024-05-28 09:27:45] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1915 variables, and 142 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1143 constraints, Known Traps: 10/10 constraints]
After SMT, in 42926ms problems are : Problem set: 0 solved, 1143 unsolved
Search for dead transitions found 0 dead transitions in 42935ms
[2024-05-28 09:27:47] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 09:27:47] [INFO ] Invariant cache hit.
[2024-05-28 09:27:48] [INFO ] Implicit Places using invariants in 1280 ms returned []
[2024-05-28 09:27:48] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 09:27:48] [INFO ] Invariant cache hit.
[2024-05-28 09:27:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:28:06] [INFO ] Implicit Places using invariants and state equation in 17589 ms returned []
Implicit Place search using SMT with State Equation took 18887 ms to find 0 implicit places.
[2024-05-28 09:28:06] [INFO ] Redundant transitions in 73 ms returned []
Running 1143 sub problems to find dead transitions.
[2024-05-28 09:28:06] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 09:28:06] [INFO ] Invariant cache hit.
[2024-05-28 09:28:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 63 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1915 variables, and 137 constraints, problems are : Problem set: 63 solved, 1080 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1143/1143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 63 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 63 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 63 solved, 1080 unsolved
[2024-05-28 09:28:40] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-28 09:28:43] [INFO ] Deduced a trap composed of 257 places in 306 ms of which 4 ms to minimize.
[2024-05-28 09:28:44] [INFO ] Deduced a trap composed of 240 places in 287 ms of which 4 ms to minimize.
[2024-05-28 09:28:46] [INFO ] Deduced a trap composed of 178 places in 328 ms of which 5 ms to minimize.
[2024-05-28 09:28:47] [INFO ] Deduced a trap composed of 345 places in 310 ms of which 4 ms to minimize.
[2024-05-28 09:28:48] [INFO ] Deduced a trap composed of 227 places in 311 ms of which 4 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 4 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 177 places in 283 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 8/140 constraints. Problems are: Problem set: 63 solved, 1080 unsolved
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 374 places in 277 ms of which 4 ms to minimize.
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 133 places in 368 ms of which 5 ms to minimize.
[2024-05-28 09:29:03] [INFO ] Deduced a trap composed of 228 places in 345 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1915 variables, and 143 constraints, problems are : Problem set: 63 solved, 1080 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1143 constraints, Known Traps: 11/11 constraints]
After SMT, in 63149ms problems are : Problem set: 63 solved, 1080 unsolved
Search for dead transitions found 63 dead transitions in 63160ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1086/1283 transitions.
Applied a total of 0 rules in 42 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 09:29:09] [INFO ] Redundant transitions in 43 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 125432 ms. Remains : 770/904 places, 1086/1283 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-06
Stuttering criterion allowed to conclude after 64 steps with 2 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-06 finished in 125525 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((p0||G(p1)))))'
Support contains 8 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1283/1283 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1218
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1218
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1153
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1152
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 772 transition count 1151
Applied a total of 264 rules in 154 ms. Remains 772 /904 variables (removed 132) and now considering 1151/1283 (removed 132) transitions.
Running 1145 sub problems to find dead transitions.
[2024-05-28 09:29:10] [INFO ] Flow matrix only has 1147 transitions (discarded 4 similar events)
// Phase 1: matrix 1147 rows 772 cols
[2024-05-28 09:29:10] [INFO ] Computed 137 invariants in 34 ms
[2024-05-28 09:29:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
(s29 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1919 variables, and 132 constraints, problems are : Problem set: 0 solved, 1145 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1145/1145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
[2024-05-28 09:29:33] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 2 ms to minimize.
[2024-05-28 09:29:34] [INFO ] Deduced a trap composed of 301 places in 269 ms of which 4 ms to minimize.
[2024-05-28 09:29:35] [INFO ] Deduced a trap composed of 310 places in 387 ms of which 5 ms to minimize.
[2024-05-28 09:29:35] [INFO ] Deduced a trap composed of 307 places in 364 ms of which 5 ms to minimize.
[2024-05-28 09:29:37] [INFO ] Deduced a trap composed of 350 places in 746 ms of which 6 ms to minimize.
[2024-05-28 09:29:37] [INFO ] Deduced a trap composed of 335 places in 296 ms of which 5 ms to minimize.
[2024-05-28 09:29:38] [INFO ] Deduced a trap composed of 368 places in 387 ms of which 5 ms to minimize.
[2024-05-28 09:29:38] [INFO ] Deduced a trap composed of 363 places in 379 ms of which 5 ms to minimize.
[2024-05-28 09:29:39] [INFO ] Deduced a trap composed of 275 places in 391 ms of which 6 ms to minimize.
[2024-05-28 09:29:39] [INFO ] Deduced a trap composed of 239 places in 404 ms of which 5 ms to minimize.
[2024-05-28 09:29:42] [INFO ] Deduced a trap composed of 240 places in 284 ms of which 4 ms to minimize.
[2024-05-28 09:29:42] [INFO ] Deduced a trap composed of 256 places in 365 ms of which 5 ms to minimize.
[2024-05-28 09:29:43] [INFO ] Deduced a trap composed of 247 places in 280 ms of which 4 ms to minimize.
[2024-05-28 09:29:43] [INFO ] Deduced a trap composed of 246 places in 274 ms of which 4 ms to minimize.
[2024-05-28 09:29:43] [INFO ] Deduced a trap composed of 248 places in 281 ms of which 4 ms to minimize.
[2024-05-28 09:29:43] [INFO ] Deduced a trap composed of 246 places in 285 ms of which 4 ms to minimize.
[2024-05-28 09:29:44] [INFO ] Deduced a trap composed of 252 places in 365 ms of which 5 ms to minimize.
[2024-05-28 09:29:44] [INFO ] Deduced a trap composed of 256 places in 338 ms of which 4 ms to minimize.
[2024-05-28 09:29:45] [INFO ] Deduced a trap composed of 252 places in 336 ms of which 4 ms to minimize.
[2024-05-28 09:29:45] [INFO ] Deduced a trap composed of 252 places in 313 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1919 variables, and 152 constraints, problems are : Problem set: 0 solved, 1145 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1145 constraints, Known Traps: 20/20 constraints]
After SMT, in 42193ms problems are : Problem set: 0 solved, 1145 unsolved
Search for dead transitions found 0 dead transitions in 42202ms
[2024-05-28 09:29:52] [INFO ] Flow matrix only has 1147 transitions (discarded 4 similar events)
[2024-05-28 09:29:52] [INFO ] Invariant cache hit.
[2024-05-28 09:29:53] [INFO ] Implicit Places using invariants in 1383 ms returned []
[2024-05-28 09:29:53] [INFO ] Flow matrix only has 1147 transitions (discarded 4 similar events)
[2024-05-28 09:29:53] [INFO ] Invariant cache hit.
[2024-05-28 09:29:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:30:09] [INFO ] Implicit Places using invariants and state equation in 15590 ms returned []
Implicit Place search using SMT with State Equation took 16976 ms to find 0 implicit places.
[2024-05-28 09:30:09] [INFO ] Redundant transitions in 30 ms returned []
Running 1145 sub problems to find dead transitions.
[2024-05-28 09:30:09] [INFO ] Flow matrix only has 1147 transitions (discarded 4 similar events)
[2024-05-28 09:30:09] [INFO ] Invariant cache hit.
[2024-05-28 09:30:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 257 places in 377 ms of which 6 ms to minimize.
[2024-05-28 09:30:33] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1919 variables, and 134 constraints, problems are : Problem set: 0 solved, 1145 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1145/1145 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
[2024-05-28 09:30:43] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
[2024-05-28 09:30:44] [INFO ] Deduced a trap composed of 301 places in 278 ms of which 4 ms to minimize.
[2024-05-28 09:30:44] [INFO ] Deduced a trap composed of 358 places in 282 ms of which 4 ms to minimize.
[2024-05-28 09:30:44] [INFO ] Deduced a trap composed of 306 places in 270 ms of which 4 ms to minimize.
[2024-05-28 09:30:45] [INFO ] Deduced a trap composed of 322 places in 282 ms of which 4 ms to minimize.
[2024-05-28 09:30:46] [INFO ] Deduced a trap composed of 251 places in 298 ms of which 22 ms to minimize.
[2024-05-28 09:30:47] [INFO ] Deduced a trap composed of 355 places in 269 ms of which 4 ms to minimize.
[2024-05-28 09:30:48] [INFO ] Deduced a trap composed of 348 places in 273 ms of which 4 ms to minimize.
[2024-05-28 09:30:48] [INFO ] Deduced a trap composed of 364 places in 266 ms of which 14 ms to minimize.
[2024-05-28 09:30:49] [INFO ] Deduced a trap composed of 349 places in 273 ms of which 4 ms to minimize.
[2024-05-28 09:30:49] [INFO ] Deduced a trap composed of 244 places in 274 ms of which 4 ms to minimize.
[2024-05-28 09:30:50] [INFO ] Deduced a trap composed of 342 places in 287 ms of which 4 ms to minimize.
[2024-05-28 09:30:50] [INFO ] Deduced a trap composed of 343 places in 278 ms of which 4 ms to minimize.
[2024-05-28 09:30:50] [INFO ] Deduced a trap composed of 350 places in 275 ms of which 4 ms to minimize.
[2024-05-28 09:30:51] [INFO ] Deduced a trap composed of 255 places in 293 ms of which 5 ms to minimize.
[2024-05-28 09:30:51] [INFO ] Deduced a trap composed of 238 places in 289 ms of which 5 ms to minimize.
[2024-05-28 09:30:51] [INFO ] Deduced a trap composed of 353 places in 309 ms of which 4 ms to minimize.
[2024-05-28 09:30:52] [INFO ] Deduced a trap composed of 244 places in 285 ms of which 4 ms to minimize.
[2024-05-28 09:30:52] [INFO ] Deduced a trap composed of 343 places in 280 ms of which 4 ms to minimize.
[2024-05-28 09:30:52] [INFO ] Deduced a trap composed of 245 places in 362 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
[2024-05-28 09:31:06] [INFO ] Deduced a trap composed of 268 places in 309 ms of which 4 ms to minimize.
[2024-05-28 09:31:07] [INFO ] Deduced a trap composed of 256 places in 321 ms of which 4 ms to minimize.
[2024-05-28 09:31:07] [INFO ] Deduced a trap composed of 261 places in 290 ms of which 4 ms to minimize.
[2024-05-28 09:31:07] [INFO ] Deduced a trap composed of 247 places in 290 ms of which 4 ms to minimize.
[2024-05-28 09:31:08] [INFO ] Deduced a trap composed of 239 places in 292 ms of which 4 ms to minimize.
[2024-05-28 09:31:08] [INFO ] Deduced a trap composed of 257 places in 288 ms of which 4 ms to minimize.
[2024-05-28 09:31:08] [INFO ] Deduced a trap composed of 265 places in 296 ms of which 4 ms to minimize.
[2024-05-28 09:31:09] [INFO ] Deduced a trap composed of 251 places in 267 ms of which 4 ms to minimize.
[2024-05-28 09:31:09] [INFO ] Deduced a trap composed of 251 places in 293 ms of which 4 ms to minimize.
[2024-05-28 09:31:11] [INFO ] Deduced a trap composed of 266 places in 291 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1919 variables, and 164 constraints, problems are : Problem set: 0 solved, 1145 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1145 constraints, Known Traps: 32/32 constraints]
After SMT, in 62186ms problems are : Problem set: 0 solved, 1145 unsolved
Search for dead transitions found 0 dead transitions in 62196ms
Starting structural reductions in SI_LTL mode, iteration 1 : 772/904 places, 1151/1283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121573 ms. Remains : 772/904 places, 1151/1283 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-07
Product exploration explored 100000 steps with 9090 reset in 1073 ms.
Product exploration explored 100000 steps with 9188 reset in 912 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2038 resets) in 563 ms. (70 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (1428 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
[2024-05-28 09:31:14] [INFO ] Flow matrix only has 1147 transitions (discarded 4 similar events)
[2024-05-28 09:31:14] [INFO ] Invariant cache hit.
[2024-05-28 09:31:14] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 534/542 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 210/752 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/772 variables, 18/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/772 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1147/1919 variables, 772/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1919 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1919 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1919 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1919/1919 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 772/772 constraints, ReadFeed: 1/1 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 534/542 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:31:15] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/542 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 210/752 variables, 111/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 772/1919 variables, and 138 constraints, problems are : Problem set: 1 solved, 0 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1181ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 772 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 772/772 places, 1151/1151 transitions.
Applied a total of 0 rules in 36 ms. Remains 772 /772 variables (removed 0) and now considering 1151/1151 (removed 0) transitions.
Running 1145 sub problems to find dead transitions.
[2024-05-28 09:31:15] [INFO ] Flow matrix only has 1147 transitions (discarded 4 similar events)
[2024-05-28 09:31:15] [INFO ] Invariant cache hit.
[2024-05-28 09:31:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
[2024-05-28 09:31:38] [INFO ] Deduced a trap composed of 257 places in 287 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1919 variables, and 133 constraints, problems are : Problem set: 0 solved, 1145 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1145/1145 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
[2024-05-28 09:31:40] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 3 ms to minimize.
[2024-05-28 09:31:42] [INFO ] Deduced a trap composed of 301 places in 279 ms of which 5 ms to minimize.
[2024-05-28 09:31:42] [INFO ] Deduced a trap composed of 358 places in 363 ms of which 5 ms to minimize.
[2024-05-28 09:31:42] [INFO ] Deduced a trap composed of 306 places in 352 ms of which 4 ms to minimize.
[2024-05-28 09:31:48] [INFO ] Deduced a trap composed of 251 places in 376 ms of which 5 ms to minimize.
[2024-05-28 09:31:49] [INFO ] Deduced a trap composed of 259 places in 321 ms of which 5 ms to minimize.
[2024-05-28 09:31:49] [INFO ] Deduced a trap composed of 242 places in 317 ms of which 5 ms to minimize.
[2024-05-28 09:31:50] [INFO ] Deduced a trap composed of 241 places in 285 ms of which 4 ms to minimize.
[2024-05-28 09:31:50] [INFO ] Deduced a trap composed of 270 places in 281 ms of which 4 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 235 places in 277 ms of which 5 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 256 places in 360 ms of which 5 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 251 places in 299 ms of which 4 ms to minimize.
[2024-05-28 09:31:54] [INFO ] Deduced a trap composed of 192 places in 326 ms of which 4 ms to minimize.
[2024-05-28 09:31:55] [INFO ] Deduced a trap composed of 194 places in 318 ms of which 4 ms to minimize.
[2024-05-28 09:31:55] [INFO ] Deduced a trap composed of 355 places in 311 ms of which 4 ms to minimize.
[2024-05-28 09:31:55] [INFO ] Deduced a trap composed of 375 places in 285 ms of which 5 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 362 places in 323 ms of which 4 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 169 places in 298 ms of which 4 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 358 places in 240 ms of which 3 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 185 places in 309 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1919 variables, and 153 constraints, problems are : Problem set: 0 solved, 1145 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1145 constraints, Known Traps: 21/21 constraints]
After SMT, in 43502ms problems are : Problem set: 0 solved, 1145 unsolved
Search for dead transitions found 0 dead transitions in 43512ms
[2024-05-28 09:31:59] [INFO ] Flow matrix only has 1147 transitions (discarded 4 similar events)
[2024-05-28 09:31:59] [INFO ] Invariant cache hit.
[2024-05-28 09:32:00] [INFO ] Implicit Places using invariants in 1157 ms returned []
[2024-05-28 09:32:00] [INFO ] Flow matrix only has 1147 transitions (discarded 4 similar events)
[2024-05-28 09:32:00] [INFO ] Invariant cache hit.
[2024-05-28 09:32:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:32:15] [INFO ] Implicit Places using invariants and state equation in 14743 ms returned []
Implicit Place search using SMT with State Equation took 15915 ms to find 0 implicit places.
[2024-05-28 09:32:15] [INFO ] Redundant transitions in 20 ms returned []
Running 1145 sub problems to find dead transitions.
[2024-05-28 09:32:15] [INFO ] Flow matrix only has 1147 transitions (discarded 4 similar events)
[2024-05-28 09:32:15] [INFO ] Invariant cache hit.
[2024-05-28 09:32:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
[2024-05-28 09:32:36] [INFO ] Deduced a trap composed of 257 places in 276 ms of which 4 ms to minimize.
[2024-05-28 09:32:39] [INFO ] Deduced a trap composed of 15 places in 385 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1919 variables, and 134 constraints, problems are : Problem set: 0 solved, 1145 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1145/1145 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/767 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
[2024-05-28 09:32:49] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2024-05-28 09:32:50] [INFO ] Deduced a trap composed of 301 places in 334 ms of which 4 ms to minimize.
[2024-05-28 09:32:50] [INFO ] Deduced a trap composed of 358 places in 313 ms of which 4 ms to minimize.
[2024-05-28 09:32:50] [INFO ] Deduced a trap composed of 306 places in 252 ms of which 4 ms to minimize.
[2024-05-28 09:32:51] [INFO ] Deduced a trap composed of 322 places in 321 ms of which 4 ms to minimize.
[2024-05-28 09:32:52] [INFO ] Deduced a trap composed of 251 places in 371 ms of which 5 ms to minimize.
[2024-05-28 09:32:53] [INFO ] Deduced a trap composed of 355 places in 261 ms of which 4 ms to minimize.
[2024-05-28 09:32:54] [INFO ] Deduced a trap composed of 348 places in 260 ms of which 4 ms to minimize.
[2024-05-28 09:32:54] [INFO ] Deduced a trap composed of 364 places in 313 ms of which 4 ms to minimize.
[2024-05-28 09:32:55] [INFO ] Deduced a trap composed of 349 places in 296 ms of which 4 ms to minimize.
[2024-05-28 09:32:55] [INFO ] Deduced a trap composed of 244 places in 300 ms of which 4 ms to minimize.
[2024-05-28 09:32:56] [INFO ] Deduced a trap composed of 342 places in 304 ms of which 4 ms to minimize.
[2024-05-28 09:32:56] [INFO ] Deduced a trap composed of 343 places in 305 ms of which 5 ms to minimize.
[2024-05-28 09:32:56] [INFO ] Deduced a trap composed of 350 places in 301 ms of which 4 ms to minimize.
[2024-05-28 09:32:57] [INFO ] Deduced a trap composed of 255 places in 306 ms of which 4 ms to minimize.
[2024-05-28 09:32:57] [INFO ] Deduced a trap composed of 238 places in 337 ms of which 4 ms to minimize.
[2024-05-28 09:32:57] [INFO ] Deduced a trap composed of 353 places in 300 ms of which 4 ms to minimize.
[2024-05-28 09:32:58] [INFO ] Deduced a trap composed of 244 places in 301 ms of which 4 ms to minimize.
[2024-05-28 09:32:58] [INFO ] Deduced a trap composed of 343 places in 301 ms of which 4 ms to minimize.
[2024-05-28 09:32:58] [INFO ] Deduced a trap composed of 245 places in 297 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/767 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 1145 unsolved
[2024-05-28 09:33:12] [INFO ] Deduced a trap composed of 268 places in 386 ms of which 6 ms to minimize.
[2024-05-28 09:33:12] [INFO ] Deduced a trap composed of 256 places in 344 ms of which 4 ms to minimize.
[2024-05-28 09:33:13] [INFO ] Deduced a trap composed of 261 places in 299 ms of which 5 ms to minimize.
[2024-05-28 09:33:13] [INFO ] Deduced a trap composed of 247 places in 367 ms of which 5 ms to minimize.
[2024-05-28 09:33:13] [INFO ] Deduced a trap composed of 239 places in 399 ms of which 5 ms to minimize.
[2024-05-28 09:33:14] [INFO ] Deduced a trap composed of 257 places in 409 ms of which 6 ms to minimize.
[2024-05-28 09:33:14] [INFO ] Deduced a trap composed of 265 places in 391 ms of which 5 ms to minimize.
[2024-05-28 09:33:15] [INFO ] Deduced a trap composed of 251 places in 318 ms of which 4 ms to minimize.
[2024-05-28 09:33:15] [INFO ] Deduced a trap composed of 251 places in 352 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1919 variables, and 163 constraints, problems are : Problem set: 0 solved, 1145 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1145 constraints, Known Traps: 31/31 constraints]
After SMT, in 62194ms problems are : Problem set: 0 solved, 1145 unsolved
Search for dead transitions found 0 dead transitions in 62205ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121703 ms. Remains : 772/772 places, 1151/1151 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33 steps (1 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9178 reset in 852 ms.
Product exploration explored 100000 steps with 9117 reset in 870 ms.
Support contains 6 out of 772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 772/772 places, 1151/1151 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 771 transition count 1150
Applied a total of 2 rules in 48 ms. Remains 771 /772 variables (removed 1) and now considering 1150/1151 (removed 1) transitions.
Running 1144 sub problems to find dead transitions.
[2024-05-28 09:33:19] [INFO ] Flow matrix only has 1146 transitions (discarded 4 similar events)
// Phase 1: matrix 1146 rows 771 cols
[2024-05-28 09:33:19] [INFO ] Computed 137 invariants in 42 ms
[2024-05-28 09:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
[2024-05-28 09:33:41] [INFO ] Deduced a trap composed of 244 places in 378 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 4.0)
(s178 0.0)
(s179 0.0)
(s180 3.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 6.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 4.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 4.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 4.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 4.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 9.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 1.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 3.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 timeout
0.0)
(s750 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1917 variables, and 133 constraints, problems are : Problem set: 0 solved, 1144 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1144/1144 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
[2024-05-28 09:33:44] [INFO ] Deduced a trap composed of 241 places in 309 ms of which 5 ms to minimize.
[2024-05-28 09:33:44] [INFO ] Deduced a trap composed of 239 places in 350 ms of which 5 ms to minimize.
[2024-05-28 09:33:45] [INFO ] Deduced a trap composed of 241 places in 307 ms of which 4 ms to minimize.
[2024-05-28 09:33:47] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-28 09:33:48] [INFO ] Deduced a trap composed of 259 places in 418 ms of which 6 ms to minimize.
[2024-05-28 09:33:48] [INFO ] Deduced a trap composed of 264 places in 361 ms of which 5 ms to minimize.
[2024-05-28 09:33:49] [INFO ] Deduced a trap composed of 262 places in 385 ms of which 6 ms to minimize.
[2024-05-28 09:33:49] [INFO ] Deduced a trap composed of 251 places in 325 ms of which 5 ms to minimize.
[2024-05-28 09:33:49] [INFO ] Deduced a trap composed of 262 places in 320 ms of which 5 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 261 places in 321 ms of which 5 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 242 places in 351 ms of which 5 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 246 places in 314 ms of which 4 ms to minimize.
[2024-05-28 09:33:51] [INFO ] Deduced a trap composed of 266 places in 318 ms of which 4 ms to minimize.
[2024-05-28 09:33:51] [INFO ] Deduced a trap composed of 205 places in 394 ms of which 5 ms to minimize.
[2024-05-28 09:33:56] [INFO ] Deduced a trap composed of 349 places in 391 ms of which 5 ms to minimize.
[2024-05-28 09:33:57] [INFO ] Deduced a trap composed of 360 places in 378 ms of which 5 ms to minimize.
[2024-05-28 09:33:58] [INFO ] Deduced a trap composed of 358 places in 277 ms of which 4 ms to minimize.
[2024-05-28 09:33:58] [INFO ] Deduced a trap composed of 342 places in 333 ms of which 4 ms to minimize.
[2024-05-28 09:33:58] [INFO ] Deduced a trap composed of 337 places in 377 ms of which 5 ms to minimize.
[2024-05-28 09:33:59] [INFO ] Deduced a trap composed of 267 places in 390 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1917 variables, and 153 constraints, problems are : Problem set: 0 solved, 1144 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1144 constraints, Known Traps: 21/21 constraints]
After SMT, in 42198ms problems are : Problem set: 0 solved, 1144 unsolved
Search for dead transitions found 0 dead transitions in 42207ms
[2024-05-28 09:34:01] [INFO ] Flow matrix only has 1146 transitions (discarded 4 similar events)
[2024-05-28 09:34:01] [INFO ] Invariant cache hit.
[2024-05-28 09:34:03] [INFO ] Implicit Places using invariants in 1356 ms returned []
[2024-05-28 09:34:03] [INFO ] Flow matrix only has 1146 transitions (discarded 4 similar events)
[2024-05-28 09:34:03] [INFO ] Invariant cache hit.
[2024-05-28 09:34:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:34:20] [INFO ] Implicit Places using invariants and state equation in 17405 ms returned []
Implicit Place search using SMT with State Equation took 18770 ms to find 0 implicit places.
[2024-05-28 09:34:20] [INFO ] Redundant transitions in 25 ms returned []
Running 1144 sub problems to find dead transitions.
[2024-05-28 09:34:20] [INFO ] Flow matrix only has 1146 transitions (discarded 4 similar events)
[2024-05-28 09:34:20] [INFO ] Invariant cache hit.
[2024-05-28 09:34:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
[2024-05-28 09:34:43] [INFO ] Deduced a trap composed of 244 places in 382 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1917 variables, and 133 constraints, problems are : Problem set: 0 solved, 1144 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1144/1144 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
[2024-05-28 09:35:02] [INFO ] Deduced a trap composed of 134 places in 346 ms of which 5 ms to minimize.
[2024-05-28 09:35:03] [INFO ] Deduced a trap composed of 255 places in 407 ms of which 6 ms to minimize.
[2024-05-28 09:35:07] [INFO ] Deduced a trap composed of 262 places in 384 ms of which 5 ms to minimize.
[2024-05-28 09:35:11] [INFO ] Deduced a trap composed of 230 places in 364 ms of which 6 ms to minimize.
[2024-05-28 09:35:13] [INFO ] Deduced a trap composed of 267 places in 424 ms of which 7 ms to minimize.
[2024-05-28 09:35:13] [INFO ] Deduced a trap composed of 239 places in 403 ms of which 6 ms to minimize.
[2024-05-28 09:35:14] [INFO ] Deduced a trap composed of 313 places in 411 ms of which 7 ms to minimize.
[2024-05-28 09:35:14] [INFO ] Deduced a trap composed of 371 places in 370 ms of which 5 ms to minimize.
[2024-05-28 09:35:16] [INFO ] Deduced a trap composed of 231 places in 363 ms of which 5 ms to minimize.
[2024-05-28 09:35:17] [INFO ] Deduced a trap composed of 316 places in 309 ms of which 4 ms to minimize.
[2024-05-28 09:35:20] [INFO ] Deduced a trap composed of 257 places in 372 ms of which 5 ms to minimize.
[2024-05-28 09:35:20] [INFO ] Deduced a trap composed of 248 places in 358 ms of which 6 ms to minimize.
[2024-05-28 09:35:21] [INFO ] Deduced a trap composed of 253 places in 351 ms of which 5 ms to minimize.
[2024-05-28 09:35:21] [INFO ] Deduced a trap composed of 244 places in 321 ms of which 5 ms to minimize.
[2024-05-28 09:35:21] [INFO ] Deduced a trap composed of 382 places in 309 ms of which 5 ms to minimize.
[2024-05-28 09:35:22] [INFO ] Deduced a trap composed of 303 places in 287 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1917 variables, and 149 constraints, problems are : Problem set: 0 solved, 1144 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1144 constraints, Known Traps: 17/17 constraints]
After SMT, in 62258ms problems are : Problem set: 0 solved, 1144 unsolved
Search for dead transitions found 0 dead transitions in 62269ms
Starting structural reductions in SI_LTL mode, iteration 1 : 771/772 places, 1150/1151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123333 ms. Remains : 771/772 places, 1150/1151 transitions.
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-07 finished in 373322 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 p1)||X(F(p1)))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1283/1283 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1218
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 839 transition count 1217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 838 transition count 1217
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 132 place count 838 transition count 1153
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 260 place count 774 transition count 1153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 261 place count 773 transition count 1152
Iterating global reduction 3 with 1 rules applied. Total rules applied 262 place count 773 transition count 1152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 266 place count 771 transition count 1150
Applied a total of 266 rules in 121 ms. Remains 771 /904 variables (removed 133) and now considering 1150/1283 (removed 133) transitions.
Running 1144 sub problems to find dead transitions.
[2024-05-28 09:35:23] [INFO ] Flow matrix only has 1146 transitions (discarded 4 similar events)
// Phase 1: matrix 1146 rows 771 cols
[2024-05-28 09:35:23] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 09:35:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1917 variables, and 132 constraints, problems are : Problem set: 0 solved, 1144 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1144/1144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
[2024-05-28 09:35:47] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2024-05-28 09:35:48] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 2 ms to minimize.
[2024-05-28 09:35:52] [INFO ] Deduced a trap composed of 237 places in 324 ms of which 4 ms to minimize.
[2024-05-28 09:35:53] [INFO ] Deduced a trap composed of 241 places in 362 ms of which 6 ms to minimize.
[2024-05-28 09:35:53] [INFO ] Deduced a trap composed of 241 places in 369 ms of which 5 ms to minimize.
[2024-05-28 09:35:55] [INFO ] Deduced a trap composed of 219 places in 386 ms of which 5 ms to minimize.
[2024-05-28 09:35:55] [INFO ] Deduced a trap composed of 134 places in 274 ms of which 4 ms to minimize.
[2024-05-28 09:35:56] [INFO ] Deduced a trap composed of 366 places in 295 ms of which 4 ms to minimize.
[2024-05-28 09:35:59] [INFO ] Deduced a trap composed of 254 places in 288 ms of which 4 ms to minimize.
[2024-05-28 09:35:59] [INFO ] Deduced a trap composed of 239 places in 283 ms of which 4 ms to minimize.
[2024-05-28 09:36:00] [INFO ] Deduced a trap composed of 247 places in 292 ms of which 4 ms to minimize.
[2024-05-28 09:36:00] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 4 ms to minimize.
[2024-05-28 09:36:00] [INFO ] Deduced a trap composed of 245 places in 401 ms of which 5 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 348 places in 280 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1917 variables, and 146 constraints, problems are : Problem set: 0 solved, 1144 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1144 constraints, Known Traps: 14/14 constraints]
After SMT, in 42882ms problems are : Problem set: 0 solved, 1144 unsolved
Search for dead transitions found 0 dead transitions in 42891ms
[2024-05-28 09:36:06] [INFO ] Flow matrix only has 1146 transitions (discarded 4 similar events)
[2024-05-28 09:36:06] [INFO ] Invariant cache hit.
[2024-05-28 09:36:07] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2024-05-28 09:36:07] [INFO ] Flow matrix only has 1146 transitions (discarded 4 similar events)
[2024-05-28 09:36:07] [INFO ] Invariant cache hit.
[2024-05-28 09:36:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:36:22] [INFO ] Implicit Places using invariants and state equation in 14638 ms returned []
Implicit Place search using SMT with State Equation took 15831 ms to find 0 implicit places.
[2024-05-28 09:36:22] [INFO ] Redundant transitions in 37 ms returned []
Running 1144 sub problems to find dead transitions.
[2024-05-28 09:36:22] [INFO ] Flow matrix only has 1146 transitions (discarded 4 similar events)
[2024-05-28 09:36:22] [INFO ] Invariant cache hit.
[2024-05-28 09:36:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1144 unsolved
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/771 variables, 5/137 constraints. Problems are: Problem set: 63 solved, 1081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/1917 variables, and 137 constraints, problems are : Problem set: 63 solved, 1081 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1144/1144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 63 solved, 1081 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 63 solved, 1081 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 63 solved, 1081 unsolved
[2024-05-28 09:36:57] [INFO ] Deduced a trap composed of 273 places in 294 ms of which 5 ms to minimize.
[2024-05-28 09:36:57] [INFO ] Deduced a trap composed of 134 places in 318 ms of which 4 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 3 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-28 09:37:05] [INFO ] Deduced a trap composed of 270 places in 390 ms of which 5 ms to minimize.
[2024-05-28 09:37:05] [INFO ] Deduced a trap composed of 251 places in 358 ms of which 5 ms to minimize.
[2024-05-28 09:37:06] [INFO ] Deduced a trap composed of 344 places in 301 ms of which 4 ms to minimize.
[2024-05-28 09:37:06] [INFO ] Deduced a trap composed of 351 places in 330 ms of which 5 ms to minimize.
[2024-05-28 09:37:08] [INFO ] Deduced a trap composed of 14 places in 392 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 9/141 constraints. Problems are: Problem set: 63 solved, 1081 unsolved
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 172 places in 346 ms of which 4 ms to minimize.
[2024-05-28 09:37:15] [INFO ] Deduced a trap composed of 181 places in 306 ms of which 4 ms to minimize.
[2024-05-28 09:37:15] [INFO ] Deduced a trap composed of 192 places in 307 ms of which 4 ms to minimize.
[2024-05-28 09:37:15] [INFO ] Deduced a trap composed of 369 places in 285 ms of which 4 ms to minimize.
[2024-05-28 09:37:16] [INFO ] Deduced a trap composed of 370 places in 305 ms of which 4 ms to minimize.
[2024-05-28 09:37:16] [INFO ] Deduced a trap composed of 363 places in 330 ms of which 4 ms to minimize.
[2024-05-28 09:37:16] [INFO ] Deduced a trap composed of 340 places in 303 ms of which 5 ms to minimize.
[2024-05-28 09:37:17] [INFO ] Deduced a trap composed of 179 places in 382 ms of which 5 ms to minimize.
[2024-05-28 09:37:18] [INFO ] Deduced a trap composed of 334 places in 395 ms of which 6 ms to minimize.
[2024-05-28 09:37:18] [INFO ] Deduced a trap composed of 326 places in 380 ms of which 5 ms to minimize.
[2024-05-28 09:37:20] [INFO ] Deduced a trap composed of 320 places in 391 ms of which 5 ms to minimize.
[2024-05-28 09:37:21] [INFO ] Deduced a trap composed of 228 places in 388 ms of which 6 ms to minimize.
[2024-05-28 09:37:22] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 4 ms to minimize.
[2024-05-28 09:37:23] [INFO ] Deduced a trap composed of 240 places in 323 ms of which 4 ms to minimize.
[2024-05-28 09:37:23] [INFO ] Deduced a trap composed of 228 places in 374 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1917 variables, and 156 constraints, problems are : Problem set: 63 solved, 1081 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1144 constraints, Known Traps: 24/24 constraints]
After SMT, in 62726ms problems are : Problem set: 63 solved, 1081 unsolved
Search for dead transitions found 63 dead transitions in 62741ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 771/904 places, 1087/1283 transitions.
Applied a total of 0 rules in 32 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2024-05-28 09:37:25] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 121705 ms. Remains : 771/904 places, 1087/1283 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-08 finished in 121901 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&&X(X(G(p2)))))))))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1283/1283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1282
Applied a total of 2 rules in 35 ms. Remains 903 /904 variables (removed 1) and now considering 1282/1283 (removed 1) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 09:37:25] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
// Phase 1: matrix 1278 rows 903 cols
[2024-05-28 09:37:25] [INFO ] Computed 137 invariants in 21 ms
[2024-05-28 09:37:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2181 variables, and 131 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2181 variables, and 131 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 0/0 constraints]
After SMT, in 42878ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 42889ms
[2024-05-28 09:38:08] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:38:08] [INFO ] Invariant cache hit.
[2024-05-28 09:38:09] [INFO ] Implicit Places using invariants in 1506 ms returned []
[2024-05-28 09:38:09] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:38:09] [INFO ] Invariant cache hit.
[2024-05-28 09:38:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:38:26] [INFO ] Implicit Places using invariants and state equation in 17286 ms returned []
Implicit Place search using SMT with State Equation took 18806 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 09:38:26] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:38:26] [INFO ] Invariant cache hit.
[2024-05-28 09:38:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2181 variables, and 131 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 09:39:03] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2024-05-28 09:39:07] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 2 ms to minimize.
[2024-05-28 09:39:07] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 2 ms to minimize.
[2024-05-28 09:39:11] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2181 variables, and 135 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 4/4 constraints]
After SMT, in 62763ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 62774ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1282/1283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124509 ms. Remains : 903/904 places, 1282/1283 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 252 steps with 18 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-09 finished in 124637 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(p0)))'
Support contains 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1283/1283 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1217
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1217
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1152
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1151
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1149
Applied a total of 268 rules in 116 ms. Remains 770 /904 variables (removed 134) and now considering 1149/1283 (removed 134) transitions.
Running 1143 sub problems to find dead transitions.
[2024-05-28 09:39:29] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
// Phase 1: matrix 1145 rows 770 cols
[2024-05-28 09:39:29] [INFO ] Computed 137 invariants in 17 ms
[2024-05-28 09:39:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1915 variables, and 132 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1143/1143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
[2024-05-28 09:39:55] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-05-28 09:39:56] [INFO ] Deduced a trap composed of 336 places in 398 ms of which 4 ms to minimize.
[2024-05-28 09:39:59] [INFO ] Deduced a trap composed of 133 places in 298 ms of which 4 ms to minimize.
[2024-05-28 09:40:00] [INFO ] Deduced a trap composed of 252 places in 283 ms of which 4 ms to minimize.
[2024-05-28 09:40:01] [INFO ] Deduced a trap composed of 248 places in 344 ms of which 4 ms to minimize.
[2024-05-28 09:40:04] [INFO ] Deduced a trap composed of 246 places in 295 ms of which 4 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 326 places in 291 ms of which 4 ms to minimize.
[2024-05-28 09:40:08] [INFO ] Deduced a trap composed of 346 places in 297 ms of which 4 ms to minimize.
[2024-05-28 09:40:09] [INFO ] Deduced a trap composed of 256 places in 286 ms of which 4 ms to minimize.
[2024-05-28 09:40:10] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1915 variables, and 142 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1143 constraints, Known Traps: 10/10 constraints]
After SMT, in 42324ms problems are : Problem set: 0 solved, 1143 unsolved
Search for dead transitions found 0 dead transitions in 42333ms
[2024-05-28 09:40:12] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 09:40:12] [INFO ] Invariant cache hit.
[2024-05-28 09:40:13] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2024-05-28 09:40:13] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 09:40:13] [INFO ] Invariant cache hit.
[2024-05-28 09:40:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:40:30] [INFO ] Implicit Places using invariants and state equation in 16830 ms returned []
Implicit Place search using SMT with State Equation took 18082 ms to find 0 implicit places.
[2024-05-28 09:40:30] [INFO ] Redundant transitions in 38 ms returned []
Running 1143 sub problems to find dead transitions.
[2024-05-28 09:40:30] [INFO ] Flow matrix only has 1145 transitions (discarded 4 similar events)
[2024-05-28 09:40:30] [INFO ] Invariant cache hit.
[2024-05-28 09:40:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1143 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 63 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1915 variables, and 137 constraints, problems are : Problem set: 63 solved, 1080 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1143/1143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 63 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 112/112 constraints. Problems are: Problem set: 63 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 20/132 constraints. Problems are: Problem set: 63 solved, 1080 unsolved
[2024-05-28 09:41:03] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-28 09:41:05] [INFO ] Deduced a trap composed of 257 places in 274 ms of which 4 ms to minimize.
[2024-05-28 09:41:07] [INFO ] Deduced a trap composed of 240 places in 291 ms of which 4 ms to minimize.
[2024-05-28 09:41:09] [INFO ] Deduced a trap composed of 178 places in 303 ms of which 4 ms to minimize.
[2024-05-28 09:41:09] [INFO ] Deduced a trap composed of 345 places in 279 ms of which 4 ms to minimize.
[2024-05-28 09:41:10] [INFO ] Deduced a trap composed of 227 places in 289 ms of which 4 ms to minimize.
[2024-05-28 09:41:14] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 4 ms to minimize.
[2024-05-28 09:41:18] [INFO ] Deduced a trap composed of 177 places in 302 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 8/140 constraints. Problems are: Problem set: 63 solved, 1080 unsolved
[2024-05-28 09:41:19] [INFO ] Deduced a trap composed of 374 places in 264 ms of which 4 ms to minimize.
[2024-05-28 09:41:21] [INFO ] Deduced a trap composed of 133 places in 243 ms of which 4 ms to minimize.
[2024-05-28 09:41:24] [INFO ] Deduced a trap composed of 228 places in 353 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1915 variables, and 143 constraints, problems are : Problem set: 63 solved, 1080 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1143 constraints, Known Traps: 11/11 constraints]
After SMT, in 62170ms problems are : Problem set: 63 solved, 1080 unsolved
Search for dead transitions found 63 dead transitions in 62184ms
Found 63 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 63 transitions
Dead transitions reduction (with SMT) removed 63 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1086/1283 transitions.
Applied a total of 0 rules in 27 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 09:41:32] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 122829 ms. Remains : 770/904 places, 1086/1283 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-12
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-12 finished in 122896 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(p0))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1283/1283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1282
Applied a total of 2 rules in 35 ms. Remains 903 /904 variables (removed 1) and now considering 1282/1283 (removed 1) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 09:41:32] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
// Phase 1: matrix 1278 rows 903 cols
[2024-05-28 09:41:32] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 09:41:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2181 variables, and 131 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2181 variables, and 131 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 0/0 constraints]
After SMT, in 42269ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 42280ms
[2024-05-28 09:42:15] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:42:15] [INFO ] Invariant cache hit.
[2024-05-28 09:42:16] [INFO ] Implicit Places using invariants in 1357 ms returned []
[2024-05-28 09:42:16] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:42:16] [INFO ] Invariant cache hit.
[2024-05-28 09:42:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:42:33] [INFO ] Implicit Places using invariants and state equation in 17170 ms returned []
Implicit Place search using SMT with State Equation took 18543 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 09:42:33] [INFO ] Flow matrix only has 1278 transitions (discarded 4 similar events)
[2024-05-28 09:42:33] [INFO ] Invariant cache hit.
[2024-05-28 09:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2181 variables, and 137 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 09:43:09] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 3 ms to minimize.
[2024-05-28 09:43:13] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 3 ms to minimize.
[2024-05-28 09:43:14] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2024-05-28 09:43:18] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 1)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 3)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 1)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 10)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s274 0)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 1)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 1)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 1)
(s430 1)
(s431 0)
(s432 1)
(s433 1)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 1)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 4)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 1)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 1)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 4)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 1)
(s535 1)
(s536 0)
(s537 4)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 1)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 1)
(s575 1)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 1)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 1)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 1)
(s609 0)
(s610 1)
(s611 0)
(s612 0)
(s613 1)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 1)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 1)
(s636 0)
(s637 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2181 variables, and 135 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 4/4 constraints]
After SMT, in 62153ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 62164ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1282/1283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123027 ms. Remains : 903/904 places, 1282/1283 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J60-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 445 ms.
Product exploration explored 100000 steps with 33333 reset in 490 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J60-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J60-LTLCardinality-13 finished in 124117 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((p0||G(p1)))))'
[2024-05-28 09:43:37] [INFO ] Flatten gal took : 74 ms
[2024-05-28 09:43:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-28 09:43:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 904 places, 1283 transitions and 6265 arcs took 10 ms.
Total runtime 1329682 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S05J60

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 904
TRANSITIONS: 1283
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.029s, Sys 0.004s]


SAVING FILE /home/mcc/execution/420/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1845
MODEL NAME: /home/mcc/execution/420/model
904 places, 1283 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBNT-PT-S05J60, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654446000467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;