About the Execution of ITS-Tools for AutonomousCar-PT-08b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1755.607 | 145177.00 | 311578.00 | 55.50 | TFFTTTTTFFTTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813593400651.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutonomousCar-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593400651
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 517K Mar 5 18:22 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-08b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678521712839
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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 08:01:55] [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]
[2023-03-11 08:01:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:01:55] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-11 08:01:55] [INFO ] Transformed 357 places.
[2023-03-11 08:01:55] [INFO ] Transformed 1128 transitions.
[2023-03-11 08:01:55] [INFO ] Found NUPN structural information;
[2023-03-11 08:01:55] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 309 transition count 1080
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 309 transition count 1080
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 352 place count 309 transition count 824
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 361 place count 300 transition count 815
Iterating global reduction 1 with 9 rules applied. Total rules applied 370 place count 300 transition count 815
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 371 place count 299 transition count 814
Iterating global reduction 1 with 1 rules applied. Total rules applied 372 place count 299 transition count 814
Applied a total of 372 rules in 124 ms. Remains 299 /357 variables (removed 58) and now considering 814/1128 (removed 314) transitions.
// Phase 1: matrix 814 rows 299 cols
[2023-03-11 08:01:55] [INFO ] Computed 13 place invariants in 22 ms
[2023-03-11 08:01:56] [INFO ] Implicit Places using invariants in 719 ms returned []
[2023-03-11 08:01:56] [INFO ] Invariant cache hit.
[2023-03-11 08:01:57] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2023-03-11 08:01:57] [INFO ] Invariant cache hit.
[2023-03-11 08:01:58] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 299/357 places, 814/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2950 ms. Remains : 299/357 places, 814/1128 transitions.
Support contains 15 out of 299 places after structural reductions.
[2023-03-11 08:01:59] [INFO ] Flatten gal took : 133 ms
[2023-03-11 08:01:59] [INFO ] Flatten gal took : 80 ms
[2023-03-11 08:01:59] [INFO ] Input system was already deterministic with 814 transitions.
Support contains 14 out of 299 places (down from 15) after GAL structural reductions.
Finished random walk after 510 steps, including 4 resets, run visited all 8 properties in 58 ms. (steps per millisecond=8 )
FORMULA AutonomousCar-PT-08b-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&F(!p1))))))'
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 293 transition count 808
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 293 transition count 808
Applied a total of 12 rules in 26 ms. Remains 293 /299 variables (removed 6) and now considering 808/814 (removed 6) transitions.
// Phase 1: matrix 808 rows 293 cols
[2023-03-11 08:01:59] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-11 08:02:00] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-11 08:02:00] [INFO ] Invariant cache hit.
[2023-03-11 08:02:00] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2023-03-11 08:02:00] [INFO ] Invariant cache hit.
[2023-03-11 08:02:01] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 293/299 places, 808/814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1594 ms. Remains : 293/299 places, 808/814 transitions.
Stuttering acceptance computed with spot in 516 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(NEQ s181 1), p1:(OR (EQ s212 0) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2276 reset in 392 ms.
Product exploration explored 100000 steps with 2277 reset in 260 ms.
Computed a total of 47 stabilizing places and 48 stable transitions
Computed a total of 47 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 362 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 874 steps, including 7 resets, run visited all 2 properties in 15 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 417 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 808/808 transitions.
Applied a total of 0 rules in 5 ms. Remains 293 /293 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2023-03-11 08:02:03] [INFO ] Invariant cache hit.
[2023-03-11 08:02:04] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-11 08:02:04] [INFO ] Invariant cache hit.
[2023-03-11 08:02:05] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2023-03-11 08:02:05] [INFO ] Invariant cache hit.
[2023-03-11 08:02:05] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1707 ms. Remains : 293/293 places, 808/808 transitions.
Computed a total of 47 stabilizing places and 48 stable transitions
Computed a total of 47 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 660 steps, including 5 resets, run visited all 2 properties in 14 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 472 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 2271 reset in 313 ms.
Product exploration explored 100000 steps with 2278 reset in 157 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 808/808 transitions.
Graph (trivial) has 273 edges and 293 vertex of which 4 / 293 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 291 transition count 806
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 123 place count 291 transition count 788
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 123 place count 291 transition count 788
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 145 place count 291 transition count 788
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 235 place count 201 transition count 698
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 325 place count 201 transition count 698
Performed 80 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 117 places in 0 ms
Iterating global reduction 2 with 80 rules applied. Total rules applied 405 place count 201 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 407 place count 201 transition count 706
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 474 place count 134 transition count 527
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 3 with 67 rules applied. Total rules applied 541 place count 134 transition count 527
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 556 place count 134 transition count 512
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 564 place count 126 transition count 504
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 572 place count 126 transition count 504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 573 place count 126 transition count 504
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 575 place count 124 transition count 502
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 577 place count 124 transition count 502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 578 place count 124 transition count 504
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 578 rules in 225 ms. Remains 124 /293 variables (removed 169) and now considering 504/808 (removed 304) transitions.
[2023-03-11 08:02:08] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 504 rows 124 cols
[2023-03-11 08:02:08] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-11 08:02:08] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/293 places, 504/808 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 124/293 places, 504/808 transitions.
Built C files in :
/tmp/ltsmin5977081338563377796
[2023-03-11 08:02:08] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5977081338563377796
Running compilation step : cd /tmp/ltsmin5977081338563377796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2200 ms.
Running link step : cd /tmp/ltsmin5977081338563377796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 142 ms.
Running LTSmin : cd /tmp/ltsmin5977081338563377796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7719969977841431745.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 808/808 transitions.
Applied a total of 0 rules in 22 ms. Remains 293 /293 variables (removed 0) and now considering 808/808 (removed 0) transitions.
// Phase 1: matrix 808 rows 293 cols
[2023-03-11 08:02:23] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-11 08:02:24] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-11 08:02:24] [INFO ] Invariant cache hit.
[2023-03-11 08:02:25] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2023-03-11 08:02:25] [INFO ] Invariant cache hit.
[2023-03-11 08:02:25] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2019 ms. Remains : 293/293 places, 808/808 transitions.
Built C files in :
/tmp/ltsmin14724418240639012329
[2023-03-11 08:02:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14724418240639012329
Running compilation step : cd /tmp/ltsmin14724418240639012329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1863 ms.
Running link step : cd /tmp/ltsmin14724418240639012329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14724418240639012329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18074686859439906087.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 08:02:40] [INFO ] Flatten gal took : 58 ms
[2023-03-11 08:02:41] [INFO ] Flatten gal took : 54 ms
[2023-03-11 08:02:41] [INFO ] Time to serialize gal into /tmp/LTL16042445167503190445.gal : 19 ms
[2023-03-11 08:02:41] [INFO ] Time to serialize properties into /tmp/LTL8289178011979991841.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16042445167503190445.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17377955586915465382.hoa' '-atoms' '/tmp/LTL8289178011979991841.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8289178011979991841.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17377955586915465382.hoa
Detected timeout of ITS tools.
[2023-03-11 08:02:56] [INFO ] Flatten gal took : 104 ms
[2023-03-11 08:02:56] [INFO ] Flatten gal took : 82 ms
[2023-03-11 08:02:56] [INFO ] Time to serialize gal into /tmp/LTL345055815660296487.gal : 12 ms
[2023-03-11 08:02:56] [INFO ] Time to serialize properties into /tmp/LTL10646510827363532143.ltl : 5 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL345055815660296487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10646510827363532143.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(p217!=1)"))||(("(p217!=1)")&&(F("((p255!=0)&&(p86!=1))")))))))
Formula 0 simplified : XG(F!"(p217!=1)" & (!"(p217!=1)" | G!"((p255!=0)&&(p86!=1))"))
Detected timeout of ITS tools.
[2023-03-11 08:03:11] [INFO ] Flatten gal took : 85 ms
[2023-03-11 08:03:11] [INFO ] Applying decomposition
[2023-03-11 08:03:11] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6233668903778001480.txt' '-o' '/tmp/graph6233668903778001480.bin' '-w' '/tmp/graph6233668903778001480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6233668903778001480.bin' '-l' '-1' '-v' '-w' '/tmp/graph6233668903778001480.weights' '-q' '0' '-e' '0.001'
[2023-03-11 08:03:12] [INFO ] Decomposing Gal with order
[2023-03-11 08:03:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 08:03:12] [INFO ] Removed a total of 3038 redundant transitions.
[2023-03-11 08:03:12] [INFO ] Flatten gal took : 206 ms
[2023-03-11 08:03:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 30 ms.
[2023-03-11 08:03:12] [INFO ] Time to serialize gal into /tmp/LTL15622355854659862780.gal : 6 ms
[2023-03-11 08:03:12] [INFO ] Time to serialize properties into /tmp/LTL6936712919936784132.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15622355854659862780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6936712919936784132.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(i2.u65.p217!=1)"))||(("(i2.u65.p217!=1)")&&(F("((i9.i2.u78.p255!=0)&&(i1.i2.u26.p86!=1))")))))))
Formula 0 simplified : XG(F!"(i2.u65.p217!=1)" & (!"(i2.u65.p217!=1)" | G!"((i9.i2.u78.p255!=0)&&(i1.i2.u26.p86!=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1921627376078429337
[2023-03-11 08:03:27] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1921627376078429337
Running compilation step : cd /tmp/ltsmin1921627376078429337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1936 ms.
Running link step : cd /tmp/ltsmin1921627376078429337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin1921627376078429337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-08b-LTLCardinality-00 finished in 103002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Graph (trivial) has 282 edges and 299 vertex of which 4 / 299 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 296 transition count 699
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 155 rules applied. Total rules applied 268 place count 184 transition count 656
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 293 place count 159 transition count 656
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 293 place count 159 transition count 648
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 309 place count 151 transition count 648
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 313 place count 147 transition count 644
Iterating global reduction 3 with 4 rules applied. Total rules applied 317 place count 147 transition count 644
Performed 64 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 445 place count 83 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 446 place count 83 transition count 578
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 462 place count 67 transition count 449
Iterating global reduction 4 with 16 rules applied. Total rules applied 478 place count 67 transition count 449
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 484 place count 67 transition count 443
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 488 place count 65 transition count 441
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 489 place count 65 transition count 440
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 490 place count 65 transition count 440
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 492 place count 63 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 493 place count 62 transition count 438
Applied a total of 493 rules in 170 ms. Remains 62 /299 variables (removed 237) and now considering 438/814 (removed 376) transitions.
// Phase 1: matrix 438 rows 62 cols
[2023-03-11 08:03:42] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 08:03:43] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-11 08:03:43] [INFO ] Invariant cache hit.
[2023-03-11 08:03:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:03:43] [INFO ] Implicit Places using invariants and state equation in 614 ms returned [57, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1046 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/299 places, 438/814 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 59 transition count 437
Applied a total of 2 rules in 22 ms. Remains 59 /60 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 59 cols
[2023-03-11 08:03:43] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 08:03:44] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-11 08:03:44] [INFO ] Invariant cache hit.
[2023-03-11 08:03:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:03:45] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/299 places, 437/814 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2610 ms. Remains : 59/299 places, 437/814 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 129 reset in 107 ms.
Product exploration explored 100000 steps with 135 reset in 95 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 41 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 437/437 transitions.
Applied a total of 0 rules in 36 ms. Remains 59 /59 variables (removed 0) and now considering 437/437 (removed 0) transitions.
[2023-03-11 08:03:46] [INFO ] Invariant cache hit.
[2023-03-11 08:03:46] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-11 08:03:46] [INFO ] Invariant cache hit.
[2023-03-11 08:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:03:46] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-11 08:03:46] [INFO ] Redundant transitions in 84 ms returned [297]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 436 rows 59 cols
[2023-03-11 08:03:46] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 08:03:47] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/59 places, 436/437 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 434
Applied a total of 2 rules in 25 ms. Remains 57 /59 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 57 cols
[2023-03-11 08:03:47] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-11 08:03:47] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-11 08:03:47] [INFO ] Invariant cache hit.
[2023-03-11 08:03:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:03:48] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/59 places, 434/437 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1978 ms. Remains : 57/59 places, 434/437 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0)]
Product exploration explored 100000 steps with 463 reset in 141 ms.
Product exploration explored 100000 steps with 673 reset in 79 ms.
Built C files in :
/tmp/ltsmin3446926536842653381
[2023-03-11 08:03:49] [INFO ] Computing symmetric may disable matrix : 434 transitions.
[2023-03-11 08:03:49] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:03:49] [INFO ] Computing symmetric may enable matrix : 434 transitions.
[2023-03-11 08:03:49] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:03:49] [INFO ] Computing Do-Not-Accords matrix : 434 transitions.
[2023-03-11 08:03:49] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:03:49] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3446926536842653381
Running compilation step : cd /tmp/ltsmin3446926536842653381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1622 ms.
Running link step : cd /tmp/ltsmin3446926536842653381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin3446926536842653381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3689009531199566150.hoa' '--buchi-type=spotba'
LTSmin run took 1137 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-08b-LTLCardinality-02 finished in 9456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 292 transition count 807
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 291 transition count 806
Applied a total of 16 rules in 13 ms. Remains 291 /299 variables (removed 8) and now considering 806/814 (removed 8) transitions.
// Phase 1: matrix 806 rows 291 cols
[2023-03-11 08:03:52] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-11 08:03:52] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-11 08:03:52] [INFO ] Invariant cache hit.
[2023-03-11 08:03:52] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2023-03-11 08:03:52] [INFO ] Invariant cache hit.
[2023-03-11 08:03:54] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/299 places, 806/814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1967 ms. Remains : 291/299 places, 806/814 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s24 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 3745 reset in 286 ms.
Product exploration explored 100000 steps with 3739 reset in 237 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Detected a total of 45/291 stabilizing places and 46/806 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 327 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-11 08:03:55] [INFO ] Invariant cache hit.
[2023-03-11 08:03:55] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-11 08:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:03:56] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-11 08:03:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:03:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-11 08:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:03:56] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2023-03-11 08:03:57] [INFO ] Deduced a trap composed of 67 places in 356 ms of which 16 ms to minimize.
[2023-03-11 08:03:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 433 ms
[2023-03-11 08:03:57] [INFO ] Computed and/alt/rep : 248/467/248 causal constraints (skipped 557 transitions) in 156 ms.
[2023-03-11 08:03:58] [INFO ] Added : 76 causal constraints over 16 iterations in 1270 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 806/806 transitions.
Graph (trivial) has 275 edges and 291 vertex of which 4 / 291 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 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 288 transition count 701
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 149 rules applied. Total rules applied 252 place count 186 transition count 654
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 281 place count 158 transition count 653
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 282 place count 157 transition count 653
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 282 place count 157 transition count 645
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 298 place count 149 transition count 645
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 299 place count 148 transition count 644
Iterating global reduction 4 with 1 rules applied. Total rules applied 300 place count 148 transition count 644
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 432 place count 82 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 433 place count 82 transition count 576
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 450 place count 65 transition count 439
Iterating global reduction 5 with 17 rules applied. Total rules applied 467 place count 65 transition count 439
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 475 place count 65 transition count 431
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 6 with 4 rules applied. Total rules applied 479 place count 63 transition count 429
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 481 place count 61 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 482 place count 60 transition count 427
Applied a total of 482 rules in 101 ms. Remains 60 /291 variables (removed 231) and now considering 427/806 (removed 379) transitions.
// Phase 1: matrix 427 rows 60 cols
[2023-03-11 08:03:58] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-11 08:03:59] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-11 08:03:59] [INFO ] Invariant cache hit.
[2023-03-11 08:03:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:03:59] [INFO ] Implicit Places using invariants and state equation in 603 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 944 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/291 places, 427/806 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 57 transition count 426
Applied a total of 2 rules in 29 ms. Remains 57 /58 variables (removed 1) and now considering 426/427 (removed 1) transitions.
// Phase 1: matrix 426 rows 57 cols
[2023-03-11 08:03:59] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 08:04:00] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-11 08:04:00] [INFO ] Invariant cache hit.
[2023-03-11 08:04:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:04:00] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/291 places, 426/806 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1861 ms. Remains : 57/291 places, 426/806 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/57 stabilizing places and 4/426 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 339 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 339 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-11 08:04:01] [INFO ] Invariant cache hit.
[2023-03-11 08:04:01] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 08:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:01] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-11 08:04:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:04:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-11 08:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:04:02] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-11 08:04:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:04:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2023-03-11 08:04:02] [INFO ] Deduced a trap composed of 18 places in 296 ms of which 1 ms to minimize.
[2023-03-11 08:04:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2023-03-11 08:04:02] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 418 transitions) in 157 ms.
[2023-03-11 08:04:02] [INFO ] Added : 0 causal constraints over 0 iterations in 219 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39974 reset in 130 ms.
Product exploration explored 100000 steps with 40074 reset in 162 ms.
Built C files in :
/tmp/ltsmin16192983260505125268
[2023-03-11 08:04:03] [INFO ] Computing symmetric may disable matrix : 426 transitions.
[2023-03-11 08:04:03] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:04:03] [INFO ] Computing symmetric may enable matrix : 426 transitions.
[2023-03-11 08:04:03] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:04:03] [INFO ] Computing Do-Not-Accords matrix : 426 transitions.
[2023-03-11 08:04:03] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 08:04:03] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16192983260505125268
Running compilation step : cd /tmp/ltsmin16192983260505125268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1633 ms.
Running link step : cd /tmp/ltsmin16192983260505125268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin16192983260505125268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18190248218908233982.hoa' '--buchi-type=spotba'
LTSmin run took 950 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-08b-LTLCardinality-07 finished in 13910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p1)&&G(p2))))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 294 transition count 809
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 294 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 293 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 293 transition count 808
Applied a total of 12 rules in 15 ms. Remains 293 /299 variables (removed 6) and now considering 808/814 (removed 6) transitions.
// Phase 1: matrix 808 rows 293 cols
[2023-03-11 08:04:06] [INFO ] Computed 13 place invariants in 17 ms
[2023-03-11 08:04:06] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-11 08:04:06] [INFO ] Invariant cache hit.
[2023-03-11 08:04:07] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
[2023-03-11 08:04:07] [INFO ] Invariant cache hit.
[2023-03-11 08:04:07] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 293/299 places, 808/814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1861 ms. Remains : 293/299 places, 808/814 transitions.
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s24 0) (EQ s227 1)), p0:(AND (EQ s141 0) (EQ s138 1)), p1:(OR (EQ s138 0) (EQ s141 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLCardinality-14 finished in 2254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&F(!p1))))))'
Found a Shortening insensitive property : AutonomousCar-PT-08b-LTLCardinality-00
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Graph (trivial) has 279 edges and 299 vertex of which 4 / 299 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 296 transition count 701
Reduce places removed 110 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 154 rules applied. Total rules applied 265 place count 186 transition count 657
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 291 place count 160 transition count 657
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 291 place count 160 transition count 648
Deduced a syphon composed of 9 places in 11 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 309 place count 151 transition count 648
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 313 place count 147 transition count 644
Iterating global reduction 3 with 4 rules applied. Total rules applied 317 place count 147 transition count 644
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 318 place count 146 transition count 636
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 146 transition count 636
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 3 with 2 rules applied. Total rules applied 321 place count 146 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 145 transition count 634
Performed 61 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 444 place count 84 transition count 572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 445 place count 84 transition count 571
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 460 place count 69 transition count 451
Iterating global reduction 6 with 15 rules applied. Total rules applied 475 place count 69 transition count 451
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 482 place count 69 transition count 444
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 7 with 4 rules applied. Total rules applied 486 place count 67 transition count 442
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 487 place count 67 transition count 442
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 489 place count 65 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 490 place count 64 transition count 440
Applied a total of 490 rules in 160 ms. Remains 64 /299 variables (removed 235) and now considering 440/814 (removed 374) transitions.
// Phase 1: matrix 440 rows 64 cols
[2023-03-11 08:04:08] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-11 08:04:08] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-11 08:04:08] [INFO ] Invariant cache hit.
[2023-03-11 08:04:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 08:04:09] [INFO ] Implicit Places using invariants and state equation in 490 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 756 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/299 places, 440/814 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 61 transition count 439
Applied a total of 2 rules in 22 ms. Remains 61 /62 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 61 cols
[2023-03-11 08:04:09] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 08:04:10] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-11 08:04:10] [INFO ] Invariant cache hit.
[2023-03-11 08:04:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:04:10] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 61/299 places, 439/814 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2077 ms. Remains : 61/299 places, 439/814 transitions.
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(NEQ s39 1), p1:(OR (EQ s49 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 40023 reset in 145 ms.
Product exploration explored 100000 steps with 40005 reset in 186 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 387 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 577 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 439/439 transitions.
Applied a total of 0 rules in 17 ms. Remains 61 /61 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2023-03-11 08:04:12] [INFO ] Invariant cache hit.
[2023-03-11 08:04:12] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-11 08:04:12] [INFO ] Invariant cache hit.
[2023-03-11 08:04:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 08:04:13] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2023-03-11 08:04:13] [INFO ] Invariant cache hit.
[2023-03-11 08:04:13] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1199 ms. Remains : 61/61 places, 439/439 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 312 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 82 steps, including 4 resets, run visited all 2 properties in 3 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 516 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 39948 reset in 188 ms.
Product exploration explored 100000 steps with 39970 reset in 186 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 439/439 transitions.
Applied a total of 0 rules in 30 ms. Remains 61 /61 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2023-03-11 08:04:15] [INFO ] Redundant transitions in 63 ms returned [299]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 438 rows 61 cols
[2023-03-11 08:04:15] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 08:04:16] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/61 places, 438/439 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 440
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 19 ms. Remains 61 /61 variables (removed 0) and now considering 440/438 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/61 places, 440/439 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 474 ms. Remains : 61/61 places, 440/439 transitions.
Built C files in :
/tmp/ltsmin3487172917612020293
[2023-03-11 08:04:16] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3487172917612020293
Running compilation step : cd /tmp/ltsmin3487172917612020293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1211 ms.
Running link step : cd /tmp/ltsmin3487172917612020293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin3487172917612020293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6101760927792146408.hoa' '--buchi-type=spotba'
LTSmin run took 149 ms.
Treatment of property AutonomousCar-PT-08b-LTLCardinality-00 finished in 9295 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-00 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-11 08:04:17] [INFO ] Flatten gal took : 102 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 142463 ms.
BK_STOP 1678521858016
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-08b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-08b, 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 r005-oct2-167813593400651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b 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 '
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 ;