Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127900452.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-864, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127900452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 427K May 5 16:51 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 Parking-PT-864-00
FORMULA_NAME Parking-PT-864-01
FORMULA_NAME Parking-PT-864-02
FORMULA_NAME Parking-PT-864-03
FORMULA_NAME Parking-PT-864-04
FORMULA_NAME Parking-PT-864-05
FORMULA_NAME Parking-PT-864-06
FORMULA_NAME Parking-PT-864-07
FORMULA_NAME Parking-PT-864-08
FORMULA_NAME Parking-PT-864-09
FORMULA_NAME Parking-PT-864-10
FORMULA_NAME Parking-PT-864-11
FORMULA_NAME Parking-PT-864-12
FORMULA_NAME Parking-PT-864-13
FORMULA_NAME Parking-PT-864-14
FORMULA_NAME Parking-PT-864-15

=== Now, execution of the tool begins

BK_START 1620984164300

Running Version 0
[2021-05-14 09:22:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 09:22:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 09:22:46] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2021-05-14 09:22:46] [INFO ] Transformed 1185 places.
[2021-05-14 09:22:46] [INFO ] Transformed 1697 transitions.
[2021-05-14 09:22:46] [INFO ] Found NUPN structural information;
[2021-05-14 09:22:46] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 09:22:46] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 1185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1178 transition count 1002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1178 transition count 1002
Applied a total of 14 rules in 180 ms. Remains 1178 /1185 variables (removed 7) and now considering 1002/1009 (removed 7) transitions.
// Phase 1: matrix 1002 rows 1178 cols
[2021-05-14 09:22:46] [INFO ] Computed 280 place invariants in 59 ms
[2021-05-14 09:22:47] [INFO ] Implicit Places using invariants in 724 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 293, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 466, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 685, 693, 701, 709, 717, 725, 733, 741, 773, 775, 818, 826, 834, 842, 850, 866, 874, 906, 908, 951, 959, 967, 975, 983, 991, 999, 1007, 1039, 1041, 1084, 1092, 1100, 1108, 1116, 1132, 1140, 1172, 1174]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 762 ms to find 78 implicit places.
// Phase 1: matrix 1002 rows 1100 cols
[2021-05-14 09:22:47] [INFO ] Computed 202 place invariants in 17 ms
[2021-05-14 09:22:48] [INFO ] Dead Transitions using invariants and state equation in 512 ms returned []
Starting structural reductions, iteration 1 : 1100/1185 places, 1002/1009 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 1040 transition count 942
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 1040 transition count 942
Applied a total of 120 rules in 157 ms. Remains 1040 /1100 variables (removed 60) and now considering 942/1002 (removed 60) transitions.
// Phase 1: matrix 942 rows 1040 cols
[2021-05-14 09:22:48] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-14 09:22:48] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 942 rows 1040 cols
[2021-05-14 09:22:48] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-14 09:22:49] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:22:50] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 2703 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1040/1185 places, 942/1009 transitions.
[2021-05-14 09:22:51] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 09:22:51] [INFO ] Flatten gal took : 127 ms
FORMULA Parking-PT-864-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:22:51] [INFO ] Flatten gal took : 70 ms
[2021-05-14 09:22:51] [INFO ] Input system was already deterministic with 942 transitions.
Incomplete random walk after 100000 steps, including 386 resets, run finished after 1070 ms. (steps per millisecond=93 ) properties (out of 13) seen :10
Running SMT prover for 3 properties.
// Phase 1: matrix 942 rows 1040 cols
[2021-05-14 09:22:52] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-14 09:22:52] [INFO ] [Real]Absence check using 202 positive place invariants in 37 ms returned sat
[2021-05-14 09:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:22:52] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2021-05-14 09:22:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:22:53] [INFO ] [Nat]Absence check using 202 positive place invariants in 34 ms returned sat
[2021-05-14 09:22:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:22:53] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-14 09:22:53] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:22:53] [INFO ] [Nat]Added 248 Read/Feed constraints in 22 ms returned sat
[2021-05-14 09:22:53] [INFO ] Computed and/alt/rep : 941/2661/941 causal constraints (skipped 0 transitions) in 62 ms.
[2021-05-14 09:23:03] [INFO ] Added : 797 causal constraints over 160 iterations in 10463 ms. Result :sat
[2021-05-14 09:23:04] [INFO ] [Real]Absence check using 202 positive place invariants in 40 ms returned sat
[2021-05-14 09:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:23:04] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2021-05-14 09:23:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:23:04] [INFO ] [Nat]Absence check using 202 positive place invariants in 35 ms returned sat
[2021-05-14 09:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:23:04] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2021-05-14 09:23:04] [INFO ] [Nat]Added 248 Read/Feed constraints in 24 ms returned sat
[2021-05-14 09:23:04] [INFO ] Computed and/alt/rep : 941/2661/941 causal constraints (skipped 0 transitions) in 67 ms.
[2021-05-14 09:23:15] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 7 ms to minimize.
[2021-05-14 09:23:15] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2021-05-14 09:23:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2021-05-14 09:23:15] [INFO ] Added : 815 causal constraints over 163 iterations in 10638 ms. Result :sat
[2021-05-14 09:23:15] [INFO ] [Real]Absence check using 202 positive place invariants in 58 ms returned sat
[2021-05-14 09:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:23:16] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2021-05-14 09:23:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:23:16] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2021-05-14 09:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:23:16] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2021-05-14 09:23:16] [INFO ] [Nat]Added 248 Read/Feed constraints in 24 ms returned sat
[2021-05-14 09:23:16] [INFO ] Computed and/alt/rep : 941/2661/941 causal constraints (skipped 0 transitions) in 89 ms.
[2021-05-14 09:23:25] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 9 ms to minimize.
[2021-05-14 09:23:26] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 1 ms to minimize.
[2021-05-14 09:23:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2021-05-14 09:23:26] [INFO ] Added : 768 causal constraints over 154 iterations in 9564 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1037 transition count 939
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1037 transition count 939
Applied a total of 6 rules in 122 ms. Remains 1037 /1040 variables (removed 3) and now considering 939/942 (removed 3) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2021-05-14 09:23:26] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-14 09:23:27] [INFO ] Implicit Places using invariants in 746 ms returned [758, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 757 ms to find 2 implicit places.
// Phase 1: matrix 939 rows 1035 cols
[2021-05-14 09:23:27] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:23:27] [INFO ] Dead Transitions using invariants and state equation in 495 ms returned []
Starting structural reductions, iteration 1 : 1035/1040 places, 939/942 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 41 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:23:27] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:23:28] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:23:28] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:23:28] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:23:30] [INFO ] Implicit Places using invariants and state equation in 2315 ms returned []
Implicit Place search using SMT with State Equation took 2797 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1033/1040 places, 937/942 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s986 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3049 ms.
Product exploration explored 100000 steps with 50000 reset in 2976 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 2900 ms.
Product exploration explored 100000 steps with 50000 reset in 2955 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1033 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1033/1033 places, 937/937 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 937
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 32 place count 1033 transition count 937
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 1033 transition count 937
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 96 place count 1001 transition count 905
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 128 place count 1001 transition count 905
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 176 place count 1001 transition count 937
Deduced a syphon composed of 80 places in 1 ms
Applied a total of 176 rules in 300 ms. Remains 1001 /1033 variables (removed 32) and now considering 937/937 (removed 0) transitions.
[2021-05-14 09:23:43] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 937 rows 1001 cols
[2021-05-14 09:23:43] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:23:43] [INFO ] Dead Transitions using invariants and state equation in 434 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1001/1033 places, 937/937 transitions.
Product exploration explored 100000 steps with 50000 reset in 6771 ms.
Product exploration explored 100000 steps with 50000 reset in 6733 ms.
[2021-05-14 09:23:57] [INFO ] Flatten gal took : 55 ms
[2021-05-14 09:23:57] [INFO ] Flatten gal took : 47 ms
[2021-05-14 09:23:57] [INFO ] Time to serialize gal into /tmp/LTL1168100883794419124.gal : 13 ms
[2021-05-14 09:23:57] [INFO ] Time to serialize properties into /tmp/LTL16942639899089480135.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1168100883794419124.gal, -t, CGAL, -LTL, /tmp/LTL16942639899089480135.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1168100883794419124.gal -t CGAL -LTL /tmp/LTL16942639899089480135.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p1129==0)"))))
Formula 0 simplified : !XF"(p1129==0)"
Detected timeout of ITS tools.
[2021-05-14 09:24:12] [INFO ] Flatten gal took : 43 ms
[2021-05-14 09:24:12] [INFO ] Applying decomposition
[2021-05-14 09:24:12] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1853781321759202863.txt, -o, /tmp/graph1853781321759202863.bin, -w, /tmp/graph1853781321759202863.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1853781321759202863.bin, -l, -1, -v, -w, /tmp/graph1853781321759202863.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:24:12] [INFO ] Decomposing Gal with order
[2021-05-14 09:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:24:12] [INFO ] Removed a total of 116 redundant transitions.
[2021-05-14 09:24:12] [INFO ] Flatten gal took : 110 ms
[2021-05-14 09:24:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2021-05-14 09:24:12] [INFO ] Time to serialize gal into /tmp/LTL9291275580649575377.gal : 17 ms
[2021-05-14 09:24:12] [INFO ] Time to serialize properties into /tmp/LTL3614013921402006586.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9291275580649575377.gal, -t, CGAL, -LTL, /tmp/LTL3614013921402006586.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9291275580649575377.gal -t CGAL -LTL /tmp/LTL3614013921402006586.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i14.u368.p1129==0)"))))
Formula 0 simplified : !XF"(i14.u368.p1129==0)"
Reverse transition relation is NOT exact ! Due to transitions i2.u95.t241, i5.u135.t207, i7.u173.t173, i8.u213.t139, i9.u252.t104, i11.u290.t70, i13.u330.t36, i14.u369.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/929/8/937
Computing Next relation with stutter on 5.35201e+12 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
920 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.31923,279100,1,0,605790,10014,11430,1.17363e+06,907,39631,716856
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-864-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-864-01 finished in 57788 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1037 transition count 939
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1037 transition count 939
Applied a total of 6 rules in 49 ms. Remains 1037 /1040 variables (removed 3) and now considering 939/942 (removed 3) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2021-05-14 09:24:24] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-14 09:24:24] [INFO ] Implicit Places using invariants in 420 ms returned [758, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 421 ms to find 2 implicit places.
// Phase 1: matrix 939 rows 1035 cols
[2021-05-14 09:24:24] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:25] [INFO ] Dead Transitions using invariants and state equation in 419 ms returned []
Starting structural reductions, iteration 1 : 1035/1040 places, 939/942 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 41 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:25] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:25] [INFO ] Implicit Places using invariants in 427 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:25] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:25] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:24:27] [INFO ] Implicit Places using invariants and state equation in 2320 ms returned []
Implicit Place search using SMT with State Equation took 2750 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1033/1040 places, 937/942 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(NEQ s67 1), p0:(NEQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-02 finished in 3820 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1040 transition count 911
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1009 transition count 911
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 62 place count 1009 transition count 879
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 126 place count 977 transition count 879
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 974 transition count 876
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 974 transition count 876
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 232 place count 924 transition count 826
Applied a total of 232 rules in 133 ms. Remains 924 /1040 variables (removed 116) and now considering 826/942 (removed 116) transitions.
// Phase 1: matrix 826 rows 924 cols
[2021-05-14 09:24:28] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-14 09:24:28] [INFO ] Implicit Places using invariants in 423 ms returned [679, 882]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 424 ms to find 2 implicit places.
[2021-05-14 09:24:28] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 826 rows 922 cols
[2021-05-14 09:24:28] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:24:28] [INFO ] Dead Transitions using invariants and state equation in 391 ms returned []
Starting structural reductions, iteration 1 : 922/1040 places, 826/942 transitions.
Applied a total of 0 rules in 40 ms. Remains 922 /922 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2021-05-14 09:24:28] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 826 rows 922 cols
[2021-05-14 09:24:28] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:24:29] [INFO ] Dead Transitions using invariants and state equation in 391 ms returned []
Finished structural reductions, in 2 iterations. Remains : 922/1040 places, 826/942 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s46 0) (EQ s477 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 896 reset in 1110 ms.
Product exploration explored 100000 steps with 908 reset in 1263 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 896 reset in 1113 ms.
Product exploration explored 100000 steps with 922 reset in 1224 ms.
[2021-05-14 09:24:34] [INFO ] Flatten gal took : 35 ms
[2021-05-14 09:24:34] [INFO ] Flatten gal took : 35 ms
[2021-05-14 09:24:34] [INFO ] Time to serialize gal into /tmp/LTL1268780595324860447.gal : 4 ms
[2021-05-14 09:24:34] [INFO ] Time to serialize properties into /tmp/LTL15514504133324097350.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1268780595324860447.gal, -t, CGAL, -LTL, /tmp/LTL15514504133324097350.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1268780595324860447.gal -t CGAL -LTL /tmp/LTL15514504133324097350.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p46==0)||(p597==1))"))))
Formula 0 simplified : !GF"((p46==0)||(p597==1))"
Detected timeout of ITS tools.
[2021-05-14 09:24:49] [INFO ] Flatten gal took : 30 ms
[2021-05-14 09:24:49] [INFO ] Applying decomposition
[2021-05-14 09:24:49] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11405364021995607741.txt, -o, /tmp/graph11405364021995607741.bin, -w, /tmp/graph11405364021995607741.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11405364021995607741.bin, -l, -1, -v, -w, /tmp/graph11405364021995607741.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:24:49] [INFO ] Decomposing Gal with order
[2021-05-14 09:24:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:24:49] [INFO ] Removed a total of 248 redundant transitions.
[2021-05-14 09:24:49] [INFO ] Flatten gal took : 94 ms
[2021-05-14 09:24:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 46 ms.
[2021-05-14 09:24:49] [INFO ] Time to serialize gal into /tmp/LTL13007027550932463030.gal : 10 ms
[2021-05-14 09:24:49] [INFO ] Time to serialize properties into /tmp/LTL15994246751011078827.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13007027550932463030.gal, -t, CGAL, -LTL, /tmp/LTL15994246751011078827.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13007027550932463030.gal -t CGAL -LTL /tmp/LTL15994246751011078827.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i0.i2.u22.p46==0)||(i7.u194.p597==1))"))))
Formula 0 simplified : !GF"((i1.i0.i2.u22.p46==0)||(i7.u194.p597==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13374281440892587905
[2021-05-14 09:25:04] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13374281440892587905
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13374281440892587905]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13374281440892587905] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13374281440892587905] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property Parking-PT-864-03 finished in 37899 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1037 transition count 939
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1037 transition count 939
Applied a total of 6 rules in 56 ms. Remains 1037 /1040 variables (removed 3) and now considering 939/942 (removed 3) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2021-05-14 09:25:05] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-14 09:25:06] [INFO ] Implicit Places using invariants in 401 ms returned [758, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 411 ms to find 2 implicit places.
// Phase 1: matrix 939 rows 1035 cols
[2021-05-14 09:25:06] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:25:06] [INFO ] Dead Transitions using invariants and state equation in 536 ms returned []
Starting structural reductions, iteration 1 : 1035/1040 places, 939/942 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 77 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:25:06] [INFO ] Computed 200 place invariants in 4 ms
[2021-05-14 09:25:07] [INFO ] Implicit Places using invariants in 449 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:25:07] [INFO ] Computed 200 place invariants in 6 ms
[2021-05-14 09:25:07] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:25:09] [INFO ] Implicit Places using invariants and state equation in 2292 ms returned []
Implicit Place search using SMT with State Equation took 2754 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1033/1040 places, 937/942 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Parking-PT-864-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s7 0) (EQ s859 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2917 ms.
Product exploration explored 100000 steps with 50000 reset in 2976 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 2920 ms.
Product exploration explored 100000 steps with 50000 reset in 2972 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), true]
Support contains 2 out of 1033 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1033/1033 places, 937/937 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 937
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 32 place count 1033 transition count 937
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 1033 transition count 937
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 96 place count 1001 transition count 905
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 128 place count 1001 transition count 905
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 176 place count 1001 transition count 937
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 176 rules in 217 ms. Remains 1001 /1033 variables (removed 32) and now considering 937/937 (removed 0) transitions.
[2021-05-14 09:25:22] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 937 rows 1001 cols
[2021-05-14 09:25:22] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:25:22] [INFO ] Dead Transitions using invariants and state equation in 420 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1001/1033 places, 937/937 transitions.
Product exploration explored 100000 steps with 50000 reset in 7103 ms.
Product exploration explored 100000 steps with 50000 reset in 7110 ms.
[2021-05-14 09:25:36] [INFO ] Flatten gal took : 32 ms
[2021-05-14 09:25:36] [INFO ] Flatten gal took : 32 ms
[2021-05-14 09:25:36] [INFO ] Time to serialize gal into /tmp/LTL6905697455850944717.gal : 6 ms
[2021-05-14 09:25:36] [INFO ] Time to serialize properties into /tmp/LTL11267637681576292187.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6905697455850944717.gal, -t, CGAL, -LTL, /tmp/LTL11267637681576292187.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6905697455850944717.gal -t CGAL -LTL /tmp/LTL11267637681576292187.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("((p7==0)||(p979==1))")))
Formula 0 simplified : !X"((p7==0)||(p979==1))"
Detected timeout of ITS tools.
[2021-05-14 09:25:52] [INFO ] Flatten gal took : 35 ms
[2021-05-14 09:25:52] [INFO ] Applying decomposition
[2021-05-14 09:25:52] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12085274490642525900.txt, -o, /tmp/graph12085274490642525900.bin, -w, /tmp/graph12085274490642525900.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12085274490642525900.bin, -l, -1, -v, -w, /tmp/graph12085274490642525900.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:25:52] [INFO ] Decomposing Gal with order
[2021-05-14 09:25:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:25:52] [INFO ] Removed a total of 115 redundant transitions.
[2021-05-14 09:25:52] [INFO ] Flatten gal took : 89 ms
[2021-05-14 09:25:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-14 09:25:52] [INFO ] Time to serialize gal into /tmp/LTL14092516917747734207.gal : 12 ms
[2021-05-14 09:25:52] [INFO ] Time to serialize properties into /tmp/LTL7234743215585497268.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14092516917747734207.gal, -t, CGAL, -LTL, /tmp/LTL7234743215585497268.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14092516917747734207.gal -t CGAL -LTL /tmp/LTL7234743215585497268.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X("((i0.i0.i3.u3.p7==0)||(i9.u331.p979==1))")))
Formula 0 simplified : !X"((i0.i0.i3.u3.p7==0)||(i9.u331.p979==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12722658485386144386
[2021-05-14 09:26:07] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12722658485386144386
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12722658485386144386]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12722658485386144386] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12722658485386144386] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property Parking-PT-864-05 finished in 62664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 910
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 910
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 878
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 878
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 973 transition count 875
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 973 transition count 875
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 232 place count 924 transition count 826
Applied a total of 232 rules in 123 ms. Remains 924 /1040 variables (removed 116) and now considering 826/942 (removed 116) transitions.
// Phase 1: matrix 826 rows 924 cols
[2021-05-14 09:26:08] [INFO ] Computed 202 place invariants in 12 ms
[2021-05-14 09:26:09] [INFO ] Implicit Places using invariants in 366 ms returned [882]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 369 ms to find 1 implicit places.
[2021-05-14 09:26:09] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 826 rows 923 cols
[2021-05-14 09:26:09] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:26:09] [INFO ] Dead Transitions using invariants and state equation in 438 ms returned []
Starting structural reductions, iteration 1 : 923/1040 places, 826/942 transitions.
Applied a total of 0 rules in 31 ms. Remains 923 /923 variables (removed 0) and now considering 826/826 (removed 0) transitions.
[2021-05-14 09:26:09] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 826 rows 923 cols
[2021-05-14 09:26:09] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:26:09] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Finished structural reductions, in 2 iterations. Remains : 923/1040 places, 826/942 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : Parking-PT-864-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s679 0) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-06 finished in 1400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1037 transition count 939
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1037 transition count 939
Applied a total of 6 rules in 54 ms. Remains 1037 /1040 variables (removed 3) and now considering 939/942 (removed 3) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2021-05-14 09:26:09] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-14 09:26:10] [INFO ] Implicit Places using invariants in 379 ms returned [758, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 380 ms to find 2 implicit places.
// Phase 1: matrix 939 rows 1035 cols
[2021-05-14 09:26:10] [INFO ] Computed 200 place invariants in 13 ms
[2021-05-14 09:26:10] [INFO ] Dead Transitions using invariants and state equation in 447 ms returned []
Starting structural reductions, iteration 1 : 1035/1040 places, 939/942 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 53 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:26:10] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:26:11] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:26:11] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:26:11] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:26:13] [INFO ] Implicit Places using invariants and state equation in 2229 ms returned []
Implicit Place search using SMT with State Equation took 2595 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1033/1040 places, 937/942 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s466 0) (EQ s877 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2904 ms.
Product exploration explored 100000 steps with 50000 reset in 2946 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 2899 ms.
Product exploration explored 100000 steps with 50000 reset in 2958 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1033 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1033/1033 places, 937/937 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 937
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 32 place count 1033 transition count 937
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 1033 transition count 937
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 96 place count 1001 transition count 905
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 128 place count 1001 transition count 905
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 176 place count 1001 transition count 937
Deduced a syphon composed of 80 places in 0 ms
Applied a total of 176 rules in 122 ms. Remains 1001 /1033 variables (removed 32) and now considering 937/937 (removed 0) transitions.
[2021-05-14 09:26:25] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 937 rows 1001 cols
[2021-05-14 09:26:25] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:26:25] [INFO ] Dead Transitions using invariants and state equation in 431 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1001/1033 places, 937/937 transitions.
Product exploration explored 100000 steps with 50000 reset in 6891 ms.
Product exploration explored 100000 steps with 50000 reset in 6942 ms.
[2021-05-14 09:26:39] [INFO ] Flatten gal took : 47 ms
[2021-05-14 09:26:39] [INFO ] Flatten gal took : 40 ms
[2021-05-14 09:26:39] [INFO ] Time to serialize gal into /tmp/LTL5290761849409830850.gal : 4 ms
[2021-05-14 09:26:39] [INFO ] Time to serialize properties into /tmp/LTL3405946031644571961.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5290761849409830850.gal, -t, CGAL, -LTL, /tmp/LTL3405946031644571961.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5290761849409830850.gal -t CGAL -LTL /tmp/LTL3405946031644571961.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p523==0)||(p1003==1))"))))
Formula 0 simplified : !XF"((p523==0)||(p1003==1))"
Detected timeout of ITS tools.
[2021-05-14 09:26:55] [INFO ] Flatten gal took : 29 ms
[2021-05-14 09:26:55] [INFO ] Applying decomposition
[2021-05-14 09:26:55] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10219557480096876837.txt, -o, /tmp/graph10219557480096876837.bin, -w, /tmp/graph10219557480096876837.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10219557480096876837.bin, -l, -1, -v, -w, /tmp/graph10219557480096876837.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:26:55] [INFO ] Decomposing Gal with order
[2021-05-14 09:26:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:26:55] [INFO ] Removed a total of 115 redundant transitions.
[2021-05-14 09:26:55] [INFO ] Flatten gal took : 50 ms
[2021-05-14 09:26:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-14 09:26:55] [INFO ] Time to serialize gal into /tmp/LTL16712566908026423792.gal : 9 ms
[2021-05-14 09:26:59] [INFO ] Time to serialize properties into /tmp/LTL9437516745998325109.ltl : 4723 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16712566908026423792.gal, -t, CGAL, -LTL, /tmp/LTL9437516745998325109.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16712566908026423792.gal -t CGAL -LTL /tmp/LTL9437516745998325109.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i8.u177.p523==0)||(i13.u308.p1003==1))"))))
Formula 0 simplified : !XF"((i8.u177.p523==0)||(i13.u308.p1003==1))"
Reverse transition relation is NOT exact ! Due to transitions i2.u368.t2, i4.u94.t241, i5.u133.t207, i6.u172.t173, i8.u212.t139, i10.i2.i1.u251.t104, i12.u290.t70, i13.u329.t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/929/8/937
Computing Next relation with stutter on 5.35201e+12 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1471 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.8169,493896,1,0,819986,13262,12593,2.82945e+06,872,54789,764673
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-864-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property Parking-PT-864-09 finished in 65084 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1040 transition count 910
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1008 transition count 910
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1008 transition count 878
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 976 transition count 878
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 973 transition count 875
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 973 transition count 875
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 234 place count 923 transition count 825
Applied a total of 234 rules in 109 ms. Remains 923 /1040 variables (removed 117) and now considering 825/942 (removed 117) transitions.
// Phase 1: matrix 825 rows 923 cols
[2021-05-14 09:27:15] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-14 09:27:15] [INFO ] Implicit Places using invariants in 365 ms returned [678, 881]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 366 ms to find 2 implicit places.
[2021-05-14 09:27:15] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 825 rows 921 cols
[2021-05-14 09:27:15] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:27:15] [INFO ] Dead Transitions using invariants and state equation in 427 ms returned []
Starting structural reductions, iteration 1 : 921/1040 places, 825/942 transitions.
Applied a total of 0 rules in 30 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
[2021-05-14 09:27:15] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 825 rows 921 cols
[2021-05-14 09:27:15] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:27:16] [INFO ] Dead Transitions using invariants and state equation in 388 ms returned []
Finished structural reductions, in 2 iterations. Remains : 921/1040 places, 825/942 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s235 0) (EQ s523 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 393 reset in 824 ms.
Product exploration explored 100000 steps with 391 reset in 912 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 398 reset in 844 ms.
Product exploration explored 100000 steps with 391 reset in 938 ms.
[2021-05-14 09:27:20] [INFO ] Flatten gal took : 26 ms
[2021-05-14 09:27:20] [INFO ] Flatten gal took : 25 ms
[2021-05-14 09:27:25] [INFO ] Time to serialize gal into /tmp/LTL3024394311231150741.gal : 5841 ms
[2021-05-14 09:27:26] [INFO ] Time to serialize properties into /tmp/LTL16112774034519647841.ltl : 377 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3024394311231150741.gal, -t, CGAL, -LTL, /tmp/LTL16112774034519647841.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3024394311231150741.gal -t CGAL -LTL /tmp/LTL16112774034519647841.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((p268==0)||(p655==1))"))))
Formula 0 simplified : !FG"((p268==0)||(p655==1))"
Detected timeout of ITS tools.
[2021-05-14 09:27:41] [INFO ] Flatten gal took : 25 ms
[2021-05-14 09:27:41] [INFO ] Applying decomposition
[2021-05-14 09:27:41] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18166927713204310966.txt, -o, /tmp/graph18166927713204310966.bin, -w, /tmp/graph18166927713204310966.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18166927713204310966.bin, -l, -1, -v, -w, /tmp/graph18166927713204310966.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:27:41] [INFO ] Decomposing Gal with order
[2021-05-14 09:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:27:41] [INFO ] Removed a total of 248 redundant transitions.
[2021-05-14 09:27:41] [INFO ] Flatten gal took : 41 ms
[2021-05-14 09:27:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 13 ms.
[2021-05-14 09:27:41] [INFO ] Time to serialize gal into /tmp/LTL2010743782957557699.gal : 6 ms
[2021-05-14 09:27:41] [INFO ] Time to serialize properties into /tmp/LTL3824832256766039502.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2010743782957557699.gal, -t, CGAL, -LTL, /tmp/LTL3824832256766039502.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2010743782957557699.gal -t CGAL -LTL /tmp/LTL3824832256766039502.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.u104.p268==0)||(i10.u212.p655==1))"))))
Formula 0 simplified : !FG"((i5.u104.p268==0)||(i10.u212.p655==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16113846642189747915
[2021-05-14 09:27:56] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16113846642189747915
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16113846642189747915]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16113846642189747915] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16113846642189747915] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property Parking-PT-864-10 finished in 42611 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1039 transition count 909
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1007 transition count 909
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1007 transition count 877
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 975 transition count 877
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 972 transition count 874
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 972 transition count 874
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 234 place count 922 transition count 824
Applied a total of 234 rules in 136 ms. Remains 922 /1040 variables (removed 118) and now considering 824/942 (removed 118) transitions.
// Phase 1: matrix 824 rows 922 cols
[2021-05-14 09:27:57] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-14 09:27:58] [INFO ] Implicit Places using invariants in 476 ms returned [677, 880]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 479 ms to find 2 implicit places.
[2021-05-14 09:27:58] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 824 rows 920 cols
[2021-05-14 09:27:58] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:27:58] [INFO ] Dead Transitions using invariants and state equation in 424 ms returned []
Starting structural reductions, iteration 1 : 920/1040 places, 824/942 transitions.
Applied a total of 0 rules in 29 ms. Remains 920 /920 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2021-05-14 09:27:58] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 824 rows 920 cols
[2021-05-14 09:27:58] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:27:59] [INFO ] Dead Transitions using invariants and state equation in 468 ms returned []
Finished structural reductions, in 2 iterations. Remains : 920/1040 places, 824/942 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s502 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 224 steps with 0 reset in 2 ms.
FORMULA Parking-PT-864-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-11 finished in 1631 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 940
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 940
Applied a total of 4 rules in 57 ms. Remains 1038 /1040 variables (removed 2) and now considering 940/942 (removed 2) transitions.
// Phase 1: matrix 940 rows 1038 cols
[2021-05-14 09:27:59] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-14 09:27:59] [INFO ] Implicit Places using invariants in 440 ms returned [759, 991]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 442 ms to find 2 implicit places.
// Phase 1: matrix 940 rows 1036 cols
[2021-05-14 09:27:59] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:28:00] [INFO ] Dead Transitions using invariants and state equation in 493 ms returned []
Starting structural reductions, iteration 1 : 1036/1040 places, 940/942 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 938
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 938
Applied a total of 4 rules in 57 ms. Remains 1034 /1036 variables (removed 2) and now considering 938/940 (removed 2) transitions.
// Phase 1: matrix 938 rows 1034 cols
[2021-05-14 09:28:00] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:28:00] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 938 rows 1034 cols
[2021-05-14 09:28:00] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:28:01] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:28:03] [INFO ] Implicit Places using invariants and state equation in 2339 ms returned []
Implicit Place search using SMT with State Equation took 2724 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1034/1040 places, 938/942 transitions.
Stuttering acceptance computed with spot in 7841 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s541 0) (NEQ s689 1) (NEQ s1012 0) (NEQ s570 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-13 finished in 11635 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0 U X(X((X(p1) U G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 942/942 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1038 transition count 940
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1038 transition count 940
Applied a total of 4 rules in 64 ms. Remains 1038 /1040 variables (removed 2) and now considering 940/942 (removed 2) transitions.
// Phase 1: matrix 940 rows 1038 cols
[2021-05-14 09:28:10] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-14 09:28:11] [INFO ] Implicit Places using invariants in 382 ms returned [759]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 392 ms to find 1 implicit places.
// Phase 1: matrix 940 rows 1037 cols
[2021-05-14 09:28:11] [INFO ] Computed 201 place invariants in 9 ms
[2021-05-14 09:28:11] [INFO ] Dead Transitions using invariants and state equation in 461 ms returned []
Starting structural reductions, iteration 1 : 1037/1040 places, 940/942 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1036 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1036 transition count 939
Applied a total of 2 rules in 68 ms. Remains 1036 /1037 variables (removed 1) and now considering 939/940 (removed 1) transitions.
// Phase 1: matrix 939 rows 1036 cols
[2021-05-14 09:28:11] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:28:12] [INFO ] Implicit Places using invariants in 426 ms returned []
// Phase 1: matrix 939 rows 1036 cols
[2021-05-14 09:28:12] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:28:12] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:28:14] [INFO ] Implicit Places using invariants and state equation in 2313 ms returned []
Implicit Place search using SMT with State Equation took 2744 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1036/1040 places, 939/942 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : Parking-PT-864-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}, { cond=p2, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p2), acceptance={} source=9 dest: 9}, { cond=(NOT p0), acceptance={} source=9 dest: 10}], [{ cond=true, acceptance={} source=10 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 8}, { cond=(AND p2 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(OR (EQ s353 1) (EQ s736 0) (EQ s711 1)), p2:(AND (EQ s176 0) (EQ s989 1)), p1:(OR (EQ s736 0) (EQ s711 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1757 steps with 6 reset in 16 ms.
FORMULA Parking-PT-864-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-14 finished in 4107 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7220608810804441016
[2021-05-14 09:28:14] [INFO ] Computing symmetric may disable matrix : 942 transitions.
[2021-05-14 09:28:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 09:28:15] [INFO ] Computing symmetric may enable matrix : 942 transitions.
[2021-05-14 09:28:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 09:28:15] [INFO ] Applying decomposition
[2021-05-14 09:28:15] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17489264696881234415.txt, -o, /tmp/graph17489264696881234415.bin, -w, /tmp/graph17489264696881234415.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17489264696881234415.bin, -l, -1, -v, -w, /tmp/graph17489264696881234415.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:28:15] [INFO ] Decomposing Gal with order
[2021-05-14 09:28:15] [INFO ] Computing Do-Not-Accords matrix : 942 transitions.
[2021-05-14 09:28:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:28:15] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 09:28:15] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7220608810804441016
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7220608810804441016]
[2021-05-14 09:28:15] [INFO ] Removed a total of 114 redundant transitions.
[2021-05-14 09:28:15] [INFO ] Flatten gal took : 49 ms
[2021-05-14 09:28:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-14 09:28:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality2805786742057846119.gal : 8 ms
[2021-05-14 09:28:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality5539518180657343451.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality2805786742057846119.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5539518180657343451.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality2805786742057846119.gal -t CGAL -LTL /tmp/LTLCardinality5539518180657343451.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(F("((i0.i2.i1.u22.p46==0)||(i8.u194.p597==1))"))))
Formula 0 simplified : !GF"((i0.i2.i1.u22.p46==0)||(i8.u194.p597==1))"
Compilation finished in 12873 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7220608810804441016]
Link finished in 89 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7220608810804441016]
Reverse transition relation is NOT exact ! Due to transitions i2.u326.t116, i3.u94.t776, i5.u133.t666, i6.u171.t556, i8.t1499, i8.t1496, i8.t1494, i8.t1493, i8.t1490, i8.t1487, i8.t1485, i8.t1482, i8.u209.t444, i8.u209.t446, i10.i1.i1.u248.t336, i11.i0.i1.u287.t226, i14.i2.i1.u365.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/925/17/942
Computing Next relation with stutter on 5.35201e+12 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2040 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,20.5241,634700,1,0,1.47351e+06,6350,16382,2.89624e+06,1244,19547,1963451
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-864-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X("((i0.i0.i1.u3.p7==0)||(i2.u325.p979==1))")))
Formula 1 simplified : !X"((i0.i0.i1.u3.p7==0)||(i2.u325.p979==1))"
Computing Next relation with stutter on 5.35201e+12 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,20.525,634952,1,0,1.47351e+06,6350,16393,2.89624e+06,1246,19547,1963516
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Parking-PT-864-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G("((i5.u105.p268==0)||(i9.u213.p655==1))"))))
Formula 2 simplified : !FG"((i5.u105.p268==0)||(i9.u213.p655==1))"
Computing Next relation with stutter on 5.35201e+12 deadlock states
LTSmin run took 17000 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7220608810804441016]
WARNING : LTSmin timed out (>360 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7220608810804441016]
Retrying LTSmin with larger timeout 2880 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7220608810804441016]
Detected timeout of ITS tools.
[2021-05-14 09:50:04] [INFO ] Applying decomposition
[2021-05-14 09:50:04] [INFO ] Flatten gal took : 78 ms
[2021-05-14 09:50:04] [INFO ] Decomposing Gal with order
[2021-05-14 09:50:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:50:04] [INFO ] Removed a total of 263 redundant transitions.
[2021-05-14 09:50:04] [INFO ] Flatten gal took : 168 ms
[2021-05-14 09:50:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 39 ms.
[2021-05-14 09:50:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality4603836095293655415.gal : 14 ms
[2021-05-14 09:50:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality5293050659950570090.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality4603836095293655415.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5293050659950570090.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality4603836095293655415.gal -t CGAL -LTL /tmp/LTLCardinality5293050659950570090.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((u94.p268==0)||(u168.p655==1))"))))
Formula 0 simplified : !FG"((u94.p268==0)||(u168.p655==1))"
Reverse transition relation is NOT exact ! Due to transitions t1482, t1485, t1487, t1490, t1492, t1494, t1496, t1499, u83.t776, u110.t666, u137.t556, u164.t444, u164.t446, u191.t336, u218.t226, u245.t116, u272.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/914/17/931
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2021-05-14 10:11:54] [INFO ] Flatten gal took : 82 ms
[2021-05-14 10:11:54] [INFO ] Input system was already deterministic with 942 transitions.
[2021-05-14 10:11:54] [INFO ] Transformed 1040 places.
[2021-05-14 10:11:54] [INFO ] Transformed 942 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 10:11:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality5208367547543395331.gal : 10 ms
[2021-05-14 10:11:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality8153920802032147054.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality5208367547543395331.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8153920802032147054.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality5208367547543395331.gal -t CGAL -LTL /tmp/LTLCardinality8153920802032147054.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p268==0)||(p655==1))"))))
Formula 0 simplified : !FG"((p268==0)||(p655==1))"

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Parking-PT-864"
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-4028"
echo " Executing tool itstools"
echo " Input is Parking-PT-864, 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 r140-tall-162089127900452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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