Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.2K Apr 30 07:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 07:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 07:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 07:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 591K May 10 09:33 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 CircularTrains-PT-768-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-768-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652687584693

Running Version 202205111006
[2022-05-16 07:53:05] [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]
[2022-05-16 07:53:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:53:06] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2022-05-16 07:53:06] [INFO ] Transformed 1536 places.
[2022-05-16 07:53:06] [INFO ] Transformed 768 transitions.
[2022-05-16 07:53:06] [INFO ] Parsed PT model containing 1536 places and 768 transitions in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircularTrains-PT-768-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1536/1536 places, 768/768 transitions.
Applied a total of 0 rules in 162 ms. Remains 1536 /1536 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1536 cols
[2022-05-16 07:53:06] [INFO ] Computed 769 place invariants in 112 ms
[2022-05-16 07:53:08] [INFO ] Implicit Places using invariants in 1673 ms returned [3, 14, 18, 29, 35, 45, 47, 59, 79, 81, 83, 85, 90, 94, 96, 106, 110, 111, 125, 128, 138, 144, 149, 150, 152, 155, 158, 163, 173, 180, 187, 193, 196, 197, 198, 224, 228, 243, 244, 247, 248, 250, 255, 259, 273, 276, 296, 304, 312, 318, 325, 339, 350, 353, 355, 361, 368, 380, 381, 389, 402, 409, 414, 419, 420, 421, 438, 451, 453, 463, 464, 471, 473, 480, 499, 509, 516, 519, 530, 531, 533, 535, 544, 549, 557, 558, 561, 577, 578, 580, 600, 606, 612, 622, 630, 633, 658, 661, 662, 665, 666, 669, 671, 677, 679, 681, 688, 689, 693, 694, 696, 697, 699, 705, 709, 711, 715, 716, 725, 732, 750, 761, 767, 770, 776, 793, 804, 807, 810, 811, 817, 820, 839, 843, 846, 856, 872, 874, 883, 884, 885, 887, 905, 929, 934, 940, 942, 943, 948, 952, 953, 970, 973, 975, 977, 991, 997, 1009, 1013, 1017, 1018, 1019, 1020, 1042, 1046, 1059, 1071, 1072, 1073, 1078, 1079, 1087, 1088, 1094, 1096, 1101, 1121, 1128, 1131, 1147, 1150, 1153, 1157, 1160, 1162, 1163, 1168, 1178, 1182, 1185, 1198, 1204, 1209, 1211, 1216, 1228, 1229, 1244, 1247, 1252, 1261, 1262, 1266, 1273, 1292, 1299, 1300, 1301, 1305, 1306, 1329, 1335, 1337, 1338, 1339, 1350, 1354, 1356, 1360, 1362, 1373, 1378, 1379, 1385, 1391, 1409, 1430, 1438, 1446, 1450, 1453, 1461, 1472, 1476, 1484, 1485, 1487, 1488, 1493, 1495, 1497, 1507, 1512, 1513, 1515, 1517, 1525, 1527, 1531]
Discarding 249 places :
Implicit Place search using SMT only with invariants took 1710 ms to find 249 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1287/1536 places, 768/768 transitions.
Applied a total of 0 rules in 134 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1287/1536 places, 768/768 transitions.
Support contains 45 out of 1287 places after structural reductions.
[2022-05-16 07:53:08] [INFO ] Flatten gal took : 103 ms
[2022-05-16 07:53:08] [INFO ] Flatten gal took : 70 ms
[2022-05-16 07:53:08] [INFO ] Input system was already deterministic with 768 transitions.
Support contains 44 out of 1287 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 741 ms. (steps per millisecond=13 ) properties (out of 29) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 768 rows 1287 cols
[2022-05-16 07:53:10] [INFO ] Computed 520 place invariants in 26 ms
[2022-05-16 07:53:10] [INFO ] [Real]Absence check using 512 positive place invariants in 112 ms returned sat
[2022-05-16 07:53:10] [INFO ] [Real]Absence check using 512 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-16 07:53:10] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
FORMULA CircularTrains-PT-768-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA CircularTrains-PT-768-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-768-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 61 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2022-05-16 07:53:11] [INFO ] Computed 520 place invariants in 37 ms
[2022-05-16 07:53:11] [INFO ] Implicit Places using invariants in 748 ms returned [67, 87, 279, 282, 560, 655, 848]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 751 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 108 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-00 automaton TGBA Formula[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:(GT s670 s1144)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 251 steps with 0 reset in 21 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLCardinality-00 finished in 1186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(p0) U p1)))))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1287 transition count 527
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 1046 transition count 527
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 482 place count 1046 transition count 519
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 166 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2022-05-16 07:53:12] [INFO ] Computed 520 place invariants in 8 ms
[2022-05-16 07:53:13] [INFO ] Implicit Places using invariants in 775 ms returned [57, 71, 222, 225, 456, 530, 683]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 794 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1025/1287 places, 513/768 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1025 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1024 transition count 512
Applied a total of 2 rules in 58 ms. Remains 1024 /1025 variables (removed 1) and now considering 512/513 (removed 1) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:53:13] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 07:53:13] [INFO ] Implicit Places using invariants in 743 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:53:13] [INFO ] Computed 513 place invariants in 43 ms
[2022-05-16 07:53:15] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1024/1287 places, 512/768 transitions.
Finished structural reductions, in 2 iterations. Remains : 1024/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s649), p0:(LEQ 1 s132)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 501 reset in 3836 ms.
Product exploration explored 100000 steps with 558 reset in 4037 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 372 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 1 factoid took 361 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:53:24] [INFO ] Computed 513 place invariants in 7 ms
[2022-05-16 07:53:25] [INFO ] [Real]Absence check using 511 positive place invariants in 269 ms returned sat
[2022-05-16 07:53:25] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 77 ms returned sat
[2022-05-16 07:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:53:26] [INFO ] [Real]Absence check using state equation in 1399 ms returned sat
[2022-05-16 07:53:26] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-16 07:53:39] [INFO ] Added : 254 causal constraints over 51 iterations in 12787 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 33 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:53:39] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 07:53:40] [INFO ] Implicit Places using invariants in 705 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:53:40] [INFO ] Computed 513 place invariants in 7 ms
[2022-05-16 07:53:41] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
[2022-05-16 07:53:41] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:53:41] [INFO ] Computed 513 place invariants in 8 ms
[2022-05-16 07:53:41] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 300 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 217 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 1 factoid took 271 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:53:43] [INFO ] Computed 513 place invariants in 7 ms
[2022-05-16 07:53:43] [INFO ] [Real]Absence check using 511 positive place invariants in 278 ms returned sat
[2022-05-16 07:53:44] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 64 ms returned sat
[2022-05-16 07:53:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:53:45] [INFO ] [Real]Absence check using state equation in 1379 ms returned sat
[2022-05-16 07:53:45] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-16 07:53:58] [INFO ] Deduced a trap composed of 2 places in 498 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 07:53:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 548 reset in 3861 ms.
Product exploration explored 100000 steps with 544 reset in 4012 ms.
Built C files in :
/tmp/ltsmin17404204858112693625
[2022-05-16 07:54:06] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-16 07:54:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:54:06] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-16 07:54:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:54:06] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-16 07:54:07] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:54:07] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17404204858112693625
Running compilation step : cd /tmp/ltsmin17404204858112693625;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1402 ms.
Running link step : cd /tmp/ltsmin17404204858112693625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin17404204858112693625;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7435114767007220605.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 40 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:54:21] [INFO ] Computed 513 place invariants in 13 ms
[2022-05-16 07:54:22] [INFO ] Implicit Places using invariants in 789 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:54:22] [INFO ] Computed 513 place invariants in 13 ms
[2022-05-16 07:54:23] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
[2022-05-16 07:54:23] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:54:23] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 07:54:24] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin5721374816560649850
[2022-05-16 07:54:24] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-16 07:54:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:54:24] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-16 07:54:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:54:24] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-16 07:54:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:54:24] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5721374816560649850
Running compilation step : cd /tmp/ltsmin5721374816560649850;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1245 ms.
Running link step : cd /tmp/ltsmin5721374816560649850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5721374816560649850;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4077129038169224106.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:54:39] [INFO ] Flatten gal took : 33 ms
[2022-05-16 07:54:39] [INFO ] Flatten gal took : 32 ms
[2022-05-16 07:54:39] [INFO ] Time to serialize gal into /tmp/LTL3218743987591521389.gal : 7 ms
[2022-05-16 07:54:39] [INFO ] Time to serialize properties into /tmp/LTL14099932704843523818.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3218743987591521389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14099932704843523818.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3218743...267
Read 1 LTL properties
Checking formula 0 : !((F(X(G((F("(Section_623>=1)"))U("(Section_608>=1)"))))))
Formula 0 simplified : !FXG(F"(Section_623>=1)" U "(Section_608>=1)")
Detected timeout of ITS tools.
[2022-05-16 07:54:54] [INFO ] Flatten gal took : 34 ms
[2022-05-16 07:54:54] [INFO ] Applying decomposition
[2022-05-16 07:54:54] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13618057586804119330.txt' '-o' '/tmp/graph13618057586804119330.bin' '-w' '/tmp/graph13618057586804119330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13618057586804119330.bin' '-l' '-1' '-v' '-w' '/tmp/graph13618057586804119330.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:54:54] [INFO ] Decomposing Gal with order
[2022-05-16 07:54:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:54:55] [INFO ] Flatten gal took : 110 ms
[2022-05-16 07:54:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-16 07:54:55] [INFO ] Time to serialize gal into /tmp/LTL10408039455368282391.gal : 14 ms
[2022-05-16 07:54:55] [INFO ] Time to serialize properties into /tmp/LTL2835899259412181504.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10408039455368282391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2835899259412181504.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1040803...246
Read 1 LTL properties
Checking formula 0 : !((F(X(G((F("(i27.i1.i0.i0.u69.Section_623>=1)"))U("(i27.i0.i1.i0.u86.Section_608>=1)"))))))
Formula 0 simplified : !FXG(F"(i27.i1.i0.i0.u69.Section_623>=1)" U "(i27.i0.i1.i0.u86.Section_608>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin522781016231948232
[2022-05-16 07:55:10] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin522781016231948232
Running compilation step : cd /tmp/ltsmin522781016231948232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 887 ms.
Running link step : cd /tmp/ltsmin522781016231948232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin522781016231948232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLCardinality-02 finished in 133114 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U (G(p1)||p0)))))'
Support contains 3 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1287 transition count 527
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 1046 transition count 527
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 482 place count 1046 transition count 520
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 508 place count 1033 transition count 514
Applied a total of 508 rules in 109 ms. Remains 1033 /1287 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1033 cols
[2022-05-16 07:55:25] [INFO ] Computed 520 place invariants in 6 ms
[2022-05-16 07:55:26] [INFO ] Implicit Places using invariants in 754 ms returned [57, 71, 222, 225, 457, 684]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 773 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1027/1287 places, 514/768 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1027 transition count 513
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1026 transition count 513
Applied a total of 2 rules in 34 ms. Remains 1026 /1027 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 07:55:26] [INFO ] Computed 514 place invariants in 18 ms
[2022-05-16 07:55:26] [INFO ] Implicit Places using invariants in 685 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 07:55:26] [INFO ] Computed 514 place invariants in 8 ms
[2022-05-16 07:55:27] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1026/1287 places, 513/768 transitions.
Finished structural reductions, in 2 iterations. Remains : 1026/1287 places, 513/768 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s413 s299), p1:(LEQ 1 s526)], nbAcceptance=2, 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 0 reset in 2879 ms.
Product exploration explored 100000 steps with 0 reset in 3220 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 322 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1218 steps, including 0 resets, run visited all 4 properties in 56 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 382 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 54 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 07:55:35] [INFO ] Computed 514 place invariants in 7 ms
[2022-05-16 07:55:36] [INFO ] Implicit Places using invariants in 659 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 07:55:36] [INFO ] Computed 514 place invariants in 7 ms
[2022-05-16 07:55:36] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1574 ms to find 0 implicit places.
[2022-05-16 07:55:36] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 07:55:36] [INFO ] Computed 514 place invariants in 6 ms
[2022-05-16 07:55:37] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 299 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 435 steps, including 0 resets, run visited all 4 properties in 21 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 358 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2824 ms.
Product exploration explored 100000 steps with 0 reset in 3153 ms.
Built C files in :
/tmp/ltsmin11758058511274534294
[2022-05-16 07:55:44] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2022-05-16 07:55:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:55:44] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2022-05-16 07:55:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:55:44] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2022-05-16 07:55:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:55:44] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11758058511274534294
Running compilation step : cd /tmp/ltsmin11758058511274534294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1261 ms.
Running link step : cd /tmp/ltsmin11758058511274534294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11758058511274534294;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7557313647873767299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1026 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1026/1026 places, 513/513 transitions.
Applied a total of 0 rules in 37 ms. Remains 1026 /1026 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 07:55:59] [INFO ] Computed 514 place invariants in 9 ms
[2022-05-16 07:56:00] [INFO ] Implicit Places using invariants in 727 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 07:56:00] [INFO ] Computed 514 place invariants in 6 ms
[2022-05-16 07:56:01] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
[2022-05-16 07:56:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 513 rows 1026 cols
[2022-05-16 07:56:01] [INFO ] Computed 514 place invariants in 5 ms
[2022-05-16 07:56:01] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1026/1026 places, 513/513 transitions.
Built C files in :
/tmp/ltsmin13922280169418873089
[2022-05-16 07:56:01] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2022-05-16 07:56:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:56:01] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2022-05-16 07:56:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:56:01] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2022-05-16 07:56:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:56:01] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13922280169418873089
Running compilation step : cd /tmp/ltsmin13922280169418873089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1215 ms.
Running link step : cd /tmp/ltsmin13922280169418873089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13922280169418873089;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12833093109090897355.hoa' '--buchi-type=spotba'
LTSmin run took 12098 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLCardinality-03 finished in 50022 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(F((!F(p1)||(p2&&(F(p0)||p0))))))))'
Support contains 5 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1287 transition count 527
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 483 place count 1046 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 484 place count 1045 transition count 519
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 112 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2022-05-16 07:56:15] [INFO ] Computed 520 place invariants in 13 ms
[2022-05-16 07:56:16] [INFO ] Implicit Places using invariants in 751 ms returned [222, 225, 456, 530]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 753 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1028/1287 places, 513/768 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1028 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1027 transition count 512
Applied a total of 2 rules in 35 ms. Remains 1027 /1028 variables (removed 1) and now considering 512/513 (removed 1) transitions.
// Phase 1: matrix 512 rows 1027 cols
[2022-05-16 07:56:16] [INFO ] Computed 516 place invariants in 11 ms
[2022-05-16 07:56:16] [INFO ] Implicit Places using invariants in 721 ms returned []
// Phase 1: matrix 512 rows 1027 cols
[2022-05-16 07:56:16] [INFO ] Computed 516 place invariants in 6 ms
[2022-05-16 07:56:17] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1027/1287 places, 512/768 transitions.
Finished structural reductions, in 2 iterations. Remains : 1027/1287 places, 512/768 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND p1 (NOT p0)), (AND p1 (NOT p2))]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s400 s678), p0:(LEQ 2 s71), p2:(LEQ s57 s381)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 122 reset in 3358 ms.
Product exploration explored 100000 steps with 161 reset in 3649 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 338 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Finished random walk after 4616 steps, including 1 resets, run visited all 4 properties in 153 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 459 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND p1 (NOT p2))]
// Phase 1: matrix 512 rows 1027 cols
[2022-05-16 07:56:26] [INFO ] Computed 516 place invariants in 15 ms
[2022-05-16 07:56:27] [INFO ] [Real]Absence check using 512 positive place invariants in 271 ms returned sat
[2022-05-16 07:56:27] [INFO ] [Real]Absence check using 512 positive and 4 generalized place invariants in 69 ms returned unsat
Proved EG (AND (NOT p0) p1)
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p1 (NOT p2))), (G (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) p1))
Knowledge based reduction with 4 factoid took 371 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA CircularTrains-PT-768-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-768-LTLCardinality-05 finished in 12764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 32 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2022-05-16 07:56:28] [INFO ] Computed 520 place invariants in 14 ms
[2022-05-16 07:56:28] [INFO ] Implicit Places using invariants in 808 ms returned [67, 87, 279, 282, 655, 848]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 809 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1281/1287 places, 768/768 transitions.
Applied a total of 0 rules in 34 ms. Remains 1281 /1281 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1281/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-06 automaton TGBA Formula[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:(GT s414 s556)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 CircularTrains-PT-768-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLCardinality-06 finished in 984 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 38 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2022-05-16 07:56:29] [INFO ] Computed 520 place invariants in 14 ms
[2022-05-16 07:56:29] [INFO ] Implicit Places using invariants in 802 ms returned [67, 87, 279, 282, 560, 655, 848]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 810 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 33 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-07 automaton TGBA Formula[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:(LEQ s741 s99)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 996 steps with 0 reset in 33 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLCardinality-07 finished in 1004 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F((F(p0)||p0))))&&X(X(p1)))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2022-05-16 07:56:30] [INFO ] Computed 520 place invariants in 15 ms
[2022-05-16 07:56:30] [INFO ] Implicit Places using invariants in 759 ms returned [67, 87, 279, 282, 560, 655, 848]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 780 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 36 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s551 s1232), p0:(GT s1012 s696)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 16900 steps with 28 reset in 563 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLCardinality-11 finished in 1588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((!F(p0) U p1) U p2))))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 37 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2022-05-16 07:56:31] [INFO ] Computed 520 place invariants in 16 ms
[2022-05-16 07:56:32] [INFO ] Implicit Places using invariants in 717 ms returned [67, 87, 279, 282, 560, 655, 848]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 731 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 40 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (LEQ s309 s317) (LEQ s1173 s639))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 512 reset in 3802 ms.
Product exploration explored 100000 steps with 490 reset in 3901 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Finished random walk after 483 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p2)]
// Phase 1: matrix 768 rows 1280 cols
[2022-05-16 07:56:41] [INFO ] Computed 513 place invariants in 8 ms
[2022-05-16 07:56:41] [INFO ] [Real]Absence check using 511 positive place invariants in 305 ms returned sat
[2022-05-16 07:56:42] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 85 ms returned sat
[2022-05-16 07:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:56:49] [INFO ] [Real]Absence check using state equation in 7319 ms returned sat
[2022-05-16 07:56:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:56:50] [INFO ] [Nat]Absence check using 511 positive place invariants in 307 ms returned sat
[2022-05-16 07:56:50] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 70 ms returned sat
[2022-05-16 07:56:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:56:53] [INFO ] [Nat]Absence check using state equation in 2987 ms returned sat
[2022-05-16 07:56:53] [INFO ] Computed and/alt/rep : 512/768/512 causal constraints (skipped 0 transitions) in 62 ms.
[2022-05-16 07:57:01] [INFO ] Added : 509 causal constraints over 102 iterations in 7711 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 1280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1280/1280 places, 768/768 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1280 transition count 516
Reduce places removed 252 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 254 rules applied. Total rules applied 506 place count 1028 transition count 514
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 508 place count 1026 transition count 514
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 508 place count 1026 transition count 512
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 512 place count 1024 transition count 512
Applied a total of 512 rules in 47 ms. Remains 1024 /1280 variables (removed 256) and now considering 512/768 (removed 256) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:57:01] [INFO ] Computed 513 place invariants in 8 ms
[2022-05-16 07:57:01] [INFO ] Implicit Places using invariants in 707 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:57:01] [INFO ] Computed 513 place invariants in 8 ms
[2022-05-16 07:57:02] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
[2022-05-16 07:57:02] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:57:02] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 07:57:03] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/1280 places, 512/768 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1280 places, 512/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Finished random walk after 100 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:57:04] [INFO ] Computed 513 place invariants in 5 ms
[2022-05-16 07:57:04] [INFO ] [Real]Absence check using 511 positive place invariants in 263 ms returned sat
[2022-05-16 07:57:04] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 75 ms returned sat
[2022-05-16 07:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:57:09] [INFO ] [Real]Absence check using state equation in 4476 ms returned sat
[2022-05-16 07:57:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:57:10] [INFO ] [Nat]Absence check using 511 positive place invariants in 265 ms returned sat
[2022-05-16 07:57:10] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 47 ms returned sat
[2022-05-16 07:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:57:11] [INFO ] [Nat]Absence check using state equation in 1748 ms returned sat
[2022-05-16 07:57:12] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 59 ms.
[2022-05-16 07:57:14] [INFO ] Added : 254 causal constraints over 51 iterations in 2785 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Product exploration explored 100000 steps with 763 reset in 3882 ms.
Product exploration explored 100000 steps with 874 reset in 4160 ms.
Built C files in :
/tmp/ltsmin15183743225971469799
[2022-05-16 07:57:22] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-16 07:57:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:57:22] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-16 07:57:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:57:22] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-16 07:57:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:57:22] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15183743225971469799
Running compilation step : cd /tmp/ltsmin15183743225971469799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1218 ms.
Running link step : cd /tmp/ltsmin15183743225971469799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15183743225971469799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6414985209630072224.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 32 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:57:37] [INFO ] Computed 513 place invariants in 12 ms
[2022-05-16 07:57:38] [INFO ] Implicit Places using invariants in 684 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:57:38] [INFO ] Computed 513 place invariants in 13 ms
[2022-05-16 07:57:39] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
[2022-05-16 07:57:39] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:57:39] [INFO ] Computed 513 place invariants in 5 ms
[2022-05-16 07:57:40] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin9523273246255801150
[2022-05-16 07:57:40] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-16 07:57:40] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:57:40] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-16 07:57:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:57:40] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-16 07:57:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:57:40] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9523273246255801150
Running compilation step : cd /tmp/ltsmin9523273246255801150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1252 ms.
Running link step : cd /tmp/ltsmin9523273246255801150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9523273246255801150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2018247214519340725.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 07:57:55] [INFO ] Flatten gal took : 24 ms
[2022-05-16 07:57:55] [INFO ] Flatten gal took : 24 ms
[2022-05-16 07:57:55] [INFO ] Time to serialize gal into /tmp/LTL17349870670121963202.gal : 8 ms
[2022-05-16 07:57:55] [INFO ] Time to serialize properties into /tmp/LTL8097910458383821480.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17349870670121963202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8097910458383821480.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1734987...267
Read 1 LTL properties
Checking formula 0 : !((F(X(((!(F("(F604<=Section_206)")))U("(Section_107<=Section_738)"))U("((F604<=Section_206)&&(Section_107<=Section_738))")))))
Formula 0 simplified : !FX((!F"(F604<=Section_206)" U "(Section_107<=Section_738)") U "((F604<=Section_206)&&(Section_107<=Section_738))")
Detected timeout of ITS tools.
[2022-05-16 07:58:10] [INFO ] Flatten gal took : 38 ms
[2022-05-16 07:58:10] [INFO ] Applying decomposition
[2022-05-16 07:58:10] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16038490130183816970.txt' '-o' '/tmp/graph16038490130183816970.bin' '-w' '/tmp/graph16038490130183816970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16038490130183816970.bin' '-l' '-1' '-v' '-w' '/tmp/graph16038490130183816970.weights' '-q' '0' '-e' '0.001'
[2022-05-16 07:58:10] [INFO ] Decomposing Gal with order
[2022-05-16 07:58:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 07:58:10] [INFO ] Flatten gal took : 85 ms
[2022-05-16 07:58:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 43 ms.
[2022-05-16 07:58:10] [INFO ] Time to serialize gal into /tmp/LTL1621866510364384311.gal : 9 ms
[2022-05-16 07:58:10] [INFO ] Time to serialize properties into /tmp/LTL14537590811052923534.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1621866510364384311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14537590811052923534.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1621866...267
Read 1 LTL properties
Checking formula 0 : !((F(X(((!(F("(gu120.F604<=gu120.Section_206)")))U("(gu257.Section_107<=gu257.Section_738)"))U("((gu120.F604<=gu120.Section_206)&&(gu2...196
Formula 0 simplified : !FX((!F"(gu120.F604<=gu120.Section_206)" U "(gu257.Section_107<=gu257.Section_738)") U "((gu120.F604<=gu120.Section_206)&&(gu257.Sec...186
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10670499719699939150
[2022-05-16 07:58:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10670499719699939150
Running compilation step : cd /tmp/ltsmin10670499719699939150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1026 ms.
Running link step : cd /tmp/ltsmin10670499719699939150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10670499719699939150;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(((!<>((LTLAPp0==true)) U (LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CircularTrains-PT-768-LTLCardinality-12 finished in 129549 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((true U false)||G(X(X(G(X(p0)))))))'
Support contains 1 out of 1287 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Applied a total of 0 rules in 35 ms. Remains 1287 /1287 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 1287 cols
[2022-05-16 07:58:41] [INFO ] Computed 520 place invariants in 14 ms
[2022-05-16 07:58:41] [INFO ] Implicit Places using invariants in 781 ms returned [67, 87, 279, 282, 560, 655, 848]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 784 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1280/1287 places, 768/768 transitions.
Applied a total of 0 rules in 34 ms. Remains 1280 /1280 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1280/1287 places, 768/768 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT 1 s750)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 293 steps with 0 reset in 16 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-768-LTLCardinality-14 finished in 1019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 242 rules applied. Total rules applied 481 place count 1048 transition count 526
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 484 place count 1045 transition count 526
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 484 place count 1045 transition count 520
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 496 place count 1039 transition count 520
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 508 place count 1033 transition count 514
Applied a total of 508 rules in 75 ms. Remains 1033 /1287 variables (removed 254) and now considering 514/768 (removed 254) transitions.
// Phase 1: matrix 514 rows 1033 cols
[2022-05-16 07:58:42] [INFO ] Computed 520 place invariants in 6 ms
[2022-05-16 07:58:43] [INFO ] Implicit Places using invariants in 749 ms returned [57, 71, 222, 225, 456, 530, 683]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 754 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1026/1287 places, 514/768 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1026 transition count 513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1025 transition count 513
Applied a total of 2 rules in 32 ms. Remains 1025 /1026 variables (removed 1) and now considering 513/514 (removed 1) transitions.
// Phase 1: matrix 513 rows 1025 cols
[2022-05-16 07:58:43] [INFO ] Computed 513 place invariants in 12 ms
[2022-05-16 07:58:43] [INFO ] Implicit Places using invariants in 720 ms returned []
// Phase 1: matrix 513 rows 1025 cols
[2022-05-16 07:58:43] [INFO ] Computed 513 place invariants in 11 ms
[2022-05-16 07:58:44] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1025/1287 places, 513/768 transitions.
Finished structural reductions, in 2 iterations. Remains : 1025/1287 places, 513/768 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s320 s70), p0:(GT s75 s943)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 243 reset in 3529 ms.
Product exploration explored 100000 steps with 234 reset in 3746 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 271 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p0)]
Finished random walk after 1888 steps, including 0 resets, run visited all 3 properties in 62 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 513 rows 1025 cols
[2022-05-16 07:58:53] [INFO ] Computed 513 place invariants in 11 ms
[2022-05-16 07:58:54] [INFO ] [Real]Absence check using 511 positive place invariants in 275 ms returned sat
[2022-05-16 07:58:54] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 49 ms returned sat
[2022-05-16 07:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:58:57] [INFO ] [Real]Absence check using state equation in 3335 ms returned sat
[2022-05-16 07:58:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:58:58] [INFO ] [Nat]Absence check using 511 positive place invariants in 268 ms returned sat
[2022-05-16 07:58:58] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 123 ms returned sat
[2022-05-16 07:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:58:59] [INFO ] [Nat]Absence check using state equation in 1181 ms returned sat
[2022-05-16 07:58:59] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-16 07:59:03] [INFO ] Added : 255 causal constraints over 51 iterations in 3916 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 1025 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1025/1025 places, 513/513 transitions.
Applied a total of 0 rules in 32 ms. Remains 1025 /1025 variables (removed 0) and now considering 513/513 (removed 0) transitions.
// Phase 1: matrix 513 rows 1025 cols
[2022-05-16 07:59:03] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 07:59:04] [INFO ] Implicit Places using invariants in 679 ms returned []
// Phase 1: matrix 513 rows 1025 cols
[2022-05-16 07:59:04] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 07:59:05] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2022-05-16 07:59:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 513 rows 1025 cols
[2022-05-16 07:59:05] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 07:59:05] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1025/1025 places, 513/513 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 251 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 513 rows 1025 cols
[2022-05-16 07:59:06] [INFO ] Computed 513 place invariants in 8 ms
[2022-05-16 07:59:07] [INFO ] [Real]Absence check using 511 positive place invariants in 259 ms returned sat
[2022-05-16 07:59:07] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 44 ms returned sat
[2022-05-16 07:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:59:10] [INFO ] [Real]Absence check using state equation in 3271 ms returned sat
[2022-05-16 07:59:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:59:11] [INFO ] [Nat]Absence check using 511 positive place invariants in 278 ms returned sat
[2022-05-16 07:59:11] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 124 ms returned sat
[2022-05-16 07:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:59:12] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2022-05-16 07:59:12] [INFO ] Computed and/alt/rep : 257/513/257 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-16 07:59:16] [INFO ] Added : 255 causal constraints over 51 iterations in 3817 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 229 reset in 3538 ms.
Product exploration explored 100000 steps with 237 reset in 3765 ms.
Built C files in :
/tmp/ltsmin6531062158086547218
[2022-05-16 07:59:24] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2022-05-16 07:59:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:59:24] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2022-05-16 07:59:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:59:24] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.
[2022-05-16 07:59:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:59:24] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6531062158086547218
Running compilation step : cd /tmp/ltsmin6531062158086547218;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1270 ms.
Running link step : cd /tmp/ltsmin6531062158086547218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6531062158086547218;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2193289656296664798.hoa' '--buchi-type=spotba'
LTSmin run took 12193 ms.
FORMULA CircularTrains-PT-768-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-768-LTLCardinality-15 finished in 55438 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(p0) U p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((!F(p0) U p1) U p2))))'
Found a CL insensitive property : CircularTrains-PT-768-LTLCardinality-12
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (NOT p2)]
Support contains 4 out of 1287 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1287/1287 places, 768/768 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1287 transition count 529
Reduce places removed 239 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 241 rules applied. Total rules applied 480 place count 1048 transition count 527
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 482 place count 1046 transition count 527
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 482 place count 1046 transition count 519
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 498 place count 1038 transition count 519
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 510 place count 1032 transition count 513
Applied a total of 510 rules in 76 ms. Remains 1032 /1287 variables (removed 255) and now considering 513/768 (removed 255) transitions.
// Phase 1: matrix 513 rows 1032 cols
[2022-05-16 07:59:38] [INFO ] Computed 520 place invariants in 15 ms
[2022-05-16 07:59:38] [INFO ] Implicit Places using invariants in 748 ms returned [57, 71, 222, 225, 456, 530, 683]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 750 ms to find 7 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1025/1287 places, 513/768 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1025 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1024 transition count 512
Applied a total of 2 rules in 34 ms. Remains 1024 /1025 variables (removed 1) and now considering 512/513 (removed 1) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:59:38] [INFO ] Computed 513 place invariants in 6 ms
[2022-05-16 07:59:39] [INFO ] Implicit Places using invariants in 717 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:59:39] [INFO ] Computed 513 place invariants in 12 ms
[2022-05-16 07:59:40] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1024/1287 places, 512/768 transitions.
Finished structural reductions, in 2 iterations. Remains : 1024/1287 places, 512/768 transitions.
Running random walk in product with property : CircularTrains-PT-768-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (LEQ s246 s253) (LEQ s937 s516))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 773 reset in 3937 ms.
Product exploration explored 100000 steps with 843 reset in 4196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Finished random walk after 126 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:59:49] [INFO ] Computed 513 place invariants in 7 ms
[2022-05-16 07:59:50] [INFO ] [Real]Absence check using 511 positive place invariants in 270 ms returned sat
[2022-05-16 07:59:50] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 50 ms returned sat
[2022-05-16 07:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:59:53] [INFO ] [Real]Absence check using state equation in 3376 ms returned sat
[2022-05-16 07:59:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:59:54] [INFO ] [Nat]Absence check using 511 positive place invariants in 281 ms returned sat
[2022-05-16 07:59:54] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 50 ms returned sat
[2022-05-16 07:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:59:56] [INFO ] [Nat]Absence check using state equation in 1750 ms returned sat
[2022-05-16 07:59:56] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-16 07:59:59] [INFO ] Added : 254 causal constraints over 51 iterations in 3543 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 512/512 transitions.
Applied a total of 0 rules in 28 ms. Remains 1024 /1024 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 07:59:59] [INFO ] Computed 513 place invariants in 9 ms
[2022-05-16 08:00:00] [INFO ] Implicit Places using invariants in 713 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:00:00] [INFO ] Computed 513 place invariants in 15 ms
[2022-05-16 08:00:01] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
[2022-05-16 08:00:01] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:00:01] [INFO ] Computed 513 place invariants in 7 ms
[2022-05-16 08:00:01] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 512/512 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
// Phase 1: matrix 512 rows 1024 cols
[2022-05-16 08:00:02] [INFO ] Computed 513 place invariants in 9 ms
[2022-05-16 08:00:03] [INFO ] [Real]Absence check using 511 positive place invariants in 282 ms returned sat
[2022-05-16 08:00:03] [INFO ] [Real]Absence check using 511 positive and 2 generalized place invariants in 46 ms returned sat
[2022-05-16 08:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 08:00:06] [INFO ] [Real]Absence check using state equation in 3449 ms returned sat
[2022-05-16 08:00:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 08:00:07] [INFO ] [Nat]Absence check using 511 positive place invariants in 258 ms returned sat
[2022-05-16 08:00:07] [INFO ] [Nat]Absence check using 511 positive and 2 generalized place invariants in 46 ms returned sat
[2022-05-16 08:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 08:00:09] [INFO ] [Nat]Absence check using state equation in 1687 ms returned sat
[2022-05-16 08:00:09] [INFO ] Computed and/alt/rep : 256/512/256 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-16 08:00:12] [INFO ] Added : 254 causal constraints over 51 iterations in 3483 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Product exploration explored 100000 steps with 808 reset in 3894 ms.
Product exploration explored 100000 steps with 828 reset in 4128 ms.
Built C files in :
/tmp/ltsmin13437306415992675450
[2022-05-16 08:00:20] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-16 08:00:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:00:20] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-16 08:00:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:00:20] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-16 08:00:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:00:20] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13437306415992675450
Running compilation step : cd /tmp/ltsmin13437306415992675450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1245 ms.
Running link step : cd /tmp/ltsmin13437306415992675450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13437306415992675450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8496371074311363014.hoa' '--buchi-type=spotba'
LTSmin run took 13450 ms.
Treatment of property CircularTrains-PT-768-LTLCardinality-12 finished in 57916 ms.
CL/SL decision was in the wrong direction : CL + false
[2022-05-16 08:00:35] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18386861747290724081
[2022-05-16 08:00:35] [INFO ] Computing symmetric may disable matrix : 768 transitions.
[2022-05-16 08:00:35] [INFO ] Applying decomposition
[2022-05-16 08:00:35] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:00:35] [INFO ] Computing symmetric may enable matrix : 768 transitions.
[2022-05-16 08:00:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:00:35] [INFO ] Flatten gal took : 25 ms
[2022-05-16 08:00:35] [INFO ] Computing Do-Not-Accords matrix : 768 transitions.
[2022-05-16 08:00:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 08:00:35] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18386861747290724081
Running compilation step : cd /tmp/ltsmin18386861747290724081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17783454116703614058.txt' '-o' '/tmp/graph17783454116703614058.bin' '-w' '/tmp/graph17783454116703614058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17783454116703614058.bin' '-l' '-1' '-v' '-w' '/tmp/graph17783454116703614058.weights' '-q' '0' '-e' '0.001'
[2022-05-16 08:00:35] [INFO ] Decomposing Gal with order
[2022-05-16 08:00:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 08:00:35] [INFO ] Flatten gal took : 48 ms
[2022-05-16 08:00:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 08:00:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality4122915054405181623.gal : 20 ms
[2022-05-16 08:00:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality7897374568314725854.ltl : 50 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4122915054405181623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7897374568314725854.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((F(X(G((F("(gi3.gu106.Section_623>=1)"))U("(gi3.gu63.Section_608>=1)"))))))
Formula 0 simplified : !FXG(F"(gi3.gu106.Section_623>=1)" U "(gi3.gu63.Section_608>=1)")
Compilation finished in 2153 ms.
Running link step : cd /tmp/ltsmin18386861747290724081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin18386861747290724081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: LTL layer: formula: <>(X([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))))
pins2lts-mc-linux64( 2/ 8), 0.024: "<>(X([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.024: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.146: There are 774 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.146: State length is 1288, there are 777 groups
pins2lts-mc-linux64( 0/ 8), 0.146: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.146: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.146: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.146: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 4.403: [Blue] ~120 levels ~960 states ~473712 transitions
pins2lts-mc-linux64( 0/ 8), 6.056: [Blue] ~239 levels ~1920 states ~716320 transitions
pins2lts-mc-linux64( 0/ 8), 6.854: [Blue] ~479 levels ~3840 states ~1015528 transitions
pins2lts-mc-linux64( 3/ 8), 8.167: [Blue] ~672 levels ~7680 states ~1312056 transitions
pins2lts-mc-linux64( 3/ 8), 9.429: [Blue] ~1273 levels ~15360 states ~1688680 transitions
pins2lts-mc-linux64( 3/ 8), 11.187: [Blue] ~2453 levels ~30720 states ~2098672 transitions
pins2lts-mc-linux64( 3/ 8), 13.335: [Blue] ~4874 levels ~61440 states ~2566728 transitions
pins2lts-mc-linux64( 3/ 8), 16.526: [Blue] ~9739 levels ~122880 states ~3033072 transitions
pins2lts-mc-linux64( 3/ 8), 21.241: [Blue] ~19787 levels ~245760 states ~3586392 transitions
pins2lts-mc-linux64( 3/ 8), 31.248: [Blue] ~39390 levels ~491520 states ~4254104 transitions
pins2lts-mc-linux64( 3/ 8), 51.890: [Blue] ~49667 levels ~983040 states ~5333040 transitions
pins2lts-mc-linux64( 3/ 8), 90.900: [Blue] ~49667 levels ~1966080 states ~7564336 transitions
pins2lts-mc-linux64( 3/ 8), 164.823: [Blue] ~49667 levels ~3932160 states ~12021368 transitions
pins2lts-mc-linux64( 3/ 8), 312.126: [Blue] ~49667 levels ~7864320 states ~20617904 transitions
pins2lts-mc-linux64( 6/ 8), 609.975: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 610.019:
pins2lts-mc-linux64( 0/ 8), 610.019: Explored 13949994 states 35753355 transitions, fanout: 2.563
pins2lts-mc-linux64( 0/ 8), 610.019: Total exploration time 609.850 sec (609.810 sec minimum, 609.830 sec on average)
pins2lts-mc-linux64( 0/ 8), 610.019: States per second: 22874, Transitions per second: 58626
pins2lts-mc-linux64( 0/ 8), 610.019:
pins2lts-mc-linux64( 0/ 8), 610.019: State space has 17596446 states, 51981 are accepting
pins2lts-mc-linux64( 0/ 8), 610.019: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 610.019: blue states: 13949994 (79.28%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 610.019: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 610.019: all-red states: 12038874 (68.42%), bogus 439070 (2.50%)
pins2lts-mc-linux64( 0/ 8), 610.019:
pins2lts-mc-linux64( 0/ 8), 610.019: Total memory used for local state coloring: 6.0MB
pins2lts-mc-linux64( 0/ 8), 610.019:
pins2lts-mc-linux64( 0/ 8), 610.019: Queue width: 8B, total height: 393200, memory: 3.00MB
pins2lts-mc-linux64( 0/ 8), 610.019: Tree memory: 390.2MB, 23.3 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 610.019: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 610.019: Stored 776 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 610.019: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 610.019: Est. total memory use: 393.2MB (~1027.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18386861747290724081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18386861747290724081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([]((<>((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 08:23:05] [INFO ] Flatten gal took : 26 ms
[2022-05-16 08:23:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality8216064949248076514.gal : 4 ms
[2022-05-16 08:23:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality5611932277991593792.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8216064949248076514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5611932277991593792.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !((F(X(G((F("(Section_623>=1)"))U("(Section_608>=1)"))))))
Formula 0 simplified : !FXG(F"(Section_623>=1)" U "(Section_608>=1)")
Detected timeout of ITS tools.
[2022-05-16 08:45:41] [INFO ] Flatten gal took : 231 ms
[2022-05-16 08:45:43] [INFO ] Input system was already deterministic with 768 transitions.
[2022-05-16 08:45:43] [INFO ] Transformed 1287 places.
[2022-05-16 08:45:43] [INFO ] Transformed 768 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 08:45:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality13476678249588586944.gal : 6 ms
[2022-05-16 08:45:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality5142871457914691508.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13476678249588586944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5142871457914691508.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(G((F("(Section_623>=1)"))U("(Section_608>=1)"))))))
Formula 0 simplified : !FXG(F"(Section_623>=1)" U "(Section_608>=1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="CircularTrains-PT-768"
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 CircularTrains-PT-768, 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 r024-tall-165251919000763"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-768.tgz
mv CircularTrains-PT-768 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 ;