Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592600075.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-05a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592600075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 516K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678490962863

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 23:29:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 23:29:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:29:25] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2023-03-10 23:29:25] [INFO ] Transformed 1211 places.
[2023-03-10 23:29:25] [INFO ] Transformed 1827 transitions.
[2023-03-10 23:29:25] [INFO ] Found NUPN structural information;
[2023-03-10 23:29:25] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
FORMULA ASLink-PT-05a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 1211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1181 transition count 1808
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 1174 transition count 1778
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 1174 transition count 1778
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 1174 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 1173 transition count 1769
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 1173 transition count 1769
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 1172 transition count 1761
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 1172 transition count 1761
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 1171 transition count 1753
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 1171 transition count 1753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 1170 transition count 1745
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 1170 transition count 1745
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 1169 transition count 1737
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 1169 transition count 1737
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1168 transition count 1729
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1168 transition count 1729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 1167 transition count 1721
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 1167 transition count 1721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 1166 transition count 1713
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 1166 transition count 1713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1165 transition count 1705
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 1165 transition count 1705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 1164 transition count 1697
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 1164 transition count 1697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 1163 transition count 1689
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 1163 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1162 transition count 1681
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 1162 transition count 1681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 1161 transition count 1673
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 1161 transition count 1673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 1160 transition count 1665
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 1160 transition count 1665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 1159 transition count 1657
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 1159 transition count 1657
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1158 transition count 1649
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1158 transition count 1649
Applied a total of 77 rules in 943 ms. Remains 1158 /1211 variables (removed 53) and now considering 1649/1808 (removed 159) transitions.
// Phase 1: matrix 1649 rows 1158 cols
[2023-03-10 23:29:27] [INFO ] Computed 202 place invariants in 99 ms
[2023-03-10 23:29:29] [INFO ] Implicit Places using invariants in 2446 ms returned [1, 19, 20, 21, 24, 54, 72, 201, 217, 222, 223, 224, 242, 260, 389, 405, 410, 411, 412, 430, 448, 577, 593, 598, 599, 600, 618, 636, 765, 781, 786, 787, 807, 825, 954, 959, 971, 976, 977, 978, 996, 1001, 1019, 1020, 1021, 1022, 1039, 1047, 1055, 1061, 1067, 1073, 1079, 1087, 1093, 1099, 1107]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 2504 ms to find 57 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1101/1211 places, 1649/1808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1088 transition count 1636
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1088 transition count 1636
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1078 transition count 1626
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1078 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1074 transition count 1622
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1074 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1073 transition count 1621
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1073 transition count 1621
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1072 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1072 transition count 1620
Applied a total of 58 rules in 149 ms. Remains 1072 /1101 variables (removed 29) and now considering 1620/1649 (removed 29) transitions.
// Phase 1: matrix 1620 rows 1072 cols
[2023-03-10 23:29:29] [INFO ] Computed 145 place invariants in 53 ms
[2023-03-10 23:29:30] [INFO ] Implicit Places using invariants in 640 ms returned []
[2023-03-10 23:29:30] [INFO ] Invariant cache hit.
[2023-03-10 23:29:33] [INFO ] Implicit Places using invariants and state equation in 3695 ms returned []
Implicit Place search using SMT with State Equation took 4357 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1072/1211 places, 1620/1808 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7954 ms. Remains : 1072/1211 places, 1620/1808 transitions.
Support contains 10 out of 1072 places after structural reductions.
[2023-03-10 23:29:34] [INFO ] Flatten gal took : 173 ms
[2023-03-10 23:29:34] [INFO ] Flatten gal took : 81 ms
[2023-03-10 23:29:34] [INFO ] Input system was already deterministic with 1620 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-03-10 23:29:35] [INFO ] Invariant cache hit.
[2023-03-10 23:29:35] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 23:29:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2023-03-10 23:29:35] [INFO ] [Nat]Absence check using 30 positive and 115 generalized place invariants in 37 ms returned sat
[2023-03-10 23:29:52] [INFO ] After 16989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 23:30:00] [INFO ] Deduced a trap composed of 62 places in 413 ms of which 7 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-10 23:30:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 23:30:00] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 137 ms.
Support contains 6 out of 1072 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1072/1072 places, 1620/1620 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1072 transition count 1425
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 877 transition count 1425
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 141 Pre rules applied. Total rules applied 390 place count 877 transition count 1284
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 2 with 327 rules applied. Total rules applied 717 place count 691 transition count 1284
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 16 rules applied. Total rules applied 733 place count 684 transition count 1275
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 742 place count 675 transition count 1275
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 742 place count 675 transition count 1255
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 782 place count 655 transition count 1255
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 786 place count 651 transition count 1251
Iterating global reduction 4 with 4 rules applied. Total rules applied 790 place count 651 transition count 1251
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 794 place count 651 transition count 1247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 795 place count 650 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 796 place count 649 transition count 1246
Iterating global reduction 6 with 1 rules applied. Total rules applied 797 place count 649 transition count 1246
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 798 place count 649 transition count 1245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 799 place count 648 transition count 1245
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 8 with 117 rules applied. Total rules applied 916 place count 589 transition count 1187
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 918 place count 587 transition count 1185
Iterating global reduction 8 with 2 rules applied. Total rules applied 920 place count 587 transition count 1185
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 921 place count 587 transition count 1184
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 924 place count 587 transition count 1181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 927 place count 584 transition count 1181
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 946 place count 584 transition count 1162
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 966 place count 564 transition count 1162
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 969 place count 564 transition count 1159
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 985 place count 564 transition count 1159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 986 place count 563 transition count 1158
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 991 place count 558 transition count 1158
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 10 Pre rules applied. Total rules applied 991 place count 558 transition count 1148
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 11 with 25 rules applied. Total rules applied 1016 place count 543 transition count 1148
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1021 place count 538 transition count 1143
Iterating global reduction 11 with 5 rules applied. Total rules applied 1026 place count 538 transition count 1143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 1031 place count 538 transition count 1138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1035 place count 536 transition count 1136
Applied a total of 1035 rules in 402 ms. Remains 536 /1072 variables (removed 536) and now considering 1136/1620 (removed 484) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 536/1072 places, 1136/1620 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Finished probabilistic random walk after 229545 steps, run visited all 4 properties in 1237 ms. (steps per millisecond=185 )
Probabilistic random walk after 229545 steps, saw 67463 distinct states, run finished after 1237 ms. (steps per millisecond=185 ) properties seen :4
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1072 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1072/1072 places, 1620/1620 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1069 transition count 1607
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1069 transition count 1607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 1069 transition count 1606
Applied a total of 7 rules in 125 ms. Remains 1069 /1072 variables (removed 3) and now considering 1606/1620 (removed 14) transitions.
// Phase 1: matrix 1606 rows 1069 cols
[2023-03-10 23:30:03] [INFO ] Computed 145 place invariants in 25 ms
[2023-03-10 23:30:04] [INFO ] Implicit Places using invariants in 730 ms returned [29, 754, 954]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 744 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1066/1072 places, 1606/1620 transitions.
Applied a total of 0 rules in 24 ms. Remains 1066 /1066 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 905 ms. Remains : 1066/1072 places, 1606/1620 transitions.
Stuttering acceptance computed with spot in 379 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-04 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:(OR (EQ s850 0) (EQ s995 1))], 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 17 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-05a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-04 finished in 1421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1))&&(F(p2)||X(p3)))))'
Support contains 6 out of 1072 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1072/1072 places, 1620/1620 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1070 transition count 1618
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1070 transition count 1618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 1070 transition count 1617
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1069 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1069 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1068 transition count 1615
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1068 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1067 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1067 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1066 transition count 1613
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1066 transition count 1613
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1065 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1065 transition count 1612
Applied a total of 15 rules in 295 ms. Remains 1065 /1072 variables (removed 7) and now considering 1612/1620 (removed 8) transitions.
// Phase 1: matrix 1612 rows 1065 cols
[2023-03-10 23:30:04] [INFO ] Computed 145 place invariants in 12 ms
[2023-03-10 23:30:05] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-10 23:30:05] [INFO ] Invariant cache hit.
[2023-03-10 23:30:07] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
[2023-03-10 23:30:07] [INFO ] Invariant cache hit.
[2023-03-10 23:30:08] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1065/1072 places, 1612/1620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4224 ms. Remains : 1065/1072 places, 1612/1620 transitions.
Stuttering acceptance computed with spot in 470 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s956 0) (EQ s77 1)), p1:(OR (EQ s30 0) (EQ s755 1)), p2:(OR (EQ s867 0) (EQ s825 1)), p3:(OR (EQ s77 0) (EQ s956 1))], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 607 reset in 504 ms.
Product exploration explored 100000 steps with 606 reset in 450 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (AND (NOT p0) p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 479 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 60 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 321919 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 321919 steps, saw 119858 distinct states, run finished after 3005 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 23:30:13] [INFO ] Invariant cache hit.
[2023-03-10 23:30:14] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:30:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2023-03-10 23:30:14] [INFO ] [Nat]Absence check using 33 positive and 112 generalized place invariants in 71 ms returned sat
[2023-03-10 23:30:15] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:30:15] [INFO ] After 1304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-10 23:30:15] [INFO ] After 1773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1065/1065 places, 1612/1612 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1065 transition count 1418
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 388 place count 871 transition count 1418
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 142 Pre rules applied. Total rules applied 388 place count 871 transition count 1276
Deduced a syphon composed of 142 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 2 with 329 rules applied. Total rules applied 717 place count 684 transition count 1276
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 16 rules applied. Total rules applied 733 place count 677 transition count 1267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 742 place count 668 transition count 1267
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 742 place count 668 transition count 1247
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 782 place count 648 transition count 1247
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 786 place count 644 transition count 1243
Iterating global reduction 4 with 4 rules applied. Total rules applied 790 place count 644 transition count 1243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 794 place count 644 transition count 1239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 795 place count 643 transition count 1239
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 6 with 115 rules applied. Total rules applied 910 place count 585 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 911 place count 584 transition count 1181
Iterating global reduction 6 with 1 rules applied. Total rules applied 912 place count 584 transition count 1181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 912 place count 584 transition count 1180
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 914 place count 583 transition count 1180
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 917 place count 583 transition count 1177
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 920 place count 580 transition count 1177
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 938 place count 580 transition count 1159
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 957 place count 561 transition count 1159
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 960 place count 561 transition count 1156
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 976 place count 561 transition count 1156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 977 place count 560 transition count 1155
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 982 place count 555 transition count 1155
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 982 place count 555 transition count 1145
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 25 rules applied. Total rules applied 1007 place count 540 transition count 1145
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1012 place count 535 transition count 1140
Iterating global reduction 9 with 5 rules applied. Total rules applied 1017 place count 535 transition count 1140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1022 place count 535 transition count 1135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1026 place count 533 transition count 1133
Applied a total of 1026 rules in 312 ms. Remains 533 /1065 variables (removed 532) and now considering 1133/1612 (removed 479) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 533/1065 places, 1133/1612 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 229523 steps, run visited all 1 properties in 1221 ms. (steps per millisecond=187 )
Probabilistic random walk after 229523 steps, saw 67446 distinct states, run finished after 1221 ms. (steps per millisecond=187 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (AND (NOT p0) p1)), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 411 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1065 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1065/1065 places, 1612/1612 transitions.
Applied a total of 0 rules in 58 ms. Remains 1065 /1065 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2023-03-10 23:30:18] [INFO ] Invariant cache hit.
[2023-03-10 23:30:19] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2023-03-10 23:30:19] [INFO ] Invariant cache hit.
[2023-03-10 23:30:21] [INFO ] Implicit Places using invariants and state equation in 2401 ms returned []
Implicit Place search using SMT with State Equation took 3467 ms to find 0 implicit places.
[2023-03-10 23:30:21] [INFO ] Invariant cache hit.
[2023-03-10 23:30:22] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4451 ms. Remains : 1065/1065 places, 1612/1612 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 61 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 343601 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343601 steps, saw 127388 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 23:30:26] [INFO ] Invariant cache hit.
[2023-03-10 23:30:26] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 23:30:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2023-03-10 23:30:26] [INFO ] [Nat]Absence check using 33 positive and 112 generalized place invariants in 55 ms returned sat
[2023-03-10 23:30:27] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 23:30:27] [INFO ] After 943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-10 23:30:27] [INFO ] After 1389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1065/1065 places, 1612/1612 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1065 transition count 1418
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 388 place count 871 transition count 1418
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 142 Pre rules applied. Total rules applied 388 place count 871 transition count 1276
Deduced a syphon composed of 142 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 2 with 329 rules applied. Total rules applied 717 place count 684 transition count 1276
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 16 rules applied. Total rules applied 733 place count 677 transition count 1267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 742 place count 668 transition count 1267
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 742 place count 668 transition count 1247
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 782 place count 648 transition count 1247
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 786 place count 644 transition count 1243
Iterating global reduction 4 with 4 rules applied. Total rules applied 790 place count 644 transition count 1243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 794 place count 644 transition count 1239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 795 place count 643 transition count 1239
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 6 with 115 rules applied. Total rules applied 910 place count 585 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 911 place count 584 transition count 1181
Iterating global reduction 6 with 1 rules applied. Total rules applied 912 place count 584 transition count 1181
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 912 place count 584 transition count 1180
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 914 place count 583 transition count 1180
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 917 place count 583 transition count 1177
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 920 place count 580 transition count 1177
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 938 place count 580 transition count 1159
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 957 place count 561 transition count 1159
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 960 place count 561 transition count 1156
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 976 place count 561 transition count 1156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 977 place count 560 transition count 1155
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 982 place count 555 transition count 1155
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 982 place count 555 transition count 1145
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 9 with 25 rules applied. Total rules applied 1007 place count 540 transition count 1145
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1012 place count 535 transition count 1140
Iterating global reduction 9 with 5 rules applied. Total rules applied 1017 place count 535 transition count 1140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1022 place count 535 transition count 1135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1026 place count 533 transition count 1133
Applied a total of 1026 rules in 323 ms. Remains 533 /1065 variables (removed 532) and now considering 1133/1612 (removed 479) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 533/1065 places, 1133/1612 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 229523 steps, run visited all 1 properties in 1239 ms. (steps per millisecond=185 )
Probabilistic random walk after 229523 steps, saw 67446 distinct states, run finished after 1240 ms. (steps per millisecond=185 ) properties seen :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 429 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 599 reset in 318 ms.
Product exploration explored 100000 steps with 632 reset in 326 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1065/1065 places, 1612/1612 transitions.
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1065 transition count 1612
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 76 Pre rules applied. Total rules applied 193 place count 1065 transition count 1637
Deduced a syphon composed of 269 places in 3 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 269 place count 1065 transition count 1637
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 275 place count 1062 transition count 1637
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 300 place count 1037 transition count 1612
Deduced a syphon composed of 248 places in 2 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 325 place count 1037 transition count 1612
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 325 place count 1037 transition count 1612
Deduced a syphon composed of 249 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 1037 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 1036 transition count 1611
Deduced a syphon composed of 248 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 1036 transition count 1611
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 383 places in 1 ms
Iterating global reduction 2 with 135 rules applied. Total rules applied 463 place count 1036 transition count 1629
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 533 place count 966 transition count 1559
Deduced a syphon composed of 314 places in 1 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 603 place count 966 transition count 1559
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 609 place count 966 transition count 1595
Deduced a syphon composed of 320 places in 2 ms
Applied a total of 609 rules in 522 ms. Remains 966 /1065 variables (removed 99) and now considering 1595/1612 (removed 17) transitions.
[2023-03-10 23:30:32] [INFO ] Redundant transitions in 110 ms returned []
// Phase 1: matrix 1595 rows 966 cols
[2023-03-10 23:30:32] [INFO ] Computed 142 place invariants in 28 ms
[2023-03-10 23:30:32] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 966/1065 places, 1595/1612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1407 ms. Remains : 966/1065 places, 1595/1612 transitions.
Built C files in :
/tmp/ltsmin16276628333790087490
[2023-03-10 23:30:32] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16276628333790087490
Running compilation step : cd /tmp/ltsmin16276628333790087490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16276628333790087490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16276628333790087490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1065 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1065/1065 places, 1612/1612 transitions.
Applied a total of 0 rules in 52 ms. Remains 1065 /1065 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
// Phase 1: matrix 1612 rows 1065 cols
[2023-03-10 23:30:36] [INFO ] Computed 145 place invariants in 12 ms
[2023-03-10 23:30:36] [INFO ] Implicit Places using invariants in 693 ms returned [956]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 694 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1064/1065 places, 1612/1612 transitions.
Applied a total of 0 rules in 33 ms. Remains 1064 /1064 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 791 ms. Remains : 1064/1065 places, 1612/1612 transitions.
Built C files in :
/tmp/ltsmin1669429222769804699
[2023-03-10 23:30:36] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1669429222769804699
Running compilation step : cd /tmp/ltsmin1669429222769804699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2885 ms.
Running link step : cd /tmp/ltsmin1669429222769804699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 99 ms.
Running LTSmin : cd /tmp/ltsmin1669429222769804699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4662399797265297493.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 23:30:52] [INFO ] Flatten gal took : 71 ms
[2023-03-10 23:30:52] [INFO ] Flatten gal took : 69 ms
[2023-03-10 23:30:52] [INFO ] Time to serialize gal into /tmp/LTL8859867486260275079.gal : 27 ms
[2023-03-10 23:30:52] [INFO ] Time to serialize properties into /tmp/LTL2588669583583103620.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8859867486260275079.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7291432873127105699.hoa' '-atoms' '/tmp/LTL2588669583583103620.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2588669583583103620.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7291432873127105699.hoa
Detected timeout of ITS tools.
[2023-03-10 23:31:07] [INFO ] Flatten gal took : 83 ms
[2023-03-10 23:31:07] [INFO ] Flatten gal took : 58 ms
[2023-03-10 23:31:07] [INFO ] Time to serialize gal into /tmp/LTL13086530492862604072.gal : 9 ms
[2023-03-10 23:31:07] [INFO ] Time to serialize properties into /tmp/LTL1560579071171588937.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13086530492862604072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1560579071171588937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((G("((p36==0)||(p814==1))"))||("((p1046==0)&&(p85==1))"))&&((F("((p930==0)||(p888==1))"))||(X("((p85==0)||(p1046==1))"))))))
Formula 0 simplified : X((!"((p1046==0)&&(p85==1))" & F!"((p36==0)||(p814==1))") | (G!"((p930==0)||(p888==1))" & X!"((p85==0)||(p1046==1))"))
Detected timeout of ITS tools.
[2023-03-10 23:31:22] [INFO ] Flatten gal took : 55 ms
[2023-03-10 23:31:22] [INFO ] Applying decomposition
[2023-03-10 23:31:22] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7486844348579977032.txt' '-o' '/tmp/graph7486844348579977032.bin' '-w' '/tmp/graph7486844348579977032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7486844348579977032.bin' '-l' '-1' '-v' '-w' '/tmp/graph7486844348579977032.weights' '-q' '0' '-e' '0.001'
[2023-03-10 23:31:23] [INFO ] Decomposing Gal with order
[2023-03-10 23:31:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:31:23] [INFO ] Removed a total of 2210 redundant transitions.
[2023-03-10 23:31:23] [INFO ] Flatten gal took : 303 ms
[2023-03-10 23:31:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 74 ms.
[2023-03-10 23:31:23] [INFO ] Time to serialize gal into /tmp/LTL4348253234351824449.gal : 29 ms
[2023-03-10 23:31:23] [INFO ] Time to serialize properties into /tmp/LTL16434276140495079475.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4348253234351824449.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16434276140495079475.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(((G("((i3.u19.p36==0)||(i11.u232.p814==1))"))||("((i15.u287.p1046==0)&&(i1.u25.p85==1))"))&&((F("((i13.u258.p930==0)||(i11.u232.p...217
Formula 0 simplified : X((!"((i15.u287.p1046==0)&&(i1.u25.p85==1))" & F!"((i3.u19.p36==0)||(i11.u232.p814==1))") | (G!"((i13.u258.p930==0)||(i11.u232.p888=...207
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6614672948424845436
[2023-03-10 23:31:38] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6614672948424845436
Running compilation step : cd /tmp/ltsmin6614672948424845436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2926 ms.
Running link step : cd /tmp/ltsmin6614672948424845436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6614672948424845436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((([]((LTLAPp0==true))||(LTLAPp1==true))&&(<>((LTLAPp2==true))||X((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-05a-LTLCardinality-08 finished in 109573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1072 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1072/1072 places, 1620/1620 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1071 transition count 1424
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 203 rules applied. Total rules applied 398 place count 871 transition count 1421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 401 place count 868 transition count 1421
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 401 place count 868 transition count 1267
Deduced a syphon composed of 154 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 353 rules applied. Total rules applied 754 place count 669 transition count 1267
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 3 with 32 rules applied. Total rules applied 786 place count 656 transition count 1248
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 805 place count 637 transition count 1248
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 805 place count 637 transition count 1227
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 847 place count 616 transition count 1227
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 858 place count 605 transition count 1206
Iterating global reduction 5 with 11 rules applied. Total rules applied 869 place count 605 transition count 1206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 11 rules applied. Total rules applied 880 place count 603 transition count 1197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 881 place count 602 transition count 1197
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 882 place count 601 transition count 1196
Iterating global reduction 7 with 1 rules applied. Total rules applied 883 place count 601 transition count 1196
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 884 place count 601 transition count 1195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 885 place count 600 transition count 1195
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 9 with 111 rules applied. Total rules applied 996 place count 544 transition count 1140
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1000 place count 540 transition count 1136
Iterating global reduction 9 with 4 rules applied. Total rules applied 1004 place count 540 transition count 1136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1004 place count 540 transition count 1135
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1006 place count 539 transition count 1135
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1007 place count 539 transition count 1135
Applied a total of 1007 rules in 190 ms. Remains 539 /1072 variables (removed 533) and now considering 1135/1620 (removed 485) transitions.
// Phase 1: matrix 1135 rows 539 cols
[2023-03-10 23:31:54] [INFO ] Computed 79 place invariants in 8 ms
[2023-03-10 23:31:54] [INFO ] Implicit Places using invariants in 371 ms returned [23, 76, 97, 103, 108, 167, 184, 190, 195, 197, 257, 274, 280, 285, 287, 347, 364, 370, 375, 377, 386, 439, 460, 466, 471, 473, 536]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 378 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 512/1072 places, 1135/1620 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 512 transition count 1126
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 503 transition count 1126
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 28 place count 493 transition count 1116
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 493 transition count 1116
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 48 place count 483 transition count 1106
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 483 transition count 1106
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 478 transition count 1101
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 478 transition count 1101
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 92 place count 466 transition count 1089
Applied a total of 92 rules in 64 ms. Remains 466 /512 variables (removed 46) and now considering 1089/1135 (removed 46) transitions.
// Phase 1: matrix 1089 rows 466 cols
[2023-03-10 23:31:54] [INFO ] Computed 52 place invariants in 9 ms
[2023-03-10 23:31:54] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-10 23:31:54] [INFO ] Invariant cache hit.
[2023-03-10 23:31:56] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 466/1072 places, 1089/1620 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2168 ms. Remains : 466/1072 places, 1089/1620 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s18 0) (EQ s301 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLCardinality-13 finished in 2266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1))&&(F(p2)||X(p3)))))'
[2023-03-10 23:31:56] [INFO ] Flatten gal took : 108 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8847205797504809975
[2023-03-10 23:31:56] [INFO ] Too many transitions (1620) to apply POR reductions. Disabling POR matrices.
[2023-03-10 23:31:56] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8847205797504809975
Running compilation step : cd /tmp/ltsmin8847205797504809975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-10 23:31:56] [INFO ] Applying decomposition
[2023-03-10 23:31:56] [INFO ] Flatten gal took : 106 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4372199682606875934.txt' '-o' '/tmp/graph4372199682606875934.bin' '-w' '/tmp/graph4372199682606875934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4372199682606875934.bin' '-l' '-1' '-v' '-w' '/tmp/graph4372199682606875934.weights' '-q' '0' '-e' '0.001'
[2023-03-10 23:31:56] [INFO ] Decomposing Gal with order
[2023-03-10 23:31:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:31:57] [INFO ] Removed a total of 2153 redundant transitions.
[2023-03-10 23:31:57] [INFO ] Flatten gal took : 84 ms
[2023-03-10 23:31:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 21 ms.
[2023-03-10 23:31:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality1325349661794650236.gal : 11 ms
[2023-03-10 23:31:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality14157898386819392585.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1325349661794650236.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14157898386819392585.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((("((i15.u282.p1046==0)&&(i0.u23.p85==1))")||(G("((i3.u18.p36==0)||(i14.u229.p814==1))")))&&((F("((i13.u253.p930==0)||(i14.u229.p...217
Formula 0 simplified : X((!"((i15.u282.p1046==0)&&(i0.u23.p85==1))" & F!"((i3.u18.p36==0)||(i14.u229.p814==1))") | (G!"((i13.u253.p930==0)||(i14.u229.p888=...207
Compilation finished in 3003 ms.
Running link step : cd /tmp/ltsmin8847205797504809975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin8847205797504809975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)||[]((LTLAPp1==true)))&&(<>((LTLAPp2==true))||X((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-10 23:52:47] [INFO ] Applying decomposition
[2023-03-10 23:52:47] [INFO ] Flatten gal took : 189 ms
[2023-03-10 23:52:47] [INFO ] Decomposing Gal with order
[2023-03-10 23:52:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:52:48] [INFO ] Removed a total of 1827 redundant transitions.
[2023-03-10 23:52:48] [INFO ] Flatten gal took : 229 ms
[2023-03-10 23:52:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 683 labels/synchronizations in 86 ms.
[2023-03-10 23:52:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality3252387627291981731.gal : 31 ms
[2023-03-10 23:52:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality2862314454915751728.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3252387627291981731.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2862314454915751728.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((("((u180.p1046==0)&&(u6.p85==1))")||(G("((u4.p36==0)||(u144.p814==1))")))&&((F("((i37.u158.p930==0)||(i37.i1.u249.p888==1))"))||...196
Formula 0 simplified : X((!"((u180.p1046==0)&&(u6.p85==1))" & F!"((u4.p36==0)||(u144.p814==1))") | (G!"((i37.u158.p930==0)||(i37.i1.u249.p888==1))" & X!"((...186
Reverse transition relation is NOT exact ! Due to transitions t1008, t1185, t1192, t1196, t1201, t1213, t1222, t1254, t1277, t1279, t1304, t1357, t1380, t1...852
Computing Next relation with stutter on 4.08317e+13 deadlock states
Detected timeout of ITS tools.
[2023-03-11 00:13:39] [INFO ] Flatten gal took : 135 ms
[2023-03-11 00:13:39] [INFO ] Input system was already deterministic with 1620 transitions.
[2023-03-11 00:13:39] [INFO ] Transformed 1072 places.
[2023-03-11 00:13:39] [INFO ] Transformed 1620 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 00:14:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality13117697767170682686.gal : 31 ms
[2023-03-11 00:14:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality15712201299728470083.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13117697767170682686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15712201299728470083.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((("((p1046==0)&&(p85==1))")||(G("((p36==0)||(p814==1))")))&&((F("((p930==0)||(p888==1))"))||(X("((p85==0)||(p1046==1))"))))))
Formula 0 simplified : X((!"((p1046==0)&&(p85==1))" & F!"((p36==0)||(p814==1))") | (G!"((p930==0)||(p888==1))" & X!"((p85==0)||(p1046==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6700388 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16037252 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-05a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813592600075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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