fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446600195
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-COL-S06J06T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 697747.00 0.00 0.00 ?TTF??TFTFFFF??? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446600195.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 itstools
Input is PolyORBLF-COL-S06J06T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 12K Apr 11 17:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 11 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 17:22 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.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 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-S06J06T04-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716911307927

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-28 15:48:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:48:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:48:29] [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-28 15:48:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:48:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2024-05-28 15:48:30] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 15:48:30] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 15:48:30] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40009 steps (3865 resets) in 1422 ms. (28 steps per ms) remains 7/30 properties
BEST_FIRST walk for 40003 steps (86 resets) in 437 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (21 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (73 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (88 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (710 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (82 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (65 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
[2024-05-28 15:48:31] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:48:31] [INFO ] Computed 26 invariants in 9 ms
[2024-05-28 15:48:31] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/49 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/52 variables, 3/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/73 variables, 12/21 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/78 variables, 3/24 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 64/143 variables, 79/104 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 8/112 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/145 variables, 2/114 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 1/115 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 5 solved, 2 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/49 variables, 3/8 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/50 variables, 1/9 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 7 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-28 15:48:31] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 8 ms to minimize.
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 22 constraints, problems are : Problem set: 7 solved, 0 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 428ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:48:31] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-28 15:48:31] [INFO ] Flatten gal took : 24 ms
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:48:31] [INFO ] Flatten gal took : 7 ms
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
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 15:48:31] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 140 ms.
[2024-05-28 15:48:31] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 120 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 496 transition count 1770
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 496 transition count 1770
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 492 transition count 1766
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 492 transition count 1766
Applied a total of 22 rules in 136 ms. Remains 492 /506 variables (removed 14) and now considering 1766/1774 (removed 8) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 15:48:32] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 492 cols
[2024-05-28 15:48:32] [INFO ] Computed 48 invariants in 121 ms
[2024-05-28 15:48:32] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 15:48:58] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2234 variables, and 38 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 26/33 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 15:49:23] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:49:24] [INFO ] Deduced a trap composed of 199 places in 178 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/2234 variables, and 40 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 26/33 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 3/3 constraints]
After SMT, in 55674ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 55702ms
[2024-05-28 15:49:27] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 15:49:27] [INFO ] Invariant cache hit.
[2024-05-28 15:49:28] [INFO ] Implicit Places using invariants in 395 ms returned [398, 399, 400, 401]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 412 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/506 places, 1766/1774 transitions.
Applied a total of 0 rules in 23 ms. Remains 488 /488 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56297 ms. Remains : 488/506 places, 1766/1774 transitions.
Support contains 120 out of 488 places after structural reductions.
[2024-05-28 15:49:28] [INFO ] Flatten gal took : 256 ms
[2024-05-28 15:49:28] [INFO ] Flatten gal took : 153 ms
[2024-05-28 15:49:28] [INFO ] Input system was already deterministic with 1766 transitions.
Support contains 116 out of 488 places (down from 120) after GAL structural reductions.
RANDOM walk for 40000 steps (195 resets) in 401 ms. (99 steps per ms) remains 1/14 properties
BEST_FIRST walk for 40001 steps (74 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
[2024-05-28 15:49:29] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 488 cols
[2024-05-28 15:49:29] [INFO ] Computed 44 invariants in 91 ms
[2024-05-28 15:49:29] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/226 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/341 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 484/2230 variables, and 41 constraints, problems are : Problem set: 1 solved, 0 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 316ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 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' '!(F(G(p0)))'
Support contains 8 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 1766/1766 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 488 transition count 1742
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 464 transition count 1742
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 48 place count 464 transition count 1686
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 160 place count 408 transition count 1686
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 256 place count 360 transition count 1638
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 260 place count 356 transition count 1634
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 356 transition count 1634
Applied a total of 264 rules in 213 ms. Remains 356 /488 variables (removed 132) and now considering 1634/1766 (removed 132) transitions.
Running 1628 sub problems to find dead transitions.
[2024-05-28 15:49:29] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
// Phase 1: matrix 1610 rows 356 cols
[2024-05-28 15:49:29] [INFO ] Computed 44 invariants in 56 ms
[2024-05-28 15:49:29] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:49:54] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-05-28 15:49:54] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:49:54] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:49:55] [INFO ] Deduced a trap composed of 144 places in 416 ms of which 3 ms to minimize.
[2024-05-28 15:49:55] [INFO ] Deduced a trap composed of 168 places in 392 ms of which 2 ms to minimize.
[2024-05-28 15:49:55] [INFO ] Deduced a trap composed of 141 places in 318 ms of which 2 ms to minimize.
[2024-05-28 15:49:56] [INFO ] Deduced a trap composed of 147 places in 328 ms of which 1 ms to minimize.
[2024-05-28 15:49:56] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1966 variables, and 46 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:50:09] [INFO ] Deduced a trap composed of 152 places in 346 ms of which 3 ms to minimize.
[2024-05-28 15:50:10] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:50:25] [INFO ] Deduced a trap composed of 110 places in 265 ms of which 2 ms to minimize.
[2024-05-28 15:50:25] [INFO ] Deduced a trap composed of 99 places in 330 ms of which 2 ms to minimize.
[2024-05-28 15:50:25] [INFO ] Deduced a trap composed of 102 places in 344 ms of which 3 ms to minimize.
[2024-05-28 15:50:26] [INFO ] Deduced a trap composed of 93 places in 304 ms of which 2 ms to minimize.
[2024-05-28 15:50:26] [INFO ] Deduced a trap composed of 85 places in 371 ms of which 3 ms to minimize.
SMT process timed out in 56758ms, After SMT, problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 56788ms
[2024-05-28 15:50:26] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:50:26] [INFO ] Invariant cache hit.
[2024-05-28 15:50:27] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-28 15:50:27] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:50:27] [INFO ] Invariant cache hit.
[2024-05-28 15:50:27] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:50:32] [INFO ] Implicit Places using invariants and state equation in 5717 ms returned []
Implicit Place search using SMT with State Equation took 6262 ms to find 0 implicit places.
[2024-05-28 15:50:33] [INFO ] Redundant transitions in 120 ms returned []
Running 1628 sub problems to find dead transitions.
[2024-05-28 15:50:33] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:50:33] [INFO ] Invariant cache hit.
[2024-05-28 15:50:33] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:50:57] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:50:57] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:50:57] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:50:57] [INFO ] Deduced a trap composed of 181 places in 398 ms of which 2 ms to minimize.
[2024-05-28 15:50:58] [INFO ] Deduced a trap composed of 59 places in 370 ms of which 2 ms to minimize.
[2024-05-28 15:50:58] [INFO ] Deduced a trap composed of 188 places in 385 ms of which 2 ms to minimize.
[2024-05-28 15:50:59] [INFO ] Deduced a trap composed of 151 places in 367 ms of which 2 ms to minimize.
[2024-05-28 15:50:59] [INFO ] Deduced a trap composed of 177 places in 325 ms of which 2 ms to minimize.
[2024-05-28 15:50:59] [INFO ] Deduced a trap composed of 147 places in 340 ms of which 3 ms to minimize.
[2024-05-28 15:51:00] [INFO ] Deduced a trap composed of 152 places in 459 ms of which 3 ms to minimize.
[2024-05-28 15:51:01] [INFO ] Deduced a trap composed of 152 places in 361 ms of which 3 ms to minimize.
[2024-05-28 15:51:12] [INFO ] Deduced a trap composed of 151 places in 270 ms of which 2 ms to minimize.
[2024-05-28 15:51:13] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 1 ms to minimize.
[2024-05-28 15:51:17] [INFO ] Deduced a trap composed of 139 places in 334 ms of which 2 ms to minimize.
[2024-05-28 15:51:18] [INFO ] Deduced a trap composed of 116 places in 320 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1966 variables, and 53 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:51:33] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 3 ms to minimize.
[2024-05-28 15:51:37] [INFO ] Deduced a trap composed of 102 places in 334 ms of which 3 ms to minimize.
[2024-05-28 15:51:38] [INFO ] Deduced a trap composed of 78 places in 363 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1966 variables, and 56 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1628 constraints, Known Traps: 18/18 constraints]
After SMT, in 75430ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 75451ms
Starting structural reductions in SI_LTL mode, iteration 1 : 356/488 places, 1634/1766 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138856 ms. Remains : 356/488 places, 1634/1766 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T04-LTLCardinality-00
Product exploration explored 100000 steps with 948 reset in 570 ms.
Product exploration explored 100000 steps with 948 reset in 681 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 646 steps (5 resets) in 11 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 8 out of 356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 356/356 places, 1634/1634 transitions.
Applied a total of 0 rules in 49 ms. Remains 356 /356 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Running 1628 sub problems to find dead transitions.
[2024-05-28 15:51:50] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:51:50] [INFO ] Invariant cache hit.
[2024-05-28 15:51:50] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:52:16] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-28 15:52:16] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:52:16] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
[2024-05-28 15:52:16] [INFO ] Deduced a trap composed of 181 places in 381 ms of which 3 ms to minimize.
[2024-05-28 15:52:17] [INFO ] Deduced a trap composed of 59 places in 363 ms of which 2 ms to minimize.
[2024-05-28 15:52:17] [INFO ] Deduced a trap composed of 188 places in 353 ms of which 3 ms to minimize.
[2024-05-28 15:52:17] [INFO ] Deduced a trap composed of 151 places in 391 ms of which 3 ms to minimize.
[2024-05-28 15:52:18] [INFO ] Deduced a trap composed of 177 places in 370 ms of which 3 ms to minimize.
[2024-05-28 15:52:18] [INFO ] Deduced a trap composed of 147 places in 445 ms of which 3 ms to minimize.
[2024-05-28 15:52:19] [INFO ] Deduced a trap composed of 152 places in 408 ms of which 3 ms to minimize.
[2024-05-28 15:52:20] [INFO ] Deduced a trap composed of 152 places in 344 ms of which 3 ms to minimize.
(s312 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 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 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.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 9.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 6.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0timeout
)
(s313 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1966 variables, and 49 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:52:32] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:52:46] [INFO ] Deduced a trap composed of 102 places in 307 ms of which 3 ms to minimize.
[2024-05-28 15:52:47] [INFO ] Deduced a trap composed of 114 places in 308 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1966 variables, and 52 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1628 constraints, Known Traps: 14/14 constraints]
After SMT, in 57306ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 57352ms
[2024-05-28 15:52:47] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:52:47] [INFO ] Invariant cache hit.
[2024-05-28 15:52:48] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-28 15:52:48] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:52:48] [INFO ] Invariant cache hit.
[2024-05-28 15:52:48] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:52:53] [INFO ] Implicit Places using invariants and state equation in 5662 ms returned []
Implicit Place search using SMT with State Equation took 6110 ms to find 0 implicit places.
[2024-05-28 15:52:53] [INFO ] Redundant transitions in 119 ms returned []
Running 1628 sub problems to find dead transitions.
[2024-05-28 15:52:53] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:52:53] [INFO ] Invariant cache hit.
[2024-05-28 15:52:53] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:53:20] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:53:21] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-05-28 15:53:21] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 1 ms to minimize.
[2024-05-28 15:53:21] [INFO ] Deduced a trap composed of 181 places in 412 ms of which 3 ms to minimize.
[2024-05-28 15:53:21] [INFO ] Deduced a trap composed of 59 places in 378 ms of which 3 ms to minimize.
[2024-05-28 15:53:22] [INFO ] Deduced a trap composed of 188 places in 423 ms of which 2 ms to minimize.
[2024-05-28 15:53:22] [INFO ] Deduced a trap composed of 151 places in 387 ms of which 3 ms to minimize.
[2024-05-28 15:53:23] [INFO ] Deduced a trap composed of 177 places in 405 ms of which 2 ms to minimize.
[2024-05-28 15:53:23] [INFO ] Deduced a trap composed of 147 places in 381 ms of which 2 ms to minimize.
[2024-05-28 15:53:24] [INFO ] Deduced a trap composed of 152 places in 389 ms of which 3 ms to minimize.
[2024-05-28 15:53:25] [INFO ] Deduced a trap composed of 152 places in 340 ms of which 2 ms to minimize.
[2024-05-28 15:53:37] [INFO ] Deduced a trap composed of 151 places in 289 ms of which 2 ms to minimize.
[2024-05-28 15:53:37] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 1 ms to minimize.
[2024-05-28 15:53:41] [INFO ] Deduced a trap composed of 139 places in 336 ms of which 3 ms to minimize.
[2024-05-28 15:53:42] [INFO ] Deduced a trap composed of 116 places in 329 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1966 variables, and 53 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:53:57] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 3 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 102 places in 328 ms of which 3 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 78 places in 395 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1966 variables, and 56 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1628 constraints, Known Traps: 18/18 constraints]
After SMT, in 78518ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 78539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 142189 ms. Remains : 356/356 places, 1634/1634 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
RANDOM walk for 3185 steps (20 resets) in 34 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 930 reset in 618 ms.
Product exploration explored 100000 steps with 977 reset in 540 ms.
Built C files in :
/tmp/ltsmin978258047899650256
[2024-05-28 15:54:14] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:54:14] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin978258047899650256
Running compilation step : cd /tmp/ltsmin978258047899650256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin978258047899650256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin978258047899650256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 8 out of 356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 356/356 places, 1634/1634 transitions.
Applied a total of 0 rules in 61 ms. Remains 356 /356 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Running 1628 sub problems to find dead transitions.
[2024-05-28 15:54:17] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:54:17] [INFO ] Invariant cache hit.
[2024-05-28 15:54:17] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:54:43] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 1 ms to minimize.
[2024-05-28 15:54:43] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:54:43] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:54:44] [INFO ] Deduced a trap composed of 181 places in 386 ms of which 3 ms to minimize.
[2024-05-28 15:54:44] [INFO ] Deduced a trap composed of 59 places in 380 ms of which 2 ms to minimize.
[2024-05-28 15:54:45] [INFO ] Deduced a trap composed of 188 places in 416 ms of which 2 ms to minimize.
[2024-05-28 15:54:45] [INFO ] Deduced a trap composed of 151 places in 394 ms of which 3 ms to minimize.
[2024-05-28 15:54:45] [INFO ] Deduced a trap composed of 177 places in 397 ms of which 3 ms to minimize.
[2024-05-28 15:54:46] [INFO ] Deduced a trap composed of 147 places in 389 ms of which 3 ms to minimize.
[2024-05-28 15:54:46] [INFO ] Deduced a trap composed of 152 places in 375 ms of which 2 ms to minimize.
[2024-05-28 15:54:48] [INFO ] Deduced a trap composed of 152 places in 332 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1966 variables, and 49 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:54:58] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:55:12] [INFO ] Deduced a trap composed of 102 places in 299 ms of which 3 ms to minimize.
[2024-05-28 15:55:13] [INFO ] Deduced a trap composed of 114 places in 373 ms of which 3 ms to minimize.
[2024-05-28 15:55:14] [INFO ] Deduced a trap composed of 152 places in 358 ms of which 2 ms to minimize.
[2024-05-28 15:55:15] [INFO ] Deduced a trap composed of 152 places in 307 ms of which 3 ms to minimize.
SMT process timed out in 57914ms, After SMT, problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 57940ms
[2024-05-28 15:55:15] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:55:15] [INFO ] Invariant cache hit.
[2024-05-28 15:55:15] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-28 15:55:15] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:55:15] [INFO ] Invariant cache hit.
[2024-05-28 15:55:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:55:21] [INFO ] Implicit Places using invariants and state equation in 5562 ms returned []
Implicit Place search using SMT with State Equation took 6030 ms to find 0 implicit places.
[2024-05-28 15:55:21] [INFO ] Redundant transitions in 47 ms returned []
Running 1628 sub problems to find dead transitions.
[2024-05-28 15:55:21] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 15:55:21] [INFO ] Invariant cache hit.
[2024-05-28 15:55:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:55:47] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:55:47] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:55:47] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:55:47] [INFO ] Deduced a trap composed of 181 places in 471 ms of which 3 ms to minimize.
[2024-05-28 15:55:48] [INFO ] Deduced a trap composed of 59 places in 419 ms of which 3 ms to minimize.
[2024-05-28 15:55:48] [INFO ] Deduced a trap composed of 188 places in 360 ms of which 2 ms to minimize.
[2024-05-28 15:55:49] [INFO ] Deduced a trap composed of 151 places in 396 ms of which 3 ms to minimize.
[2024-05-28 15:55:49] [INFO ] Deduced a trap composed of 177 places in 370 ms of which 3 ms to minimize.
[2024-05-28 15:55:50] [INFO ] Deduced a trap composed of 147 places in 440 ms of which 3 ms to minimize.
[2024-05-28 15:55:50] [INFO ] Deduced a trap composed of 152 places in 449 ms of which 3 ms to minimize.
[2024-05-28 15:55:52] [INFO ] Deduced a trap composed of 152 places in 319 ms of which 2 ms to minimize.
[2024-05-28 15:56:02] [INFO ] Deduced a trap composed of 151 places in 279 ms of which 2 ms to minimize.
[2024-05-28 15:56:03] [INFO ] Deduced a trap composed of 39 places in 338 ms of which 1 ms to minimize.
[2024-05-28 15:56:07] [INFO ] Deduced a trap composed of 139 places in 341 ms of which 4 ms to minimize.
[2024-05-28 15:56:08] [INFO ] Deduced a trap composed of 116 places in 329 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1966 variables, and 53 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 22/38 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
[2024-05-28 15:56:22] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 2 ms to minimize.
[2024-05-28 15:56:26] [INFO ] Deduced a trap composed of 102 places in 340 ms of which 3 ms to minimize.
[2024-05-28 15:56:27] [INFO ] Deduced a trap composed of 78 places in 328 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 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 9)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1966 variables, and 56 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/21 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/356 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1628 constraints, Known Traps: 18/18 constraints]
After SMT, in 77499ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 77535ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 141637 ms. Remains : 356/356 places, 1634/1634 transitions.
Built C files in :
/tmp/ltsmin8199614284569757154
[2024-05-28 15:56:38] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2024-05-28 15:56:38] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8199614284569757154
Running compilation step : cd /tmp/ltsmin8199614284569757154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8199614284569757154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8199614284569757154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:56:42] [INFO ] Flatten gal took : 131 ms
[2024-05-28 15:56:42] [INFO ] Flatten gal took : 129 ms
[2024-05-28 15:56:42] [INFO ] Time to serialize gal into /tmp/LTL2873433488453607981.gal : 35 ms
[2024-05-28 15:56:42] [INFO ] Time to serialize properties into /tmp/LTL7959032465504452141.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2873433488453607981.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15034973281447740194.hoa' '-atoms' '/tmp/LTL7959032465504452141.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7959032465504452141.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15034973281447740194.hoa
Detected timeout of ITS tools.
[2024-05-28 15:56:57] [INFO ] Flatten gal took : 110 ms
[2024-05-28 15:56:57] [INFO ] Flatten gal took : 110 ms
[2024-05-28 15:56:57] [INFO ] Time to serialize gal into /tmp/LTL4026804376747951344.gal : 17 ms
[2024-05-28 15:56:57] [INFO ] Time to serialize properties into /tmp/LTL15976787513384587787.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4026804376747951344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15976787513384587787.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((nyo_0+nyo_1)+(nyo_2+nyo_3))<=((P_1158_0+P_1158_1)+(P_1158_2+P_1158_3)))"))))
Formula 0 simplified : GF!"(((nyo_0+nyo_1)+(nyo_2+nyo_3))<=((P_1158_0+P_1158_1)+(P_1158_2+P_1158_3)))"
Detected timeout of ITS tools.
[2024-05-28 15:57:13] [INFO ] Flatten gal took : 131 ms
[2024-05-28 15:57:13] [INFO ] Applying decomposition
[2024-05-28 15:57:13] [INFO ] Flatten gal took : 116 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14988754737763512678.txt' '-o' '/tmp/graph14988754737763512678.bin' '-w' '/tmp/graph14988754737763512678.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14988754737763512678.bin' '-l' '-1' '-v' '-w' '/tmp/graph14988754737763512678.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:57:13] [INFO ] Decomposing Gal with order
[2024-05-28 15:57:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:57:13] [INFO ] Removed a total of 630 redundant transitions.
[2024-05-28 15:57:13] [INFO ] Flatten gal took : 291 ms
[2024-05-28 15:57:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 271 labels/synchronizations in 26 ms.
[2024-05-28 15:57:14] [INFO ] Time to serialize gal into /tmp/LTL11173749193852302059.gal : 17 ms
[2024-05-28 15:57:14] [INFO ] Time to serialize properties into /tmp/LTL6248523362327007481.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11173749193852302059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6248523362327007481.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((gu12.nyo_0+gu12.nyo_1)+(gu12.nyo_2+gu12.nyo_3))<=((gu12.P_1158_0+gu12.P_1158_1)+(gu12.P_1158_2+gu12.P_1158_3)))"))))
Formula 0 simplified : GF!"(((gu12.nyo_0+gu12.nyo_1)+(gu12.nyo_2+gu12.nyo_3))<=((gu12.P_1158_0+gu12.P_1158_1)+(gu12.P_1158_2+gu12.P_1158_3)))"
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S06J06T04-LTLCardinality-00 finished in 479800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((F(p2)&&p1)))))'
Support contains 70 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 1766/1766 transitions.
Applied a total of 0 rules in 8 ms. Remains 488 /488 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 15:57:29] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 488 cols
[2024-05-28 15:57:29] [INFO ] Computed 44 invariants in 76 ms
[2024-05-28 15:57:29] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 15:57:59] [INFO ] Deduced a trap composed of 203 places in 197 ms of which 6 ms to minimize.
[2024-05-28 15:57:59] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:57:59] [INFO ] Deduced a trap composed of 205 places in 160 ms of which 2 ms to minimize.
[2024-05-28 15:58:00] [INFO ] Deduced a trap composed of 202 places in 184 ms of which 3 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 Real declared 482/2230 variables, and 37 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 15:58:09] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2230 variables, and 38 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 5/5 constraints]
After SMT, in 58070ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 58089ms
[2024-05-28 15:58:27] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 15:58:27] [INFO ] Invariant cache hit.
[2024-05-28 15:58:27] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-28 15:58:27] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 15:58:27] [INFO ] Invariant cache hit.
[2024-05-28 15:58:28] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:58:33] [INFO ] Implicit Places using invariants and state equation in 5804 ms returned []
Implicit Place search using SMT with State Equation took 6254 ms to find 0 implicit places.
Running 1760 sub problems to find dead transitions.
[2024-05-28 15:58:33] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 15:58:33] [INFO ] Invariant cache hit.
[2024-05-28 15:58:33] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 15:59:02] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/2230 variables, and 34 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/482 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 15:59:38] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/2230 variables, and 35 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 20/27 constraints, State Equation: 0/488 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 2/2 constraints]
After SMT, in 77675ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 77710ms
Finished structural reductions in LTL mode , in 1 iterations and 142075 ms. Remains : 488/488 places, 1766/1766 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S06J06T04-LTLCardinality-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S06J06T04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T04-LTLCardinality-03 finished in 142298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 16 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 1766/1766 transitions.
Applied a total of 0 rules in 13 ms. Remains 488 /488 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 15:59:51] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 15:59:51] [INFO ] Invariant cache hit.
[2024-05-28 15:59:51] [INFO ] State equation strengthened by 112 read => feed constraints.

BK_STOP 1716912005674

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S06J06T04, 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 r290-tajo-171654446600195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J06T04.tgz
mv PolyORBLF-COL-S06J06T04 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 ;