Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730100833.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BART-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730100833
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 493K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 126K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 438K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 264K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 710K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 174K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 452K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 794K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.9M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 709K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.4M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 55K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BART-PT-005-CTLCardinality-2025-00
FORMULA_NAME BART-PT-005-CTLCardinality-2025-01
FORMULA_NAME BART-PT-005-CTLCardinality-2025-02
FORMULA_NAME BART-PT-005-CTLCardinality-2025-03
FORMULA_NAME BART-PT-005-CTLCardinality-2025-04
FORMULA_NAME BART-PT-005-CTLCardinality-2025-05
FORMULA_NAME BART-PT-005-CTLCardinality-2025-06
FORMULA_NAME BART-PT-005-CTLCardinality-2025-07
FORMULA_NAME BART-PT-005-CTLCardinality-2025-08
FORMULA_NAME BART-PT-005-CTLCardinality-2025-09
FORMULA_NAME BART-PT-005-CTLCardinality-2025-10
FORMULA_NAME BART-PT-005-CTLCardinality-2025-11
FORMULA_NAME BART-PT-005-CTLCardinality-2025-12
FORMULA_NAME BART-PT-005-CTLCardinality-2025-13
FORMULA_NAME BART-PT-005-CTLCardinality-2025-14
FORMULA_NAME BART-PT-005-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748671770654

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-31 06:09:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 06:09:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:09:32] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2025-05-31 06:09:32] [INFO ] Transformed 870 places.
[2025-05-31 06:09:32] [INFO ] Transformed 1010 transitions.
[2025-05-31 06:09:32] [INFO ] Found NUPN structural information;
[2025-05-31 06:09:32] [INFO ] Parsed PT model containing 870 places and 1010 transitions and 8100 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 70 ms.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-005-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 145 places :
Symmetric choice reduction at 0 with 145 rule applications. Total rules 145 place count 515 transition count 865
Iterating global reduction 0 with 145 rules applied. Total rules applied 290 place count 515 transition count 865
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 405 place count 400 transition count 750
Iterating global reduction 0 with 115 rules applied. Total rules applied 520 place count 400 transition count 750
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 540 place count 380 transition count 730
Iterating global reduction 0 with 20 rules applied. Total rules applied 560 place count 380 transition count 730
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 573 place count 367 transition count 717
Iterating global reduction 0 with 13 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 598 place count 355 transition count 705
Iterating global reduction 0 with 12 rules applied. Total rules applied 610 place count 355 transition count 705
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 621 place count 344 transition count 694
Iterating global reduction 0 with 11 rules applied. Total rules applied 632 place count 344 transition count 694
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 642 place count 334 transition count 684
Iterating global reduction 0 with 10 rules applied. Total rules applied 652 place count 334 transition count 684
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 660 place count 326 transition count 676
Iterating global reduction 0 with 8 rules applied. Total rules applied 668 place count 326 transition count 676
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 673 place count 321 transition count 671
Iterating global reduction 0 with 5 rules applied. Total rules applied 678 place count 321 transition count 671
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 681 place count 318 transition count 668
Iterating global reduction 0 with 3 rules applied. Total rules applied 684 place count 318 transition count 668
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 685 place count 317 transition count 667
Iterating global reduction 0 with 1 rules applied. Total rules applied 686 place count 317 transition count 667
Applied a total of 686 rules in 234 ms. Remains 317 /660 variables (removed 343) and now considering 667/1010 (removed 343) transitions.
// Phase 1: matrix 667 rows 317 cols
[2025-05-31 06:09:32] [INFO ] Computed 5 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:09:33] [INFO ] Implicit Places using invariants in 291 ms returned []
[2025-05-31 06:09:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:09:33] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 487 sub problems to find dead transitions.
[2025-05-31 06:09:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (OVERLAPS) 5/317 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 667/984 variables, 317/322 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 984/984 variables, and 322 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (OVERLAPS) 5/317 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 667/984 variables, 317/322 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 487/809 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/984 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 809 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 317/660 places, 667/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61096 ms. Remains : 317/660 places, 667/1010 transitions.
Support contains 26 out of 317 places after structural reductions.
[2025-05-31 06:10:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-31 06:10:33] [INFO ] Flatten gal took : 56 ms
[2025-05-31 06:10:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BART-PT-005-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 06:10:33] [INFO ] Flatten gal took : 24 ms
[2025-05-31 06:10:33] [INFO ] Input system was already deterministic with 667 transitions.
Support contains 17 out of 317 places (down from 26) after GAL structural reductions.
RANDOM walk for 17970 steps (2 resets) in 503 ms. (35 steps per ms) remains 0/15 properties
[2025-05-31 06:10:34] [INFO ] Flatten gal took : 21 ms
[2025-05-31 06:10:34] [INFO ] Flatten gal took : 19 ms
[2025-05-31 06:10:34] [INFO ] Input system was already deterministic with 667 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 295 transition count 645
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 295 transition count 645
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 281 transition count 631
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 281 transition count 631
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 273 transition count 623
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 273 transition count 623
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 265 transition count 615
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 265 transition count 615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 258 transition count 608
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 258 transition count 608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 252 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 252 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 249 transition count 599
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 249 transition count 599
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 139 place count 246 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 142 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 245 transition count 595
Applied a total of 144 rules in 40 ms. Remains 245 /317 variables (removed 72) and now considering 595/667 (removed 72) transitions.
// Phase 1: matrix 595 rows 245 cols
[2025-05-31 06:10:34] [INFO ] Computed 5 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:10:34] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-31 06:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:10:34] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-31 06:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 29436 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 28528 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58031ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 58032ms
Starting structural reductions in LTL mode, iteration 1 : 245/317 places, 595/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58301 ms. Remains : 245/317 places, 595/667 transitions.
[2025-05-31 06:11:32] [INFO ] Flatten gal took : 16 ms
[2025-05-31 06:11:32] [INFO ] Flatten gal took : 15 ms
[2025-05-31 06:11:32] [INFO ] Input system was already deterministic with 595 transitions.
[2025-05-31 06:11:32] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:11:32] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:11:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality7442833064784519543.gal : 10 ms
[2025-05-31 06:11:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality12709867439300211283.ctl : 13 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7442833064784519543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12709867439300211283.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,0.555404,26156,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: AX(AX(FALSE))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(FALSE))] = FALSE
(forward)formula 0,0,0.629498,26156,1,0,7,162456,7,1,2232,64128,2
FORMULA BART-PT-005-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 295 transition count 645
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 295 transition count 645
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 281 transition count 631
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 281 transition count 631
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 273 transition count 623
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 273 transition count 623
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 265 transition count 615
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 265 transition count 615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 258 transition count 608
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 258 transition count 608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 252 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 252 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 249 transition count 599
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 249 transition count 599
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 139 place count 246 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 142 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 245 transition count 595
Applied a total of 144 rules in 33 ms. Remains 245 /317 variables (removed 72) and now considering 595/667 (removed 72) transitions.
[2025-05-31 06:11:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:11:33] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-31 06:11:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:11:33] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-31 06:11:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 28833 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 27642 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56514ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 56515ms
Starting structural reductions in LTL mode, iteration 1 : 245/317 places, 595/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56758 ms. Remains : 245/317 places, 595/667 transitions.
[2025-05-31 06:12:30] [INFO ] Flatten gal took : 15 ms
[2025-05-31 06:12:30] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:12:30] [INFO ] Input system was already deterministic with 595 transitions.
[2025-05-31 06:12:30] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:12:30] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:12:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality18177005189230580505.gal : 4 ms
[2025-05-31 06:12:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality18243862084740819305.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18177005189230580505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18243862084740819305.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,0.539927,26240,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.82311,141360,1,0,5,804243,15,0,6062,126117,4
FORMULA BART-PT-005-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 295 transition count 645
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 295 transition count 645
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 281 transition count 631
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 281 transition count 631
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 273 transition count 623
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 273 transition count 623
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 265 transition count 615
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 265 transition count 615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 258 transition count 608
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 258 transition count 608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 252 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 252 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 249 transition count 599
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 249 transition count 599
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 139 place count 246 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 142 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 245 transition count 595
Applied a total of 144 rules in 28 ms. Remains 245 /317 variables (removed 72) and now considering 595/667 (removed 72) transitions.
[2025-05-31 06:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:12:34] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 06:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:12:34] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-31 06:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 29934 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 27987 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57959ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 57961ms
Starting structural reductions in LTL mode, iteration 1 : 245/317 places, 595/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58184 ms. Remains : 245/317 places, 595/667 transitions.
[2025-05-31 06:13:32] [INFO ] Flatten gal took : 11 ms
[2025-05-31 06:13:32] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:13:32] [INFO ] Input system was already deterministic with 595 transitions.
[2025-05-31 06:13:32] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:13:32] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:13:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality9834994818192316132.gal : 2 ms
[2025-05-31 06:13:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality2056325180945985203.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9834994818192316132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2056325180945985203.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,0.541766,26280,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: EG(E(EX(TRUE) U !(AX(FALSE))))
=> equivalent forward existential formula: [FwdG(Init,E(EX(TRUE) U !(!(EX(!(FALSE))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,4.05091,144696,1,0,5,810373,17,1,7021,138209,9
FORMULA BART-PT-005-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 295 transition count 645
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 295 transition count 645
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 281 transition count 631
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 281 transition count 631
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 273 transition count 623
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 273 transition count 623
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 265 transition count 615
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 265 transition count 615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 258 transition count 608
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 258 transition count 608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 252 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 252 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 249 transition count 599
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 249 transition count 599
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 139 place count 246 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 142 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 245 transition count 595
Applied a total of 144 rules in 23 ms. Remains 245 /317 variables (removed 72) and now considering 595/667 (removed 72) transitions.
[2025-05-31 06:13:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:13:36] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-31 06:13:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:13:36] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-31 06:13:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 28516 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 27574 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56119ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 56121ms
Starting structural reductions in LTL mode, iteration 1 : 245/317 places, 595/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56355 ms. Remains : 245/317 places, 595/667 transitions.
[2025-05-31 06:14:32] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:14:32] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:14:32] [INFO ] Input system was already deterministic with 595 transitions.
[2025-05-31 06:14:32] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:14:32] [INFO ] Flatten gal took : 9 ms
[2025-05-31 06:14:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality3035691029405113304.gal : 2 ms
[2025-05-31 06:14:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality2126478932131212794.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3035691029405113304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2126478932131212794.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,0.533701,26200,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: (EX(AX(FALSE)) * EX(TRUE))
=> equivalent forward existential formula: [(EY((Init * EX(!(EX(!(FALSE)))))) * TRUE)] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,3.529,130028,1,0,5,793195,9,0,5822,73329,2
FORMULA BART-PT-005-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 295 transition count 645
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 295 transition count 645
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 281 transition count 631
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 281 transition count 631
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 273 transition count 623
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 273 transition count 623
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 265 transition count 615
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 265 transition count 615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 258 transition count 608
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 258 transition count 608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 252 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 252 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 249 transition count 599
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 249 transition count 599
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 139 place count 246 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 142 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 245 transition count 595
Applied a total of 144 rules in 31 ms. Remains 245 /317 variables (removed 72) and now considering 595/667 (removed 72) transitions.
[2025-05-31 06:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:14:36] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-31 06:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:14:36] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-31 06:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 29030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 27309 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56377ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 56378ms
Starting structural reductions in LTL mode, iteration 1 : 245/317 places, 595/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56597 ms. Remains : 245/317 places, 595/667 transitions.
[2025-05-31 06:15:33] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:15:33] [INFO ] Flatten gal took : 10 ms
[2025-05-31 06:15:33] [INFO ] Input system was already deterministic with 595 transitions.
[2025-05-31 06:15:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:15:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:15:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality7705527890914780815.gal : 3 ms
[2025-05-31 06:15:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality3310666672339184065.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7705527890914780815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3310666672339184065.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,0.533848,26188,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: EF(EG(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX(TRUE))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.91157,142356,1,0,5,804243,13,0,6541,130476,7
FORMULA BART-PT-005-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 295 transition count 645
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 295 transition count 645
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 58 place count 281 transition count 631
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 281 transition count 631
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 273 transition count 623
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 273 transition count 623
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 265 transition count 615
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 265 transition count 615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 258 transition count 608
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 258 transition count 608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 252 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 252 transition count 602
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 249 transition count 599
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 249 transition count 599
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 139 place count 246 transition count 596
Iterating global reduction 0 with 3 rules applied. Total rules applied 142 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 143 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 144 place count 245 transition count 595
Applied a total of 144 rules in 21 ms. Remains 245 /317 variables (removed 72) and now considering 595/667 (removed 72) transitions.
[2025-05-31 06:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:15:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 06:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:15:37] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-31 06:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 29303 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 27362 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56700ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 56701ms
Starting structural reductions in LTL mode, iteration 1 : 245/317 places, 595/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56907 ms. Remains : 245/317 places, 595/667 transitions.
[2025-05-31 06:16:33] [INFO ] Flatten gal took : 13 ms
[2025-05-31 06:16:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:16:33] [INFO ] Input system was already deterministic with 595 transitions.
[2025-05-31 06:16:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:16:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:16:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality16723117152834788161.gal : 2 ms
[2025-05-31 06:16:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9736290239683574887.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16723117152834788161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9736290239683574887.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.82475e+08,0.557924,26176,2,7558,5,162456,6,0,1578,64128,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.608095,26176,1,0,6,162456,7,1,2007,64128,1
FORMULA BART-PT-005-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 296 transition count 646
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 296 transition count 646
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 283 transition count 633
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 283 transition count 633
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 276 transition count 626
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 276 transition count 626
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 269 transition count 619
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 269 transition count 619
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 263 transition count 613
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 263 transition count 613
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 258 transition count 608
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 258 transition count 608
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 256 transition count 606
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 256 transition count 606
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 254 transition count 604
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 254 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 253 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 253 transition count 603
Applied a total of 128 rules in 22 ms. Remains 253 /317 variables (removed 64) and now considering 603/667 (removed 64) transitions.
// Phase 1: matrix 603 rows 253 cols
[2025-05-31 06:16:34] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:16:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-31 06:16:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:16:34] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2025-05-31 06:16:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 5/253 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 603/856 variables, 253/258 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 856/856 variables, and 258 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 5/253 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 603/856 variables, 253/258 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 423/681 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/856 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (OVERLAPS) 0/856 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 856/856 variables, and 681 constraints, problems are : Problem set: 0 solved, 423 unsolved in 28507 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58556ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 58557ms
Starting structural reductions in LTL mode, iteration 1 : 253/317 places, 603/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58797 ms. Remains : 253/317 places, 603/667 transitions.
[2025-05-31 06:17:33] [INFO ] Flatten gal took : 11 ms
[2025-05-31 06:17:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:17:33] [INFO ] Input system was already deterministic with 603 transitions.
[2025-05-31 06:17:33] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:17:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:17:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality1954685841176817653.gal : 2 ms
[2025-05-31 06:17:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality4236970117391087808.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1954685841176817653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4236970117391087808.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.28594e+08,0.605645,28244,2,7786,5,171387,6,0,1618,69767,0


Converting to forward existential form...Done !
original formula: EX(AF(EX((TrainState_1_4_14==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EX((TrainState_1_4_14==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,11.8226,371396,1,0,10,2.578e+06,17,3,6735,1.01991e+06,8
FORMULA BART-PT-005-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 296 transition count 646
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 296 transition count 646
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 282 transition count 632
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 282 transition count 632
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 274 transition count 624
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 274 transition count 624
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 266 transition count 616
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 266 transition count 616
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 109 place count 259 transition count 609
Iterating global reduction 0 with 7 rules applied. Total rules applied 116 place count 259 transition count 609
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 122 place count 253 transition count 603
Iterating global reduction 0 with 6 rules applied. Total rules applied 128 place count 253 transition count 603
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 131 place count 250 transition count 600
Iterating global reduction 0 with 3 rules applied. Total rules applied 134 place count 250 transition count 600
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 137 place count 247 transition count 597
Iterating global reduction 0 with 3 rules applied. Total rules applied 140 place count 247 transition count 597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 246 transition count 596
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 246 transition count 596
Applied a total of 142 rules in 24 ms. Remains 246 /317 variables (removed 71) and now considering 596/667 (removed 71) transitions.
// Phase 1: matrix 596 rows 246 cols
[2025-05-31 06:17:45] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:17:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-31 06:17:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:17:45] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-05-31 06:17:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 5/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 596/842 variables, 246/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/842 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (OVERLAPS) 0/842 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 251 constraints, problems are : Problem set: 0 solved, 416 unsolved in 28791 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 5/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 596/842 variables, 246/251 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/842 variables, 416/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/842 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 6 (OVERLAPS) 0/842 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 667 constraints, problems are : Problem set: 0 solved, 416 unsolved in 27375 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56196ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 56197ms
Starting structural reductions in LTL mode, iteration 1 : 246/317 places, 596/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56420 ms. Remains : 246/317 places, 596/667 transitions.
[2025-05-31 06:18:41] [INFO ] Flatten gal took : 9 ms
[2025-05-31 06:18:41] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:18:41] [INFO ] Input system was already deterministic with 596 transitions.
[2025-05-31 06:18:41] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:18:41] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:18:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16807138601878862424.gal : 1 ms
[2025-05-31 06:18:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality15171393254256463411.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16807138601878862424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15171393254256463411.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.8824e+08,0.550211,26324,2,7602,5,158487,6,0,1583,62416,0


Converting to forward existential form...Done !
original formula: EG(AX(AX((TrainState_4_2_26==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EX(!((TrainState_4_2_26==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,4.95095,157408,1,0,9,943325,17,2,6100,166331,7
FORMULA BART-PT-005-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 301 transition count 651
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 301 transition count 651
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 292 transition count 642
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 292 transition count 642
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 288 transition count 638
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 288 transition count 638
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 284 transition count 634
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 284 transition count 634
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 280 transition count 630
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 280 transition count 630
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 277 transition count 627
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 277 transition count 627
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 275 transition count 625
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 275 transition count 625
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 273 transition count 623
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 273 transition count 623
Applied a total of 88 rules in 22 ms. Remains 273 /317 variables (removed 44) and now considering 623/667 (removed 44) transitions.
// Phase 1: matrix 623 rows 273 cols
[2025-05-31 06:18:46] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:18:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 06:18:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:18:47] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2025-05-31 06:18:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 5/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 623/896 variables, 273/278 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 443 unsolved
(t498 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 1.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 1.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 0.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 1.0)
(t182 1.0)
(t183 0.0)
(t184 1.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 0.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 1.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 1.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 0.0)
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 0.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 0.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 0.0)
(t272 0.0)
(t273 0.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 0.0)
(t287 0.0)
(t288 0.0)
(t289 0.0)
(t290 0.0)
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 0.0)
(t300 0.0)
(t301 0.0)
(t302 0.0)
(t303 0.0)
(t304 0.0)
(t305 0.0)
(t306 0.0)
(t307 0.0)
(t308 0.0)
(t309 0.0)
(t310 0.0)
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 0.0)
(t315 0.0)
(t316 0.0)
(t317 0.0)
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 0.0)
(t324 0.0)
(t325 0.0)
(t326 0.0)
(t327 0.0)
(t328 0.0)
(t329 0.0)
(t330 0.0)
(t331 0.0)
(t332 0.0)
(t333 0.0)
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 0.0)
(t338 0.0)
(t339 0.0)
(t340 0.0)
(t341 0.0)
(t342 0.0)
(t343 0.0)
(t344 0.0)
(t345 0.0)
(t346 0.0)
(t347 0.0)
(t348 0.0)
(t349 0.0)
(t350 0.0)
(t351 0.0)
(t352 0.0)
(t353 0.0)
(t354 0.0)
(t355 0.0)
(t356 0.0)
(t357 0.0)
(t358 0.0)
(t359 0.0)
(t360 0.0)
(t361 0.0)
(t362 0.0)
(t363 0.0)
(t364 0.0)
(t365 0.0)
(t366 0.0)
(t367 0.0)
(t368 0.0)
(t369 0.0)
(t370 0.0)
(t371 0.0)
(t372 0.0)
(t373 0.0)
(t374 0.0)
(t375 0.0)
(t376 0.0)
(t377 0.0)
(t378 0.0)
(t379 0.0)
(t380 0.0)
(t381 0.0)
(t382 0.0)
(t383 0.0)
(t384 0.0)
(t385 0.0)
(t386 0.0)
(t387 0.0)
(t388 0.0)
(t389 0.0)
(t390 0.0)
(t391 0.0)
(t392 0.0)
(t393 0.0)
(t394 0.0)
(t395 0.0)
(t396 0.0)
(t397 0.0)
(t398 0.0)
(t399 0.0)
(t400 0.0)
(t401 0.0)
(t402 0.0)
(t403 0.0)
(t404 0.0)
(t405 0.0)
(t406 0.0)
(t407 0.0)
(t408 0.0)
(t409 0.0)
(t410 0.0)
(t411 0.0)
(t412 0.0)
(t413 0.0)
(t414 0.0)
(t415 0.0)
(t416 0.0)
(t417 0.0)
(t418 0.0)
(t419 0.0)
(t420 0.0)
(t421 0.0)
(t422 0.0)
(t423 0.0)
(t424 0.0)
(t425 0.0)
(t426 0.0)
(t427 0.0)
(t428 0.0)
(t429 0.0)
(t430 0.0)
(t431 0.0)
(t432 0.0)
(t433 0.0)
(t434 0.0)
(t435 0.0)
(t436 0.0)
(t437 0.0)
(t438 0.0)
(t439 0.0)
(t440 0.0)
(t441 0.0)
(t442 0.0)
(t443 0.0)
(t444 0.0)
(t445 0.0)
(t446 0.0)
(t447 0.0)
(t448 0.0)
(t449 0.0)
(t450 0.0)
(t451 0.0)
(t452 0.0)
(t453 0.0)
(t454 0.0)
(t455 0.0)
(t456 0.0)
(t457 0.0)
(t458 0.0)
(t459 0.0)
(t460 0.0)
(t461 0.0)
(t462 0.0)
(t463 0.0)
(t464 0.0)
(t465 0.0)
(t466 0.0)
(t467 0.0)
(t468 0.0)
(t469 0.0)
(t470 0.0)
(t471 0.0)
(t472 0.0)
(t473 0.0)
(t474 0.0)
(t475 0.0)
(t476 0.0)
(t477 0.0)
(t478 0.0)
(t479 0.0)
(t480 0.0)
(t481 0.0)
(t482 0.0)
(t483 0.0)
(t484 0.0)
(t485 0.0)
(t486 0.0)
(t487 0.0)
(t488 0.0)
(t489 0.0)
(t490 0.0)
(t491 0.0)
(t492 0.0)
(t493 0.0)
(t494 0.0)
(t495 0.0)
(t496 0.0)
(t497 0.0)
(t498 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 896/896 variables, and 278 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 5/273 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 623/896 variables, 273/278 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 443/721 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 443 unsolved
(t13 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((t0 33)
(t1 33)
(t2 35)
(t3 32)
(t4 37)
(t5 1)
(t6 1)
(t7 1)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 1)
(t13 1timeout
)
(t14 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 896/896 variables, and 721 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 273/317 places, 623/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60281 ms. Remains : 273/317 places, 623/667 transitions.
[2025-05-31 06:19:47] [INFO ] Flatten gal took : 9 ms
[2025-05-31 06:19:47] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:19:47] [INFO ] Input system was already deterministic with 623 transitions.
[2025-05-31 06:19:47] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:19:47] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:19:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality13037388793548916656.gal : 3 ms
[2025-05-31 06:19:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality4447206852371582201.ctl : 1 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13037388793548916656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4447206852371582201.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.81435e+08,0.957154,38264,2,8442,5,235655,6,0,1718,112449,0


Converting to forward existential form...Done !
original formula: (A(((!(EX((TrainState_3_3_15==1))) + AG((TrainState_4_3_8==1))) + AG(((TrainState_2_4_22==0)&&(TrainState_1_4_21==1)))) U EX(((TrainState...222
=> equivalent forward existential formula: (([((FwdU(Init,!(EX(((TrainState_3_4_29==0)||(TrainState_2_1_28==1))))) * !(((!(EX((TrainState_3_3_15==1))) + !(...467
(forward)formula 0,0,0.967766,38264,1,0,8,235655,9,2,1723,112449,1
FORMULA BART-PT-005-CTLCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 300 transition count 650
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 300 transition count 650
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 289 transition count 639
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 289 transition count 639
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 282 transition count 632
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 282 transition count 632
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 275 transition count 625
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 275 transition count 625
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 269 transition count 619
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 269 transition count 619
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 266 transition count 616
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 266 transition count 616
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 264 transition count 614
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 264 transition count 614
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 262 transition count 612
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 262 transition count 612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 261 transition count 611
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 261 transition count 611
Applied a total of 112 rules in 26 ms. Remains 261 /317 variables (removed 56) and now considering 611/667 (removed 56) transitions.
// Phase 1: matrix 611 rows 261 cols
[2025-05-31 06:19:48] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:19:48] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-31 06:19:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:19:48] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2025-05-31 06:19:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 5/261 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 611/872 variables, 261/266 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 431 unsolved
(s20 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 872/872 variables, and 266 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 5/261 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 611/872 variables, 261/266 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/872 variables, 431/697 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/872 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 36)
(t1 36)
(t2 37)
(t3 32)
(t4 37)
(t5 1)
(t6 1)
(t7 1)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 1)
(t13 1)
(t14 1)
(t15 1)
(t16 1)
(t17 1)
(t18 1)
(t19 1)
(t20 1)
(t21 1)
(t22 1)
(t23 1)
(t24 1)
(t25 1)
(t26 1)
(t27 1)
(t28 1)
(t29 1)
(t30 1)
(t31 1)
(t32 1)
(t33 1)
(t34 1)
(t35 1)
(t36 1)
(t37 1)
(t38 1)
(t39 1)
(t40 1)
(t41 1)
(t42 1)
(t43 1)
(t44 1)
(t45 1)
(t46 1)
(t47 1)
(t48 1)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 1)
(t54 1)
(t55 1)
(t56 1)
(t57 1)
(t58 1)
(t59 1)
(t60 1)
(t61 1)
(t62 1)
(t63 1)
(t64 1)
(t65 1)
(t66 1)
(t67 1)
(t68 1)
(t69 1)
(t70 1)
(t71 1)
(t72 1)
(t73 1)
(t74 1)
(t75 1)
(t76 1)
(t77 1)
(t78 1)
(t79 1)
(t80 1)
(t81 1)
(t82 1)
(t83 1)
(t84 1)
(t85 1)
(t86 1)
(t87 1)
(t88 1)
(t89 1)
(t90 1)
(t91 1)
(t92 1)
(t93 1)
(t94 1)
(t95 1)
(t96 1)
(t97 1)
(t98 1)
(t99 1)
(t100 1)
(t101 1)
(t102 1)
(t103 0)
(t104 1)
(t105 1)
(t106 1)
(t107 1)
(t108 1)
(t109 1)
(t110 1)
(t111 1)
(t112 1)
(t113 1)
(t114 1)
(t115 1)
(t116 1)
(t117 1)
(t118 1)
(t119 1)
(t120 1)
(t121 1)
(t122 1)
(t123 0)
(t124 1)
(t125 1)
(t126 1)
(t127 1)
(t128 1)
(t129 1)
(t130 1)
(t131 1)
(t132 1)
(t133 1)
(t134 1)
(t135 1)
(t136 1)
(t137 1)
(t138 1)
(t139 1)
(t140 1)
(t141 1)
(t142 1)
(t143 1)
(t144 1)
(t145 1)
(t146 1)
(t147 1)
(t148 0)
(t149 1)
(t150 1)
(t151 1)
(t152 1)
(t153 1)
(t154 1)
(t155 1)
(t156 1)
(t157 1)
(t158 1)
(t159 1)
(t160 1)
(t161 1)
(t162 1)
(t163 1)
(t164 1)
(t165 1)
(t166 1)
(t167 1)
(t168 1)
(t169 1)
(t170 0)
(t171 0)
(t172 1)
(t173 0)
(t174 1)
(t175 1)
(t176 1)
(t177 1)
(t178 1)
(t179 1)
(t180 3)
(t181 3)
(t182 3)
(t183 2)
(t184 3)
(t185 1)
(t186 1)
(t187 1)
(t188 1)
(t189 1)
(t190timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/872 variables, and 697 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 261/317 places, 611/667 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60296 ms. Remains : 261/317 places, 611/667 transitions.
[2025-05-31 06:20:48] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:20:48] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:20:48] [INFO ] Input system was already deterministic with 611 transitions.
[2025-05-31 06:20:48] [INFO ] Flatten gal took : 8 ms
[2025-05-31 06:20:48] [INFO ] Flatten gal took : 7 ms
[2025-05-31 06:20:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17692738437920787631.gal : 2 ms
[2025-05-31 06:20:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality4556298778201957805.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17692738437920787631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4556298778201957805.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.84596e+08,0.716504,32908,2,8018,5,206043,6,0,1658,82878,0


Converting to forward existential form...Done !
original formula: AX(((AF((TrainState_2_3_33==1)) * E((TrainState_1_3_36==0) U (TrainState_2_3_25==0))) * (AX((TrainState_2_2_38==1)) * (A((TrainState_4_4_...220
=> equivalent forward existential formula: (([FwdG(EY(Init),!((TrainState_2_3_33==1)))] = FALSE * [(EY(Init) * !(E((TrainState_1_3_36==0) U (TrainState_2_3...419
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 609/0/2
(forward)formula 0,0,5.46606,162412,1,0,16,985924,28,4,6930,180256,13
FORMULA BART-PT-005-CTLCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 317/317 places, 667/667 transitions.
Graph (trivial) has 665 edges and 317 vertex of which 316 / 317 are part of one of the 5 SCC in 9 ms
Free SCC test removed 311 places
Ensure Unique test removed 660 transitions
Reduce isomorphic transitions removed 660 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 2 transition count 3
Applied a total of 5 rules in 25 ms. Remains 2 /317 variables (removed 315) and now considering 3/667 (removed 664) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-05-31 06:20:54] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:20:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-31 06:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:20:54] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:20:54] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-05-31 06:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/317 places, 3/667 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 132 ms. Remains : 2/317 places, 3/667 transitions.
[2025-05-31 06:20:54] [INFO ] Flatten gal took : 1 ms
[2025-05-31 06:20:54] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:20:54] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA BART-PT-005-CTLCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-31 06:20:54] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:20:54] [INFO ] Flatten gal took : 0 ms
[2025-05-31 06:20:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality679713459279557778.gal : 0 ms
[2025-05-31 06:20:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2204693976321583505.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality679713459279557778.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2204693976321583505.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 06:20:54] [INFO ] Flatten gal took : 14 ms
[2025-05-31 06:20:54] [INFO ] Flatten gal took : 11 ms
Total runtime 682440 ms.

BK_STOP 1748672454320

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="BART-PT-005"
export BK_EXAMINATION="CTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is BART-PT-005, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853730100833"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-005.tgz
mv BART-PT-005 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;