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.r105-tall-167814481200474.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DES-PT-50a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481200474
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 97K 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 DES-PT-50a-CTLFireability-00
FORMULA_NAME DES-PT-50a-CTLFireability-01
FORMULA_NAME DES-PT-50a-CTLFireability-02
FORMULA_NAME DES-PT-50a-CTLFireability-03
FORMULA_NAME DES-PT-50a-CTLFireability-04
FORMULA_NAME DES-PT-50a-CTLFireability-05
FORMULA_NAME DES-PT-50a-CTLFireability-06
FORMULA_NAME DES-PT-50a-CTLFireability-07
FORMULA_NAME DES-PT-50a-CTLFireability-08
FORMULA_NAME DES-PT-50a-CTLFireability-09
FORMULA_NAME DES-PT-50a-CTLFireability-10
FORMULA_NAME DES-PT-50a-CTLFireability-11
FORMULA_NAME DES-PT-50a-CTLFireability-12
FORMULA_NAME DES-PT-50a-CTLFireability-13
FORMULA_NAME DES-PT-50a-CTLFireability-14
FORMULA_NAME DES-PT-50a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678307812352

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 20:36:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 20:36:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:36:54] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-08 20:36:54] [INFO ] Transformed 314 places.
[2023-03-08 20:36:54] [INFO ] Transformed 271 transitions.
[2023-03-08 20:36:54] [INFO ] Found NUPN structural information;
[2023-03-08 20:36:54] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 133 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 31 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2023-03-08 20:36:54] [INFO ] Computed 59 place invariants in 26 ms
[2023-03-08 20:36:54] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-08 20:36:54] [INFO ] Invariant cache hit.
[2023-03-08 20:36:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 20:36:55] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2023-03-08 20:36:55] [INFO ] Invariant cache hit.
[2023-03-08 20:36:55] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1111 ms. Remains : 314/314 places, 257/257 transitions.
Support contains 133 out of 314 places after structural reductions.
[2023-03-08 20:36:55] [INFO ] Flatten gal took : 56 ms
[2023-03-08 20:36:55] [INFO ] Flatten gal took : 28 ms
[2023-03-08 20:36:55] [INFO ] Input system was already deterministic with 257 transitions.
Incomplete random walk after 10000 steps, including 221 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 90) seen :25
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 65) seen :0
Running SMT prover for 65 properties.
[2023-03-08 20:36:56] [INFO ] Invariant cache hit.
[2023-03-08 20:36:57] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 20:36:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 20:36:57] [INFO ] After 679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:65
[2023-03-08 20:36:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 20:36:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 88 ms returned sat
[2023-03-08 20:37:22] [INFO ] After 22950ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :63
[2023-03-08 20:37:22] [INFO ] State equation strengthened by 1 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.Application.startNoEx(Application.java:626)
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-08 20:37:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 20:37:22] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:65
Fused 65 Parikh solutions to 33 different solutions.
Parikh walk visited 46 properties in 1912 ms.
Support contains 32 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 313 transition count 254
Applied a total of 8 rules in 71 ms. Remains 313 /314 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 313/314 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 549346 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 549346 steps, saw 78862 distinct states, run finished after 3005 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 254 rows 313 cols
[2023-03-08 20:37:28] [INFO ] Computed 61 place invariants in 12 ms
[2023-03-08 20:37:28] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-08 20:37:28] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-08 20:37:28] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-08 20:37:28] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-08 20:37:28] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 190 ms returned sat
[2023-03-08 20:37:30] [INFO ] After 1261ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :15
[2023-03-08 20:37:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:37:31] [INFO ] After 1227ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :3 sat :15
[2023-03-08 20:37:31] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
[2023-03-08 20:37:31] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2023-03-08 20:37:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-03-08 20:37:32] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-08 20:37:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-08 20:37:33] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2023-03-08 20:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-08 20:37:33] [INFO ] After 2999ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :15
Attempting to minimize the solution found.
Minimization took 821 ms.
[2023-03-08 20:37:33] [INFO ] After 5608ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :15
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 1093 ms.
Support contains 25 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 27 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 313/313 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 593890 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 593890 steps, saw 85466 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-08 20:37:38] [INFO ] Invariant cache hit.
[2023-03-08 20:37:38] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 20:37:38] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-08 20:37:38] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-08 20:37:38] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 20:37:38] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 80 ms returned sat
[2023-03-08 20:37:39] [INFO ] After 830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-08 20:37:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:37:40] [INFO ] After 689ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-08 20:37:41] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2023-03-08 20:37:41] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-08 20:37:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2023-03-08 20:37:41] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-08 20:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-08 20:37:41] [INFO ] After 1648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 853 ms.
[2023-03-08 20:37:42] [INFO ] After 3717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 6 properties in 935 ms.
Support contains 19 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 313/313 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 11 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 20:37:43] [INFO ] Invariant cache hit.
[2023-03-08 20:37:43] [INFO ] Implicit Places using invariants in 170 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 312/313 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 194 ms. Remains : 312/313 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 634770 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634770 steps, saw 91375 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 20:37:47] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 20:37:47] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 20:37:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-08 20:37:47] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 20:37:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 20:37:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 193 ms returned sat
[2023-03-08 20:37:48] [INFO ] After 904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 20:37:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 20:37:49] [INFO ] After 483ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-08 20:37:49] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2023-03-08 20:37:49] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-08 20:37:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-08 20:37:50] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
[2023-03-08 20:37:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 20:37:50] [INFO ] After 1808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 575 ms.
[2023-03-08 20:37:51] [INFO ] After 3876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 435 ms.
Support contains 17 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 20 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 20:37:51] [INFO ] Invariant cache hit.
[2023-03-08 20:37:52] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 20:37:52] [INFO ] Invariant cache hit.
[2023-03-08 20:37:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 20:37:52] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-08 20:37:52] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 20:37:52] [INFO ] Invariant cache hit.
[2023-03-08 20:37:52] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 717 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-08 20:37:52] [INFO ] Invariant cache hit.
[2023-03-08 20:37:52] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 20:37:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-08 20:37:52] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 20:37:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 20:37:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-08 20:37:53] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 20:37:53] [INFO ] After 804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 402 ms.
[2023-03-08 20:37:54] [INFO ] After 1404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 22 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 25 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 123 out of 314 places (down from 125) after GAL structural reductions.
Computed a total of 217 stabilizing places and 211 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 18 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 20 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 20 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 6 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 19 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 20 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 3 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 314/314 places, 257/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 19 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 20 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 6 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 15 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 16 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 17 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 15 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 16 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 6 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 13 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 18 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 6 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 13 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 13 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 9 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 12 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 14 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 6 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 12 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 13 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 7 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 13 ms
[2023-03-08 20:37:54] [INFO ] Flatten gal took : 13 ms
[2023-03-08 20:37:54] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 5 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 12 ms
[2023-03-08 20:37:55] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 14 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:37:55] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 15 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 12 ms
[2023-03-08 20:37:55] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 14 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 313/314 places, 256/257 transitions.
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 10 ms
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:37:55] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 311 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 311 transition count 255
Applied a total of 3 rules in 16 ms. Remains 311 /314 variables (removed 3) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 311/314 places, 255/257 transitions.
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 10 ms
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:37:55] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 9 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 314/314 places, 257/257 transitions.
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 10 ms
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:37:55] [INFO ] Input system was already deterministic with 257 transitions.
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 12 ms
[2023-03-08 20:37:55] [INFO ] Flatten gal took : 12 ms
[2023-03-08 20:37:55] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-08 20:37:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 314 places, 257 transitions and 1242 arcs took 2 ms.
Total runtime 61326 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/554/ctl_0_ --ctl=/tmp/554/ctl_1_ --ctl=/tmp/554/ctl_2_ --ctl=/tmp/554/ctl_3_ --ctl=/tmp/554/ctl_4_ --ctl=/tmp/554/ctl_5_ --ctl=/tmp/554/ctl_6_ --ctl=/tmp/554/ctl_7_ --ctl=/tmp/554/ctl_8_ --ctl=/tmp/554/ctl_9_ --ctl=/tmp/554/ctl_10_ --ctl=/tmp/554/ctl_11_ --ctl=/tmp/554/ctl_12_ --ctl=/tmp/554/ctl_13_ --ctl=/tmp/554/ctl_14_ --ctl=/tmp/554/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15952288 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099296 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="DES-PT-50a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DES-PT-50a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481200474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;