Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S04J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716850659857

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:57:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 22:57:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:57:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 22:57:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:57:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 679 ms
[2024-05-27 22:57:41] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 712 PT places and 4080.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:57:41] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 22:57:41] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (14 resets) in 1211 ms. (33 steps per ms) remains 8/30 properties
BEST_FIRST walk for 40001 steps (11 resets) in 428 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (9 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
[2024-05-27 22:57:43] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:57:43] [INFO ] Computed 26 invariants in 9 ms
[2024-05-27 22:57:43] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/50 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 5/55 variables, 3/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 8 solved, 0 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:57:43] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-27 22:57:43] [INFO ] Flatten gal took : 54 ms
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 22:57:43] [INFO ] Flatten gal took : 25 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:57:43] [INFO ] Unfolded HLPN to a Petri net with 712 places and 4012 transitions 27744 arcs in 123 ms.
[2024-05-27 22:57:43] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 332 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 92 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 22:57:43] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-27 22:57:44] [INFO ] Computed 50 invariants in 107 ms
[2024-05-27 22:57:44] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-27 22:58:10] [INFO ] Deduced a trap composed of 75 places in 266 ms of which 47 ms to minimize.
[2024-05-27 22:58:10] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 1 ms to minimize.
[2024-05-27 22:58:10] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-27 22:58:10] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-05-27 22:58:10] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 1 ms to minimize.
[2024-05-27 22:58:11] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 3 ms to minimize.
[2024-05-27 22:58:11] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-27 22:58:11] [INFO ] Deduced a trap composed of 403 places in 517 ms of which 5 ms to minimize.
[2024-05-27 22:58:12] [INFO ] Deduced a trap composed of 378 places in 335 ms of which 5 ms to minimize.
[2024-05-27 22:58:12] [INFO ] Deduced a trap composed of 191 places in 298 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 56 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-27 22:58:15] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:58:16] [INFO ] Deduced a trap composed of 359 places in 315 ms of which 4 ms to minimize.
[2024-05-27 22:58:18] [INFO ] Deduced a trap composed of 398 places in 383 ms of which 4 ms to minimize.
[2024-05-27 22:58:18] [INFO ] Deduced a trap composed of 372 places in 355 ms of which 4 ms to minimize.
[2024-05-27 22:58:18] [INFO ] Deduced a trap composed of 428 places in 389 ms of which 4 ms to minimize.
[2024-05-27 22:58:19] [INFO ] Deduced a trap composed of 412 places in 435 ms of which 5 ms to minimize.
[2024-05-27 22:58:19] [INFO ] Deduced a trap composed of 416 places in 421 ms of which 5 ms to minimize.
[2024-05-27 22:58:20] [INFO ] Deduced a trap composed of 360 places in 407 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 64 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 18/18 constraints]
After SMT, in 48976ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 49037ms
[2024-05-27 22:58:32] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-27 22:58:32] [INFO ] Invariant cache hit.
[2024-05-27 22:58:33] [INFO ] Implicit Places using invariants in 605 ms returned [548, 549, 550, 551, 552, 553, 554, 555]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 621 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 700/712 places, 1844/1844 transitions.
Applied a total of 0 rules in 16 ms. Remains 700 /700 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49792 ms. Remains : 700/712 places, 1844/1844 transitions.
Support contains 332 out of 700 places after structural reductions.
[2024-05-27 22:58:33] [INFO ] Flatten gal took : 256 ms
[2024-05-27 22:58:34] [INFO ] Flatten gal took : 224 ms
[2024-05-27 22:58:34] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 284 out of 700 places (down from 332) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 452 ms. (88 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 264 ms. (150 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
[2024-05-27 22:58:34] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 700 cols
[2024-05-27 22:58:35] [INFO ] Computed 42 invariants in 65 ms
[2024-05-27 22:58:35] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 635/656 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/656 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 12/668 variables, 10/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 698/2512 variables, and 41 constraints, problems are : Problem set: 3 solved, 0 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/700 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 772ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-COL-S04J04T08-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 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' '!(X(X(X(F(p0)))))'
Support contains 2 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 684 transition count 1828
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 684 transition count 1828
Applied a total of 32 rules in 67 ms. Remains 684 /700 variables (removed 16) and now considering 1828/1844 (removed 16) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-27 22:58:36] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-27 22:58:36] [INFO ] Computed 42 invariants in 27 ms
[2024-05-27 22:58:36] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 22:59:01] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-27 22:59:01] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 2 ms to minimize.
[2024-05-27 22:59:01] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-27 22:59:02] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-27 22:59:02] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-27 22:59:03] [INFO ] Deduced a trap composed of 200 places in 391 ms of which 4 ms to minimize.
[2024-05-27 22:59:04] [INFO ] Deduced a trap composed of 74 places in 315 ms of which 4 ms to minimize.
[2024-05-27 22:59:04] [INFO ] Deduced a trap composed of 427 places in 301 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 46 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 22:59:06] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 4 ms to minimize.
[2024-05-27 22:59:08] [INFO ] Deduced a trap composed of 83 places in 281 ms of which 3 ms to minimize.
[2024-05-27 22:59:12] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-27 22:59:18] [INFO ] Deduced a trap composed of 410 places in 377 ms of which 4 ms to minimize.
[2024-05-27 22:59:22] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 48674ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48697ms
[2024-05-27 22:59:24] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 22:59:24] [INFO ] Invariant cache hit.
[2024-05-27 22:59:25] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-05-27 22:59:25] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 22:59:25] [INFO ] Invariant cache hit.
[2024-05-27 22:59:26] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 22:59:38] [INFO ] Implicit Places using invariants and state equation in 13086 ms returned []
Implicit Place search using SMT with State Equation took 13637 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-27 22:59:38] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 22:59:38] [INFO ] Invariant cache hit.
[2024-05-27 22:59:38] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:00:04] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 1 ms to minimize.
[2024-05-27 23:00:04] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:00:04] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-27 23:00:04] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 5 ms to minimize.
[2024-05-27 23:00:04] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:00:04] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-05-27 23:00:04] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:00:05] [INFO ] Deduced a trap composed of 377 places in 416 ms of which 4 ms to minimize.
[2024-05-27 23:00:06] [INFO ] Deduced a trap composed of 181 places in 370 ms of which 5 ms to minimize.
[2024-05-27 23:00:06] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-05-27 23:00:08] [INFO ] Deduced a trap composed of 383 places in 436 ms of which 4 ms to minimize.
[2024-05-27 23:00:09] [INFO ] Deduced a trap composed of 394 places in 409 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:00:19] [INFO ] Deduced a trap composed of 410 places in 340 ms of which 5 ms to minimize.
[2024-05-27 23:00:45] [INFO ] Deduced a trap composed of 366 places in 418 ms of which 5 ms to minimize.
[2024-05-27 23:00:45] [INFO ] Deduced a trap composed of 379 places in 348 ms of which 5 ms to minimize.
[2024-05-27 23:00:46] [INFO ] Deduced a trap composed of 380 places in 313 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 54 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 16/16 constraints]
After SMT, in 68696ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68715ms
Starting structural reductions in LTL mode, iteration 1 : 684/700 places, 1828/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131126 ms. Remains : 684/700 places, 1828/1844 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 755 ms.
Product exploration explored 100000 steps with 25000 reset in 611 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 343 steps (0 resets) in 8 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 41 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-27 23:00:49] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 23:00:49] [INFO ] Invariant cache hit.
[2024-05-27 23:00:49] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:01:13] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-05-27 23:01:13] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-27 23:01:14] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-27 23:01:14] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-27 23:01:14] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-05-27 23:01:14] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:01:14] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-27 23:01:15] [INFO ] Deduced a trap composed of 377 places in 353 ms of which 4 ms to minimize.
[2024-05-27 23:01:15] [INFO ] Deduced a trap composed of 181 places in 349 ms of which 5 ms to minimize.
[2024-05-27 23:01:15] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 48 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:01:20] [INFO ] Deduced a trap composed of 356 places in 380 ms of which 5 ms to minimize.
[2024-05-27 23:01:32] [INFO ] Deduced a trap composed of 402 places in 446 ms of which 7 ms to minimize.
[2024-05-27 23:01:33] [INFO ] Deduced a trap composed of 387 places in 464 ms of which 5 ms to minimize.
[2024-05-27 23:01:33] [INFO ] Deduced a trap composed of 26 places in 442 ms of which 5 ms to minimize.
[2024-05-27 23:01:34] [INFO ] Deduced a trap composed of 350 places in 453 ms of which 5 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 53 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 15/15 constraints]
After SMT, in 47924ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 47968ms
[2024-05-27 23:01:37] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 23:01:37] [INFO ] Invariant cache hit.
[2024-05-27 23:01:37] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-27 23:01:37] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 23:01:37] [INFO ] Invariant cache hit.
[2024-05-27 23:01:38] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:01:50] [INFO ] Implicit Places using invariants and state equation in 12852 ms returned []
Implicit Place search using SMT with State Equation took 13469 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-27 23:01:50] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 23:01:50] [INFO ] Invariant cache hit.
[2024-05-27 23:01:50] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 2 ms to minimize.
[2024-05-27 23:02:16] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:02:17] [INFO ] Deduced a trap composed of 377 places in 364 ms of which 5 ms to minimize.
[2024-05-27 23:02:17] [INFO ] Deduced a trap composed of 181 places in 370 ms of which 5 ms to minimize.
[2024-05-27 23:02:18] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:02:20] [INFO ] Deduced a trap composed of 383 places in 465 ms of which 5 ms to minimize.
[2024-05-27 23:02:21] [INFO ] Deduced a trap composed of 394 places in 438 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:02:32] [INFO ] Deduced a trap composed of 410 places in 387 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 68390ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68409ms
Finished structural reductions in LTL mode , in 1 iterations and 129900 ms. Remains : 684/684 places, 1828/1828 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 285 steps (0 resets) in 6 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 660 ms.
Product exploration explored 100000 steps with 25000 reset in 585 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 684 transition count 1828
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 48 place count 684 transition count 1892
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 96 place count 684 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 112 place count 668 transition count 1876
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 128 place count 668 transition count 1876
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 248 place count 668 transition count 1876
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 280 place count 636 transition count 1844
Deduced a syphon composed of 176 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 312 place count 636 transition count 1844
Deduced a syphon composed of 176 places in 1 ms
Applied a total of 312 rules in 291 ms. Remains 636 /684 variables (removed 48) and now considering 1844/1828 (removed -16) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 23:03:01] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 636 cols
[2024-05-27 23:03:01] [INFO ] Computed 42 invariants in 30 ms
[2024-05-27 23:03:01] [INFO ] State equation strengthened by 224 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-27 23:03:27] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2024-05-27 23:03:27] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 2 ms to minimize.
[2024-05-27 23:03:27] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-27 23:03:27] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-27 23:03:27] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:03:27] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2024-05-27 23:03:27] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-27 23:03:28] [INFO ] Deduced a trap composed of 46 places in 293 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-05-27 23:03:28] [INFO ] Deduced a trap composed of 211 places in 371 ms of which 5 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/2448 variables, and 47 constraints, problems are : Problem set: 64 solved, 1776 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 26/28 constraints, State Equation: 0/636 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 64 solved, 1776 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 12/12 constraints. Problems are: Problem set: 64 solved, 1776 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 24/36 constraints. Problems are: Problem set: 64 solved, 1776 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 9/45 constraints. Problems are: Problem set: 64 solved, 1776 unsolved
[2024-05-27 23:03:33] [INFO ] Deduced a trap composed of 157 places in 288 ms of which 3 ms to minimize.
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 193 places in 150 ms of which 2 ms to minimize.
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-27 23:03:47] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 3 ms to minimize.
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
[2024-05-27 23:03:50] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 4 ms to minimize.
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 9)
(s163 1)
(s164 0)
(s165 1)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/2448 variables, and 53 constraints, problems are : Problem set: 120 solved, 1720 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 24/28 constraints, State Equation: 0/636 constraints, ReadFeed: 0/224 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 17/17 constraints]
After SMT, in 49281ms problems are : Problem set: 120 solved, 1720 unsolved
Search for dead transitions found 120 dead transitions in 49310ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 120 transitions.
[2024-05-27 23:03:51] [INFO ] Redundant transitions in 74 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 636/684 places, 1724/1828 transitions.
Graph (complete) has 3646 edges and 636 vertex of which 548 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.5 ms
Discarding 88 places :
Also discarding 0 output transitions
Deduced a syphon composed of 88 places in 3 ms
Applied a total of 1 rules in 41 ms. Remains 548 /636 variables (removed 88) and now considering 1724/1724 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 548/684 places, 1724/1828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49732 ms. Remains : 548/684 places, 1724/1828 transitions.
Support contains 2 out of 684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 684/684 places, 1828/1828 transitions.
Applied a total of 0 rules in 11 ms. Remains 684 /684 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
Running 1824 sub problems to find dead transitions.
[2024-05-27 23:03:51] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
// Phase 1: matrix 1796 rows 684 cols
[2024-05-27 23:03:51] [INFO ] Computed 42 invariants in 34 ms
[2024-05-27 23:03:51] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:04:17] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 1 ms to minimize.
[2024-05-27 23:04:17] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-27 23:04:17] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-05-27 23:04:17] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-27 23:04:17] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-27 23:04:18] [INFO ] Deduced a trap composed of 200 places in 303 ms of which 3 ms to minimize.
[2024-05-27 23:04:19] [INFO ] Deduced a trap composed of 74 places in 307 ms of which 4 ms to minimize.
[2024-05-27 23:04:19] [INFO ] Deduced a trap composed of 427 places in 315 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 46 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:04:21] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:04:23] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 3 ms to minimize.
[2024-05-27 23:04:26] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:04:31] [INFO ] Deduced a trap composed of 410 places in 324 ms of which 4 ms to minimize.
[2024-05-27 23:04:35] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 51 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 13/13 constraints]
After SMT, in 48756ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 48774ms
[2024-05-27 23:04:40] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 23:04:40] [INFO ] Invariant cache hit.
[2024-05-27 23:04:40] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-27 23:04:40] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 23:04:40] [INFO ] Invariant cache hit.
[2024-05-27 23:04:41] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:04:54] [INFO ] Implicit Places using invariants and state equation in 13614 ms returned []
Implicit Place search using SMT with State Equation took 14056 ms to find 0 implicit places.
Running 1824 sub problems to find dead transitions.
[2024-05-27 23:04:54] [INFO ] Flow matrix only has 1796 transitions (discarded 32 similar events)
[2024-05-27 23:04:54] [INFO ] Invariant cache hit.
[2024-05-27 23:04:54] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:05:19] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-05-27 23:05:19] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-27 23:05:19] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-27 23:05:20] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-27 23:05:20] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:05:20] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-05-27 23:05:20] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-27 23:05:21] [INFO ] Deduced a trap composed of 377 places in 378 ms of which 5 ms to minimize.
[2024-05-27 23:05:21] [INFO ] Deduced a trap composed of 181 places in 379 ms of which 5 ms to minimize.
[2024-05-27 23:05:21] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:05:24] [INFO ] Deduced a trap composed of 383 places in 429 ms of which 5 ms to minimize.
[2024-05-27 23:05:24] [INFO ] Deduced a trap composed of 394 places in 381 ms of which 4 ms to minimize.
(s34 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 (/ 1.0 4.0))
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2480 variables, and 50 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1824/1824 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1824 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1824 unsolved
[2024-05-27 23:05:35] [INFO ] Deduced a trap composed of 410 places in 377 ms of which 4 ms to minimize.
[2024-05-27 23:05:58] [INFO ] Deduced a trap composed of 366 places in 323 ms of which 4 ms to minimize.
[2024-05-27 23:05:58] [INFO ] Deduced a trap composed of 379 places in 315 ms of which 4 ms to minimize.
[2024-05-27 23:05:58] [INFO ] Deduced a trap composed of 380 places in 289 ms of which 3 ms to minimize.
[2024-05-27 23:06:00] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2480 variables, and 55 constraints, problems are : Problem set: 0 solved, 1824 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1824 constraints, Known Traps: 17/17 constraints]
After SMT, in 68360ms problems are : Problem set: 0 solved, 1824 unsolved
Search for dead transitions found 0 dead transitions in 68377ms
Finished structural reductions in LTL mode , in 1 iterations and 131226 ms. Remains : 684/684 places, 1828/1828 transitions.
Treatment of property PolyORBLF-COL-S04J04T08-LTLCardinality-02 finished in 446812 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||X(((p1||F(G(p0))) U (p0&&(p1||F(G(p0))))))))))'
Support contains 32 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 1844/1844 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 692 transition count 1836
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 692 transition count 1836
Applied a total of 16 rules in 40 ms. Remains 692 /700 variables (removed 8) and now considering 1836/1844 (removed 8) transitions.
Running 1832 sub problems to find dead transitions.
[2024-05-27 23:06:02] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
// Phase 1: matrix 1804 rows 692 cols
[2024-05-27 23:06:02] [INFO ] Computed 42 invariants in 36 ms
[2024-05-27 23:06:02] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-27 23:06:30] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 2 ms to minimize.
[2024-05-27 23:06:30] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 40 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-27 23:06:33] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-05-27 23:06:33] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2024-05-27 23:06:34] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 1 ms to minimize.
[2024-05-27 23:06:34] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-27 23:06:34] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:06:34] [INFO ] Deduced a trap composed of 75 places in 41 ms of which 1 ms to minimize.
[2024-05-27 23:06:34] [INFO ] Deduced a trap composed of 209 places in 285 ms of which 4 ms to minimize.
[2024-05-27 23:06:37] [INFO ] Deduced a trap composed of 388 places in 364 ms of which 4 ms to minimize.
[2024-05-27 23:06:37] [INFO ] Deduced a trap composed of 395 places in 347 ms of which 4 ms to minimize.
[2024-05-27 23:06:44] [INFO ] Deduced a trap composed of 110 places in 224 ms of which 3 ms to minimize.
[2024-05-27 23:06:47] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 51 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 13/13 constraints]
After SMT, in 48514ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 48535ms
[2024-05-27 23:06:51] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-27 23:06:51] [INFO ] Invariant cache hit.
[2024-05-27 23:06:51] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-27 23:06:51] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-27 23:06:51] [INFO ] Invariant cache hit.
[2024-05-27 23:06:52] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:07:04] [INFO ] Implicit Places using invariants and state equation in 12764 ms returned []
Implicit Place search using SMT with State Equation took 13197 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-05-27 23:07:04] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-27 23:07:04] [INFO ] Invariant cache hit.
[2024-05-27 23:07:04] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-27 23:07:30] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-27 23:07:30] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-05-27 23:07:30] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-05-27 23:07:30] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-27 23:07:30] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:07:30] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:07:30] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-27 23:07:31] [INFO ] Deduced a trap composed of 399 places in 399 ms of which 6 ms to minimize.
[2024-05-27 23:07:32] [INFO ] Deduced a trap composed of 403 places in 411 ms of which 5 ms to minimize.
[2024-05-27 23:07:32] [INFO ] Deduced a trap composed of 209 places in 389 ms of which 4 ms to minimize.
[2024-05-27 23:07:32] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-05-27 23:07:34] [INFO ] Deduced a trap composed of 191 places in 239 ms of which 3 ms to minimize.
[2024-05-27 23:07:35] [INFO ] Deduced a trap composed of 395 places in 465 ms of which 5 ms to minimize.
[2024-05-27 23:07:36] [INFO ] Deduced a trap composed of 379 places in 459 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 52 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-27 23:07:46] [INFO ] Deduced a trap composed of 366 places in 305 ms of which 4 ms to minimize.
[2024-05-27 23:07:46] [INFO ] Deduced a trap composed of 411 places in 308 ms of which 3 ms to minimize.
[2024-05-27 23:07:55] [INFO ] Deduced a trap composed of 418 places in 383 ms of which 5 ms to minimize.
[2024-05-27 23:07:58] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-05-27 23:08:11] [INFO ] Deduced a trap composed of 397 places in 315 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 57 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 19/19 constraints]
After SMT, in 68821ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 68853ms
Starting structural reductions in LTL mode, iteration 1 : 692/700 places, 1836/1844 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130637 ms. Remains : 692/700 places, 1836/1844 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S04J04T08-LTLCardinality-03
Product exploration explored 100000 steps with 610 reset in 491 ms.
Product exploration explored 100000 steps with 569 reset in 546 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 467 steps (0 resets) in 8 ms. (51 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 32 out of 692 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 692/692 places, 1836/1836 transitions.
Applied a total of 0 rules in 12 ms. Remains 692 /692 variables (removed 0) and now considering 1836/1836 (removed 0) transitions.
Running 1832 sub problems to find dead transitions.
[2024-05-27 23:08:15] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-27 23:08:15] [INFO ] Invariant cache hit.
[2024-05-27 23:08:15] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-27 23:08:41] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-27 23:08:41] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:08:41] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:08:41] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-05-27 23:08:42] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:08:42] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
[2024-05-27 23:08:42] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 0 ms to minimize.
[2024-05-27 23:08:42] [INFO ] Deduced a trap composed of 399 places in 388 ms of which 5 ms to minimize.
[2024-05-27 23:08:43] [INFO ] Deduced a trap composed of 403 places in 358 ms of which 5 ms to minimize.
[2024-05-27 23:08:43] [INFO ] Deduced a trap composed of 209 places in 373 ms of which 4 ms to minimize.
[2024-05-27 23:08:43] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 688/2496 variables, and 49 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1832/1832 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1832 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/688 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/688 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1832 unsolved
[2024-05-27 23:08:47] [INFO ] Deduced a trap composed of 343 places in 512 ms of which 5 ms to minimize.
[2024-05-27 23:08:48] [INFO ] Deduced a trap composed of 222 places in 255 ms of which 3 ms to minimize.
[2024-05-27 23:09:01] [INFO ] Deduced a trap composed of 389 places in 476 ms of which 5 ms to minimize.
[2024-05-27 23:09:02] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/2496 variables, and 53 constraints, problems are : Problem set: 0 solved, 1832 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 27/30 constraints, State Equation: 0/692 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1832 constraints, Known Traps: 15/15 constraints]
After SMT, in 48860ms problems are : Problem set: 0 solved, 1832 unsolved
Search for dead transitions found 0 dead transitions in 48881ms
[2024-05-27 23:09:04] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-27 23:09:04] [INFO ] Invariant cache hit.
[2024-05-27 23:09:04] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-05-27 23:09:04] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-27 23:09:04] [INFO ] Invariant cache hit.
[2024-05-27 23:09:05] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-27 23:09:17] [INFO ] Implicit Places using invariants and state equation in 12371 ms returned []
Implicit Place search using SMT with State Equation took 12949 ms to find 0 implicit places.
Running 1832 sub problems to find dead transitions.
[2024-05-27 23:09:17] [INFO ] Flow matrix only has 1804 transitions (discarded 32 similar events)
[2024-05-27 23:09:17] [INFO ] Invariant cache hit.
[2024-05-27 23:09:17] [INFO ] State equation strengthened by 160 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J04T08

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 81
TRANSITIONS: 65
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 6
COLOR VARS: 25
ARCS: 254
LOADING TIME: 0.353

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 712
TRANSITIONS: 4012
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 27744
UNFOLDING TIME: 0.549

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.175
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 1.308
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 1527
MODEL NAME: /home/mcc/execution/model
712 places, 4012 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S04J04T08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S04J04T08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445200131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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