Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180400222.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutonomousCar-PT-09b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180400222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 865K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716318340012

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 19:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:05:44] [INFO ] Load time of PNML (sax parser for PT used): 414 ms
[2024-05-21 19:05:44] [INFO ] Transformed 391 places.
[2024-05-21 19:05:44] [INFO ] Transformed 1554 transitions.
[2024-05-21 19:05:44] [INFO ] Found NUPN structural information;
[2024-05-21 19:05:44] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 653 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutonomousCar-PT-09b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 339 transition count 1502
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 339 transition count 1502
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 428 place count 339 transition count 1178
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 439 place count 328 transition count 1167
Iterating global reduction 1 with 11 rules applied. Total rules applied 450 place count 328 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 451 place count 327 transition count 1166
Iterating global reduction 1 with 1 rules applied. Total rules applied 452 place count 327 transition count 1166
Applied a total of 452 rules in 163 ms. Remains 327 /391 variables (removed 64) and now considering 1166/1554 (removed 388) transitions.
// Phase 1: matrix 1166 rows 327 cols
[2024-05-21 19:05:44] [INFO ] Computed 14 invariants in 38 ms
[2024-05-21 19:05:45] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2024-05-21 19:05:45] [INFO ] Invariant cache hit.
[2024-05-21 19:05:47] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 2666 ms to find 0 implicit places.
[2024-05-21 19:05:47] [INFO ] Invariant cache hit.
[2024-05-21 19:05:48] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 327/391 places, 1166/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3953 ms. Remains : 327/391 places, 1166/1554 transitions.
Support contains 20 out of 327 places after structural reductions.
[2024-05-21 19:05:49] [INFO ] Flatten gal took : 358 ms
[2024-05-21 19:05:49] [INFO ] Flatten gal took : 232 ms
[2024-05-21 19:05:49] [INFO ] Input system was already deterministic with 1166 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 823 ms. (steps per millisecond=12 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 19:05:50] [INFO ] Invariant cache hit.
[2024-05-21 19:05:50] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 19:05:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-21 19:05:51] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 19:05:52] [INFO ] Deduced a trap composed of 6 places in 823 ms of which 9 ms to minimize.
[2024-05-21 19:05:53] [INFO ] Deduced a trap composed of 16 places in 891 ms of which 1 ms to minimize.
[2024-05-21 19:05:54] [INFO ] Deduced a trap composed of 14 places in 680 ms of which 2 ms to minimize.
[2024-05-21 19:05:54] [INFO ] Deduced a trap composed of 32 places in 709 ms of which 3 ms to minimize.
[2024-05-21 19:05:55] [INFO ] Deduced a trap composed of 32 places in 719 ms of which 1 ms to minimize.
[2024-05-21 19:05:56] [INFO ] Deduced a trap composed of 31 places in 666 ms of which 1 ms to minimize.
[2024-05-21 19:05:57] [INFO ] Deduced a trap composed of 14 places in 771 ms of which 1 ms to minimize.
[2024-05-21 19:05:58] [INFO ] Deduced a trap composed of 32 places in 708 ms of which 2 ms to minimize.
[2024-05-21 19:05:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6397 ms
[2024-05-21 19:05:58] [INFO ] After 7307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 139 ms.
[2024-05-21 19:05:58] [INFO ] After 7618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 79 ms.
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Graph (trivial) has 304 edges and 327 vertex of which 4 / 327 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1588 edges and 325 vertex of which 323 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.43 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 323 transition count 1043
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 165 rules applied. Total rules applied 286 place count 206 transition count 995
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 29 rules applied. Total rules applied 315 place count 178 transition count 994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 177 transition count 994
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 316 place count 177 transition count 987
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 330 place count 170 transition count 987
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 332 place count 168 transition count 985
Iterating global reduction 4 with 2 rules applied. Total rules applied 334 place count 168 transition count 985
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 334 place count 168 transition count 984
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 336 place count 167 transition count 984
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 337 place count 166 transition count 975
Iterating global reduction 4 with 1 rules applied. Total rules applied 338 place count 166 transition count 975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 340 place count 166 transition count 973
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 341 place count 165 transition count 973
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 487 place count 92 transition count 900
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 488 place count 92 transition count 899
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 505 place count 75 transition count 746
Iterating global reduction 7 with 17 rules applied. Total rules applied 522 place count 75 transition count 746
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 530 place count 75 transition count 738
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 532 place count 74 transition count 737
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 533 place count 74 transition count 736
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 543 place count 74 transition count 726
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 553 place count 64 transition count 726
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 554 place count 64 transition count 725
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 555 place count 64 transition count 725
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 556 place count 63 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 557 place count 62 transition count 724
Applied a total of 557 rules in 917 ms. Remains 62 /327 variables (removed 265) and now considering 724/1166 (removed 442) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 917 ms. Remains : 62/327 places, 724/1166 transitions.
Finished random walk after 148 steps, including 2 resets, run visited all 2 properties in 11 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 49 stabilizing places and 50 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 321 transition count 1160
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 321 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 320 transition count 1159
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 320 transition count 1159
Applied a total of 14 rules in 32 ms. Remains 320 /327 variables (removed 7) and now considering 1159/1166 (removed 7) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2024-05-21 19:05:59] [INFO ] Computed 14 invariants in 11 ms
[2024-05-21 19:06:00] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-05-21 19:06:00] [INFO ] Invariant cache hit.
[2024-05-21 19:06:01] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2024-05-21 19:06:01] [INFO ] Invariant cache hit.
[2024-05-21 19:06:02] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 1159/1166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2733 ms. Remains : 320/327 places, 1159/1166 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s267 0) (EQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 799 ms.
Product exploration explored 100000 steps with 50000 reset in 511 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 37 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-05 finished in 4531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Graph (trivial) has 303 edges and 327 vertex of which 4 / 327 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 324 transition count 1048
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 159 rules applied. Total rules applied 275 place count 209 transition count 1004
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 302 place count 183 transition count 1003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 182 transition count 1003
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 303 place count 182 transition count 995
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 319 place count 174 transition count 995
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 322 place count 171 transition count 992
Iterating global reduction 4 with 3 rules applied. Total rules applied 325 place count 171 transition count 992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 325 place count 171 transition count 991
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 327 place count 170 transition count 991
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 169 transition count 982
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 169 transition count 982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 331 place count 169 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 332 place count 168 transition count 980
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 478 place count 95 transition count 906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 479 place count 95 transition count 905
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 496 place count 78 transition count 752
Iterating global reduction 7 with 17 rules applied. Total rules applied 513 place count 78 transition count 752
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 521 place count 78 transition count 744
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 525 place count 76 transition count 742
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 527 place count 76 transition count 742
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 529 place count 74 transition count 740
Applied a total of 529 rules in 455 ms. Remains 74 /327 variables (removed 253) and now considering 740/1166 (removed 426) transitions.
// Phase 1: matrix 740 rows 74 cols
[2024-05-21 19:06:04] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 19:06:04] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-21 19:06:04] [INFO ] Invariant cache hit.
[2024-05-21 19:06:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:06:05] [INFO ] Implicit Places using invariants and state equation in 595 ms returned [69, 73]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 933 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/327 places, 740/1166 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 739
Applied a total of 2 rules in 71 ms. Remains 71 /72 variables (removed 1) and now considering 739/740 (removed 1) transitions.
// Phase 1: matrix 739 rows 71 cols
[2024-05-21 19:06:05] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 19:06:06] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-21 19:06:06] [INFO ] Invariant cache hit.
[2024-05-21 19:06:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:06:06] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/327 places, 739/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2501 ms. Remains : 71/327 places, 739/1166 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s64 1) (AND (NEQ s44 0) (NEQ s30 1))), p1:(AND (NEQ s0 0) (NEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 472 reset in 197 ms.
Product exploration explored 100000 steps with 2502 reset in 471 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 574 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 588463 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 588463 steps, saw 93204 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 19:06:11] [INFO ] Invariant cache hit.
[2024-05-21 19:06:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:06:11] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 19:06:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:06:11] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 19:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:06:11] [INFO ] After 47ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 19:06:12] [INFO ] Deduced a trap composed of 2 places in 472 ms of which 2 ms to minimize.
[2024-05-21 19:06:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 525 ms
[2024-05-21 19:06:12] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-21 19:06:12] [INFO ] After 1031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 739/739 transitions.
Graph (complete) has 851 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 736
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 70 transition count 726
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 60 transition count 726
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 60 transition count 724
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 60 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 59 transition count 727
Applied a total of 27 rules in 268 ms. Remains 59 /71 variables (removed 12) and now considering 727/739 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 59/71 places, 727/739 transitions.
Finished random walk after 141 steps, including 1 resets, run visited all 2 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 739/739 transitions.
Applied a total of 0 rules in 69 ms. Remains 71 /71 variables (removed 0) and now considering 739/739 (removed 0) transitions.
[2024-05-21 19:06:13] [INFO ] Invariant cache hit.
[2024-05-21 19:06:13] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-21 19:06:13] [INFO ] Invariant cache hit.
[2024-05-21 19:06:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:06:14] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
[2024-05-21 19:06:14] [INFO ] Redundant transitions in 106 ms returned [562]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 738 rows 71 cols
[2024-05-21 19:06:14] [INFO ] Computed 11 invariants in 6 ms
[2024-05-21 19:06:15] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/71 places, 738/739 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 69 transition count 738
Applied a total of 2 rules in 58 ms. Remains 69 /71 variables (removed 2) and now considering 738/738 (removed 0) transitions.
// Phase 1: matrix 738 rows 69 cols
[2024-05-21 19:06:15] [INFO ] Computed 11 invariants in 8 ms
[2024-05-21 19:06:15] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-21 19:06:15] [INFO ] Invariant cache hit.
[2024-05-21 19:06:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:06:16] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/71 places, 738/739 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3271 ms. Remains : 69/71 places, 738/739 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 603 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:06:16] [INFO ] Invariant cache hit.
[2024-05-21 19:06:16] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:06:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-21 19:06:17] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:06:17] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:06:17] [INFO ] Deduced a trap composed of 3 places in 504 ms of which 1 ms to minimize.
[2024-05-21 19:06:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2024-05-21 19:06:17] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-21 19:06:17] [INFO ] After 950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 738/738 transitions.
Graph (complete) has 845 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 68 transition count 735
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 68 transition count 725
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 58 transition count 725
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 58 transition count 723
Applied a total of 25 rules in 126 ms. Remains 58 /69 variables (removed 11) and now considering 723/738 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 58/69 places, 723/738 transitions.
Finished random walk after 1125 steps, including 19 resets, run visited all 1 properties in 14 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 859 reset in 149 ms.
Product exploration explored 100000 steps with 2000 reset in 425 ms.
Built C files in :
/tmp/ltsmin4065742719313013232
[2024-05-21 19:06:19] [INFO ] Computing symmetric may disable matrix : 738 transitions.
[2024-05-21 19:06:19] [INFO ] Computation of Complete disable matrix. took 134 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:06:19] [INFO ] Computing symmetric may enable matrix : 738 transitions.
[2024-05-21 19:06:19] [INFO ] Computation of Complete enable matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:06:19] [INFO ] Computing Do-Not-Accords matrix : 738 transitions.
[2024-05-21 19:06:19] [INFO ] Computation of Completed DNA matrix. took 66 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:06:19] [INFO ] Built C files in 503ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4065742719313013232
Running compilation step : cd /tmp/ltsmin4065742719313013232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4065742719313013232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4065742719313013232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 738/738 transitions.
Applied a total of 0 rules in 66 ms. Remains 69 /69 variables (removed 0) and now considering 738/738 (removed 0) transitions.
[2024-05-21 19:06:22] [INFO ] Invariant cache hit.
[2024-05-21 19:06:23] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-21 19:06:23] [INFO ] Invariant cache hit.
[2024-05-21 19:06:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:06:24] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
[2024-05-21 19:06:24] [INFO ] Redundant transitions in 227 ms returned []
[2024-05-21 19:06:24] [INFO ] Invariant cache hit.
[2024-05-21 19:06:25] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2511 ms. Remains : 69/69 places, 738/738 transitions.
Built C files in :
/tmp/ltsmin601949262013949274
[2024-05-21 19:06:25] [INFO ] Computing symmetric may disable matrix : 738 transitions.
[2024-05-21 19:06:25] [INFO ] Computation of Complete disable matrix. took 151 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:06:25] [INFO ] Computing symmetric may enable matrix : 738 transitions.
[2024-05-21 19:06:25] [INFO ] Computation of Complete enable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:06:25] [INFO ] Computing Do-Not-Accords matrix : 738 transitions.
[2024-05-21 19:06:25] [INFO ] Computation of Completed DNA matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:06:25] [INFO ] Built C files in 550ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin601949262013949274
Running compilation step : cd /tmp/ltsmin601949262013949274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin601949262013949274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin601949262013949274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:06:29] [INFO ] Flatten gal took : 237 ms
[2024-05-21 19:06:29] [INFO ] Flatten gal took : 145 ms
[2024-05-21 19:06:29] [INFO ] Time to serialize gal into /tmp/LTL10340118796000049376.gal : 25 ms
[2024-05-21 19:06:29] [INFO ] Time to serialize properties into /tmp/LTL1474838368743480969.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10340118796000049376.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15663966127451957206.hoa' '-atoms' '/tmp/LTL1474838368743480969.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1474838368743480969.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15663966127451957206.hoa
Detected timeout of ITS tools.
[2024-05-21 19:06:44] [INFO ] Flatten gal took : 110 ms
[2024-05-21 19:06:44] [INFO ] Flatten gal took : 105 ms
[2024-05-21 19:06:44] [INFO ] Time to serialize gal into /tmp/LTL1993044588567821624.gal : 15 ms
[2024-05-21 19:06:44] [INFO ] Time to serialize properties into /tmp/LTL7618853457482864944.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1993044588567821624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7618853457482864944.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((("(p332!=1)")||(X(F("((p5!=0)&&(p106!=1))"))))||("((p222!=0)&&(p143!=1))")))))
Formula 0 simplified : G(F(!"((p222!=0)&&(p143!=1))" & !"(p332!=1)") & FG!"((p5!=0)&&(p106!=1))")
Detected timeout of ITS tools.
[2024-05-21 19:06:59] [INFO ] Flatten gal took : 101 ms
[2024-05-21 19:06:59] [INFO ] Applying decomposition
[2024-05-21 19:07:00] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15126780056304552880.txt' '-o' '/tmp/graph15126780056304552880.bin' '-w' '/tmp/graph15126780056304552880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15126780056304552880.bin' '-l' '-1' '-v' '-w' '/tmp/graph15126780056304552880.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:07:00] [INFO ] Decomposing Gal with order
[2024-05-21 19:07:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:07:00] [INFO ] Removed a total of 5417 redundant transitions.
[2024-05-21 19:07:00] [INFO ] Flatten gal took : 312 ms
[2024-05-21 19:07:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 92 ms.
[2024-05-21 19:07:01] [INFO ] Time to serialize gal into /tmp/LTL18238284092570790217.gal : 14 ms
[2024-05-21 19:07:01] [INFO ] Time to serialize properties into /tmp/LTL13156912733827966532.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18238284092570790217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13156912733827966532.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G((("(u20.p332!=1)")||(X(F("((u20.p5!=0)&&(i2.u4.p106!=1))"))))||("((u12.p222!=0)&&(i3.u7.p143!=1))")))))
Formula 0 simplified : G(F(!"((u12.p222!=0)&&(i3.u7.p143!=1))" & !"(u20.p332!=1)") & FG!"((u20.p5!=0)&&(i2.u4.p106!=1))")
Reverse transition relation is NOT exact ! Due to transitions u12.t152, u12.t151.t153, u13.t148, u20.t311, u20.t22.t15.t16.t637.t307.t639.t308.t17.t18.t42,...760
Computing Next relation with stutter on 412301 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin938602966476906672
[2024-05-21 19:07:16] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin938602966476906672
Running compilation step : cd /tmp/ltsmin938602966476906672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin938602966476906672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin938602966476906672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLCardinality-07 finished in 75027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((!F(X(p0)) U p1) U p0)&&G((p2 U p3))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Graph (trivial) has 302 edges and 327 vertex of which 4 / 327 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 324 transition count 1051
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 158 rules applied. Total rules applied 271 place count 212 transition count 1005
Reduce places removed 27 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 30 rules applied. Total rules applied 301 place count 185 transition count 1002
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 304 place count 182 transition count 1002
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 304 place count 182 transition count 994
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 320 place count 174 transition count 994
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 324 place count 170 transition count 990
Iterating global reduction 4 with 4 rules applied. Total rules applied 328 place count 170 transition count 990
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 328 place count 170 transition count 988
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 332 place count 168 transition count 988
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 333 place count 167 transition count 979
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 167 transition count 979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 336 place count 167 transition count 977
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 337 place count 166 transition count 977
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 471 place count 99 transition count 909
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 472 place count 99 transition count 908
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 490 place count 81 transition count 745
Iterating global reduction 7 with 18 rules applied. Total rules applied 508 place count 81 transition count 745
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 514 place count 81 transition count 739
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 518 place count 79 transition count 737
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 519 place count 79 transition count 736
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 521 place count 79 transition count 736
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 523 place count 77 transition count 734
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 524 place count 76 transition count 734
Applied a total of 524 rules in 389 ms. Remains 76 /327 variables (removed 251) and now considering 734/1166 (removed 432) transitions.
// Phase 1: matrix 734 rows 76 cols
[2024-05-21 19:07:19] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 19:07:19] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-21 19:07:19] [INFO ] Invariant cache hit.
[2024-05-21 19:07:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:07:20] [INFO ] Implicit Places using invariants and state equation in 621 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 983 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/327 places, 734/1166 transitions.
Applied a total of 0 rules in 50 ms. Remains 75 /75 variables (removed 0) and now considering 734/734 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1423 ms. Remains : 75/327 places, 734/1166 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p3), (NOT p3), p0, (NOT p0), p0]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(OR p3 p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1))), acceptance={} source=0 dest: 4}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(OR p3 p2), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s11 1), p2:(OR (EQ s70 0) (EQ s14 1)), p0:(EQ s16 1), p1:(OR (EQ s13 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLCardinality-10 finished in 1882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Graph (trivial) has 310 edges and 327 vertex of which 4 / 327 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 324 transition count 1043
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 172 rules applied. Total rules applied 293 place count 204 transition count 991
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 324 place count 173 transition count 991
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 324 place count 173 transition count 986
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 334 place count 168 transition count 986
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 337 place count 165 transition count 983
Iterating global reduction 3 with 3 rules applied. Total rules applied 340 place count 165 transition count 983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 340 place count 165 transition count 981
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 344 place count 163 transition count 981
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 490 place count 90 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 491 place count 90 transition count 906
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 509 place count 72 transition count 743
Iterating global reduction 4 with 18 rules applied. Total rules applied 527 place count 72 transition count 743
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 535 place count 72 transition count 735
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 539 place count 70 transition count 733
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 541 place count 68 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 542 place count 67 transition count 731
Applied a total of 542 rules in 252 ms. Remains 67 /327 variables (removed 260) and now considering 731/1166 (removed 435) transitions.
// Phase 1: matrix 731 rows 67 cols
[2024-05-21 19:07:21] [INFO ] Computed 12 invariants in 5 ms
[2024-05-21 19:07:21] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-21 19:07:21] [INFO ] Invariant cache hit.
[2024-05-21 19:07:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:07:22] [INFO ] Implicit Places using invariants and state equation in 544 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 890 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/327 places, 731/1166 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 730
Applied a total of 2 rules in 45 ms. Remains 64 /65 variables (removed 1) and now considering 730/731 (removed 1) transitions.
// Phase 1: matrix 730 rows 64 cols
[2024-05-21 19:07:22] [INFO ] Computed 10 invariants in 8 ms
[2024-05-21 19:07:22] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-21 19:07:22] [INFO ] Invariant cache hit.
[2024-05-21 19:07:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:07:23] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/327 places, 730/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2335 ms. Remains : 64/327 places, 730/1166 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLCardinality-11 finished in 2460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 320 transition count 1159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 320 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 319 transition count 1158
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 319 transition count 1158
Applied a total of 16 rules in 41 ms. Remains 319 /327 variables (removed 8) and now considering 1158/1166 (removed 8) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-21 19:07:23] [INFO ] Computed 14 invariants in 11 ms
[2024-05-21 19:07:24] [INFO ] Implicit Places using invariants in 711 ms returned []
[2024-05-21 19:07:24] [INFO ] Invariant cache hit.
[2024-05-21 19:07:25] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
[2024-05-21 19:07:25] [INFO ] Invariant cache hit.
[2024-05-21 19:07:27] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/327 places, 1158/1166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3498 ms. Remains : 319/327 places, 1158/1166 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s32 0) (EQ s150 1)), p1:(AND (EQ s99 0) (EQ s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLCardinality-13 finished in 3654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(p1))))'
Support contains 3 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 321 transition count 1160
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 321 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 320 transition count 1159
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 320 transition count 1159
Applied a total of 14 rules in 47 ms. Remains 320 /327 variables (removed 7) and now considering 1159/1166 (removed 7) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2024-05-21 19:07:27] [INFO ] Computed 14 invariants in 9 ms
[2024-05-21 19:07:27] [INFO ] Implicit Places using invariants in 707 ms returned []
[2024-05-21 19:07:27] [INFO ] Invariant cache hit.
[2024-05-21 19:07:29] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
[2024-05-21 19:07:29] [INFO ] Invariant cache hit.
[2024-05-21 19:07:30] [INFO ] Dead Transitions using invariants and state equation in 1276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 1159/1166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3612 ms. Remains : 320/327 places, 1159/1166 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(EQ s314 1), p1:(OR (EQ s199 0) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 598 ms.
Product exploration explored 100000 steps with 33333 reset in 436 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-15 finished in 4918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
[2024-05-21 19:07:32] [INFO ] Flatten gal took : 123 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16612244333420397914
[2024-05-21 19:07:32] [INFO ] Computing symmetric may disable matrix : 1166 transitions.
[2024-05-21 19:07:32] [INFO ] Applying decomposition
[2024-05-21 19:07:32] [INFO ] Flatten gal took : 102 ms
[2024-05-21 19:07:32] [INFO ] Computation of Complete disable matrix. took 184 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:07:32] [INFO ] Computing symmetric may enable matrix : 1166 transitions.
[2024-05-21 19:07:32] [INFO ] Computation of Complete enable matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1557301634016956106.txt' '-o' '/tmp/graph1557301634016956106.bin' '-w' '/tmp/graph1557301634016956106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1557301634016956106.bin' '-l' '-1' '-v' '-w' '/tmp/graph1557301634016956106.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:07:33] [INFO ] Decomposing Gal with order
[2024-05-21 19:07:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:07:33] [INFO ] Computing Do-Not-Accords matrix : 1166 transitions.
[2024-05-21 19:07:33] [INFO ] Computation of Completed DNA matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:07:33] [INFO ] Built C files in 738ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16612244333420397914
Running compilation step : cd /tmp/ltsmin16612244333420397914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 19:07:33] [INFO ] Removed a total of 6064 redundant transitions.
[2024-05-21 19:07:33] [INFO ] Flatten gal took : 259 ms
[2024-05-21 19:07:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 27 ms.
[2024-05-21 19:07:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality12970993525790891714.gal : 6 ms
[2024-05-21 19:07:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality16618609807576398786.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12970993525790891714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16618609807576398786.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i15.i0.u100.p332!=1)||((i0.u66.p222!=0)&&(i9.i0.u42.p143!=1)))")||(X(F("((i0.u1.p5!=0)&&(i7.i1.u34.p106!=1))")))))))
Formula 0 simplified : G(F!"((i15.i0.u100.p332!=1)||((i0.u66.p222!=0)&&(i9.i0.u42.p143!=1)))" & FG!"((i0.u1.p5!=0)&&(i7.i1.u34.p106!=1))")
Compilation finished in 8825 ms.
Running link step : cd /tmp/ltsmin16612244333420397914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin16612244333420397914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 19:28:13] [INFO ] Applying decomposition
[2024-05-21 19:28:14] [INFO ] Flatten gal took : 1117 ms
[2024-05-21 19:28:15] [INFO ] Decomposing Gal with order
[2024-05-21 19:28:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:28:18] [INFO ] Removed a total of 6354 redundant transitions.
[2024-05-21 19:28:18] [INFO ] Flatten gal took : 2397 ms
[2024-05-21 19:28:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 100 ms.
[2024-05-21 19:28:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality9885954515487412035.gal : 35 ms
[2024-05-21 19:28:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality15234179178119071056.ltl : 2 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9885954515487412035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15234179178119071056.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i1.i0.u23.p332!=1)||((i1.i0.i0.i0.i0.i0.u19.p222!=0)&&(i1.i0.i0.i0.i0.i0.i0.i0.u17.p143!=1)))")||(X(F("((i0.u2.p5!=0)&&(i1....200
Formula 0 simplified : G(F!"((i1.i0.u23.p332!=1)||((i1.i0.i0.i0.i0.i0.u19.p222!=0)&&(i1.i0.i0.i0.i0.i0.i0.i0.u17.p143!=1)))" & FG!"((i0.u2.p5!=0)&&(i1.i0.i...190
Reverse transition relation is NOT exact ! Due to transitions t466, t556, t610, i0.u2.t310, i0.u2.t311, i0.u2.t312, i0.u3.t308, i1.i0.u23.t33, i1.i0.u23.t3...2037
Computing Next relation with stutter on 7.84947e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-21 19:48:56] [INFO ] Flatten gal took : 916 ms
[2024-05-21 19:48:57] [INFO ] Input system was already deterministic with 1166 transitions.
[2024-05-21 19:48:57] [INFO ] Transformed 327 places.
[2024-05-21 19:48:57] [INFO ] Transformed 1166 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 19:48:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality7921065533571860129.gal : 33 ms
[2024-05-21 19:48:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality10450436112824535686.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7921065533571860129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10450436112824535686.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((p332!=1)||((p222!=0)&&(p143!=1)))")||(X(F("((p5!=0)&&(p106!=1))")))))))
Formula 0 simplified : G(F!"((p332!=1)||((p222!=0)&&(p143!=1)))" & FG!"((p5!=0)&&(p106!=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10868724 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15685604 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-09b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-09b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-171620180400222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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