About the Execution of ITS-Tools for NoC3x3-PT-4A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 577.915 | 246091.00 | 301424.00 | 648.60 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r246-tall-171654352000604.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is NoC3x3-PT-4A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352000604
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 144K 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 NoC3x3-PT-4A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716699181189
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 04:53:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 04:53:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:53:02] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-26 04:53:02] [INFO ] Transformed 293 places.
[2024-05-26 04:53:02] [INFO ] Transformed 608 transitions.
[2024-05-26 04:53:02] [INFO ] Found NUPN structural information;
[2024-05-26 04:53:02] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
FORMULA NoC3x3-PT-4A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 243 transition count 373
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 243 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 142 place count 243 transition count 331
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 151 place count 234 transition count 331
Applied a total of 151 rules in 59 ms. Remains 234 /293 variables (removed 59) and now considering 331/453 (removed 122) transitions.
// Phase 1: matrix 331 rows 234 cols
[2024-05-26 04:53:02] [INFO ] Computed 57 invariants in 17 ms
[2024-05-26 04:53:03] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-26 04:53:03] [INFO ] Invariant cache hit.
[2024-05-26 04:53:03] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-05-26 04:53:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 331/565 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 0/565 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 291 constraints, problems are : Problem set: 0 solved, 330 unsolved in 10500 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 331/565 variables, 234/291 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 330/621 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (OVERLAPS) 0/565 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 621 constraints, problems are : Problem set: 0 solved, 330 unsolved in 13613 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 0/0 constraints]
After SMT, in 24238ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 24260ms
Starting structural reductions in LTL mode, iteration 1 : 234/293 places, 331/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24879 ms. Remains : 234/293 places, 331/453 transitions.
Support contains 42 out of 234 places after structural reductions.
[2024-05-26 04:53:27] [INFO ] Flatten gal took : 52 ms
[2024-05-26 04:53:27] [INFO ] Flatten gal took : 24 ms
[2024-05-26 04:53:27] [INFO ] Input system was already deterministic with 331 transitions.
RANDOM walk for 35087 steps (7 resets) in 1935 ms. (18 steps per ms) remains 0/28 properties
FORMULA NoC3x3-PT-4A-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-4A-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
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 G(p1))||G(F(p2))))'
Support contains 5 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 131 edges and 234 vertex of which 70 / 234 are part of one of the 31 SCC in 2 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 190 transition count 249
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 190 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 190 transition count 246
Applied a total of 14 rules in 35 ms. Remains 190 /234 variables (removed 44) and now considering 246/331 (removed 85) transitions.
[2024-05-26 04:53:28] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 190 cols
[2024-05-26 04:53:28] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 04:53:29] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-26 04:53:29] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
[2024-05-26 04:53:29] [INFO ] Invariant cache hit.
[2024-05-26 04:53:29] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-26 04:53:29] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-26 04:53:29] [INFO ] Redundant transitions in 15 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-26 04:53:29] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
[2024-05-26 04:53:29] [INFO ] Invariant cache hit.
[2024-05-26 04:53:29] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 215/405 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 96/343 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 1/406 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 344 constraints, problems are : Problem set: 0 solved, 245 unsolved in 10640 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 190/190 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 215/405 variables, 190/247 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 96/343 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 245/588 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 1/406 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 589 constraints, problems are : Problem set: 0 solved, 245 unsolved in 10261 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 190/190 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints]
After SMT, in 20947ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 20950ms
Starting structural reductions in SI_LTL mode, iteration 1 : 190/234 places, 246/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21352 ms. Remains : 190/234 places, 246/331 transitions.
Stuttering acceptance computed with spot in 477 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-01
Stuttering criterion allowed to conclude after 717 steps with 0 reset in 14 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-01 finished in 21915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 138 edges and 234 vertex of which 75 / 234 are part of one of the 33 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 187 transition count 243
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 187 transition count 243
Applied a total of 11 rules in 14 ms. Remains 187 /234 variables (removed 47) and now considering 243/331 (removed 88) transitions.
[2024-05-26 04:53:50] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2024-05-26 04:53:50] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 04:53:50] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-26 04:53:50] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
[2024-05-26 04:53:50] [INFO ] Invariant cache hit.
[2024-05-26 04:53:50] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-26 04:53:51] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-26 04:53:51] [INFO ] Redundant transitions in 2 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-26 04:53:51] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
[2024-05-26 04:53:51] [INFO ] Invariant cache hit.
[2024-05-26 04:53:51] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 210/397 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 104/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 1/398 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 349 constraints, problems are : Problem set: 0 solved, 242 unsolved in 10351 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 210/397 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 104/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 242/590 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 591 constraints, problems are : Problem set: 0 solved, 242 unsolved in 10011 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 20399ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 20403ms
Starting structural reductions in SI_LTL mode, iteration 1 : 187/234 places, 243/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20741 ms. Remains : 187/234 places, 243/331 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-02 finished in 20807 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((p0&&X((G(p1) U (p2||(p2 U p3))))))))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 230 transition count 327
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 230 transition count 327
Applied a total of 8 rules in 11 ms. Remains 230 /234 variables (removed 4) and now considering 327/331 (removed 4) transitions.
// Phase 1: matrix 327 rows 230 cols
[2024-05-26 04:54:11] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 04:54:11] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-26 04:54:11] [INFO ] Invariant cache hit.
[2024-05-26 04:54:11] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2024-05-26 04:54:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 327/557 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 0/557 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 287 constraints, problems are : Problem set: 0 solved, 326 unsolved in 9894 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 327/557 variables, 230/287 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 326/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 613 constraints, problems are : Problem set: 0 solved, 326 unsolved in 12766 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints]
After SMT, in 22732ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 22735ms
Starting structural reductions in LTL mode, iteration 1 : 230/234 places, 327/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23028 ms. Remains : 230/234 places, 327/331 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-04 finished in 23259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 325
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 4 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
// Phase 1: matrix 325 rows 228 cols
[2024-05-26 04:54:34] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 04:54:35] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-26 04:54:35] [INFO ] Invariant cache hit.
[2024-05-26 04:54:35] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-26 04:54:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 9750 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 11678 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 21488ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 21491ms
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21820 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 6180 steps with 0 reset in 58 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-06 finished in 22015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 133 edges and 234 vertex of which 71 / 234 are part of one of the 32 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 189 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 189 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 189 transition count 246
Applied a total of 15 rules in 35 ms. Remains 189 /234 variables (removed 45) and now considering 246/331 (removed 85) transitions.
[2024-05-26 04:54:56] [INFO ] Flow matrix only has 215 transitions (discarded 31 similar events)
// Phase 1: matrix 215 rows 189 cols
[2024-05-26 04:54:56] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 04:54:57] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-26 04:54:57] [INFO ] Flow matrix only has 215 transitions (discarded 31 similar events)
[2024-05-26 04:54:57] [INFO ] Invariant cache hit.
[2024-05-26 04:54:57] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-26 04:54:57] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-26 04:54:57] [INFO ] Redundant transitions in 2 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-26 04:54:57] [INFO ] Flow matrix only has 215 transitions (discarded 31 similar events)
[2024-05-26 04:54:57] [INFO ] Invariant cache hit.
[2024-05-26 04:54:57] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 214/403 variables, 189/246 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 94/340 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 1/404 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 341 constraints, problems are : Problem set: 0 solved, 245 unsolved in 10429 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 189/189 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 214/403 variables, 189/246 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 94/340 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 245/585 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 586 constraints, problems are : Problem set: 0 solved, 245 unsolved in 9647 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 189/189 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints]
After SMT, in 20129ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 20149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 189/234 places, 246/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20597 ms. Remains : 189/234 places, 246/331 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-07 finished in 20644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U p1)&&F(p2))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 130 edges and 234 vertex of which 68 / 234 are part of one of the 30 SCC in 1 ms
Free SCC test removed 38 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 187 transition count 226
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 60 place count 165 transition count 226
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 159 transition count 220
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 159 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 98 place count 159 transition count 194
Applied a total of 98 rules in 19 ms. Remains 159 /234 variables (removed 75) and now considering 194/331 (removed 137) transitions.
// Phase 1: matrix 194 rows 159 cols
[2024-05-26 04:55:17] [INFO ] Computed 49 invariants in 1 ms
[2024-05-26 04:55:17] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-26 04:55:17] [INFO ] Invariant cache hit.
[2024-05-26 04:55:17] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 04:55:17] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-26 04:55:17] [INFO ] Redundant transitions in 95 ms returned []
Running 170 sub problems to find dead transitions.
[2024-05-26 04:55:17] [INFO ] Invariant cache hit.
[2024-05-26 04:55:17] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 193/352 variables, 159/208 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 51/259 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/352 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/353 variables, and 259 constraints, problems are : Problem set: 0 solved, 170 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 159/159 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 193/352 variables, 159/208 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 51/259 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 170/429 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/353 variables, and 429 constraints, problems are : Problem set: 0 solved, 170 unsolved in 3913 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 159/159 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 8962ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 8964ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/234 places, 194/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9347 ms. Remains : 159/234 places, 194/331 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-08 finished in 9557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 229 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 229 transition count 326
Applied a total of 10 rules in 5 ms. Remains 229 /234 variables (removed 5) and now considering 326/331 (removed 5) transitions.
// Phase 1: matrix 326 rows 229 cols
[2024-05-26 04:55:27] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 04:55:27] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-26 04:55:27] [INFO ] Invariant cache hit.
[2024-05-26 04:55:27] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2024-05-26 04:55:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 286 constraints, problems are : Problem set: 0 solved, 325 unsolved in 9936 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 325/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 611 constraints, problems are : Problem set: 0 solved, 325 unsolved in 12901 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints]
After SMT, in 22890ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 22894ms
Starting structural reductions in LTL mode, iteration 1 : 229/234 places, 326/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23169 ms. Remains : 229/234 places, 326/331 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 348 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-09 finished in 23658 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(G(p0))&&F(p1))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 134 edges and 234 vertex of which 71 / 234 are part of one of the 31 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 184 transition count 219
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 160 transition count 219
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 155 transition count 214
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 155 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 100 place count 155 transition count 190
Applied a total of 100 rules in 17 ms. Remains 155 /234 variables (removed 79) and now considering 190/331 (removed 141) transitions.
// Phase 1: matrix 190 rows 155 cols
[2024-05-26 04:55:50] [INFO ] Computed 48 invariants in 2 ms
[2024-05-26 04:55:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-26 04:55:50] [INFO ] Invariant cache hit.
[2024-05-26 04:55:50] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-26 04:55:50] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-26 04:55:51] [INFO ] Redundant transitions in 56 ms returned []
Running 165 sub problems to find dead transitions.
[2024-05-26 04:55:51] [INFO ] Invariant cache hit.
[2024-05-26 04:55:51] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 189/344 variables, 155/203 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 0/344 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 253 constraints, problems are : Problem set: 0 solved, 165 unsolved in 3189 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 155/155 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 189/344 variables, 155/203 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 165/418 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/344 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 418 constraints, problems are : Problem set: 0 solved, 165 unsolved in 3442 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 155/155 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 6654ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 6655ms
Starting structural reductions in SI_LTL mode, iteration 1 : 155/234 places, 190/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6969 ms. Remains : 155/234 places, 190/331 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-10 finished in 7131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 137 edges and 234 vertex of which 73 / 234 are part of one of the 32 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 183 transition count 217
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 159 transition count 217
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 153 transition count 211
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 153 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 102 place count 153 transition count 187
Applied a total of 102 rules in 18 ms. Remains 153 /234 variables (removed 81) and now considering 187/331 (removed 144) transitions.
// Phase 1: matrix 187 rows 153 cols
[2024-05-26 04:55:57] [INFO ] Computed 48 invariants in 2 ms
[2024-05-26 04:55:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-26 04:55:57] [INFO ] Invariant cache hit.
[2024-05-26 04:55:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 04:55:58] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-26 04:55:58] [INFO ] Redundant transitions in 57 ms returned []
Running 162 sub problems to find dead transitions.
[2024-05-26 04:55:58] [INFO ] Invariant cache hit.
[2024-05-26 04:55:58] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/339 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 55/256 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 0/339 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/340 variables, and 256 constraints, problems are : Problem set: 0 solved, 162 unsolved in 3058 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/339 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 55/256 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 162/418 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/340 variables, and 418 constraints, problems are : Problem set: 0 solved, 162 unsolved in 3112 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
After SMT, in 6205ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 6207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/234 places, 187/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6502 ms. Remains : 153/234 places, 187/331 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-11
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-11 finished in 6564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 325
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 3 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
// Phase 1: matrix 325 rows 228 cols
[2024-05-26 04:56:04] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 04:56:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-26 04:56:04] [INFO ] Invariant cache hit.
[2024-05-26 04:56:04] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-26 04:56:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 9750 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 11830 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 21639ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 21644ms
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21914 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-12 finished in 22057 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((F(p0) U (p1 U p2))))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 325
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 3 ms. Remains 228 /234 variables (removed 6) and now considering 325/331 (removed 6) transitions.
[2024-05-26 04:56:26] [INFO ] Invariant cache hit.
[2024-05-26 04:56:26] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-26 04:56:26] [INFO ] Invariant cache hit.
[2024-05-26 04:56:26] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-26 04:56:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 9709 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 11908 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 21681ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 21684ms
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 325/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21989 ms. Remains : 228/234 places, 325/331 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-13
Product exploration explored 100000 steps with 14 reset in 406 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-13 finished in 22540 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 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 137 edges and 234 vertex of which 74 / 234 are part of one of the 33 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 184 transition count 221
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 58 place count 163 transition count 221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 157 transition count 215
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 157 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 95 place count 157 transition count 190
Applied a total of 95 rules in 29 ms. Remains 157 /234 variables (removed 77) and now considering 190/331 (removed 141) transitions.
// Phase 1: matrix 190 rows 157 cols
[2024-05-26 04:56:49] [INFO ] Computed 49 invariants in 0 ms
[2024-05-26 04:56:49] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-26 04:56:49] [INFO ] Invariant cache hit.
[2024-05-26 04:56:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-26 04:56:49] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-05-26 04:56:49] [INFO ] Redundant transitions in 68 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-26 04:56:49] [INFO ] Invariant cache hit.
[2024-05-26 04:56:49] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 189/346 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/346 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/347 variables, and 262 constraints, problems are : Problem set: 0 solved, 164 unsolved in 4646 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 157/157 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 189/346 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 56/262 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 164/426 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/346 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/347 variables, and 426 constraints, problems are : Problem set: 0 solved, 164 unsolved in 3758 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 157/157 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 8439ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 8441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/234 places, 190/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9035 ms. Remains : 157/234 places, 190/331 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-14
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-14 finished in 9119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 331/331 transitions.
Graph (trivial) has 134 edges and 234 vertex of which 72 / 234 are part of one of the 32 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 185 transition count 222
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 60 place count 163 transition count 222
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 157 transition count 216
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 157 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 97 place count 157 transition count 191
Applied a total of 97 rules in 12 ms. Remains 157 /234 variables (removed 77) and now considering 191/331 (removed 140) transitions.
// Phase 1: matrix 191 rows 157 cols
[2024-05-26 04:56:58] [INFO ] Computed 49 invariants in 1 ms
[2024-05-26 04:56:58] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-26 04:56:58] [INFO ] Invariant cache hit.
[2024-05-26 04:56:58] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-26 04:56:58] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-26 04:56:58] [INFO ] Redundant transitions in 68 ms returned []
Running 165 sub problems to find dead transitions.
[2024-05-26 04:56:58] [INFO ] Invariant cache hit.
[2024-05-26 04:56:58] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 190/347 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 54/260 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/347 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/348 variables, and 260 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4796 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 157/157 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 190/347 variables, 157/206 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 54/260 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 165/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/348 variables, and 425 constraints, problems are : Problem set: 0 solved, 165 unsolved in 3777 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 157/157 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 8607ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 8610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/234 places, 191/331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9024 ms. Remains : 157/234 places, 191/331 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-15
Stuttering criterion allowed to conclude after 436 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-15 finished in 9085 ms.
All properties solved by simple procedures.
Total runtime 244910 ms.
BK_STOP 1716699427280
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="NoC3x3-PT-4A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-4A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654352000604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-4A.tgz
mv NoC3x3-PT-4A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;