About the Execution of Marcie+red for JoinFreeModules-PT-1000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 427710.00 | 0.00 | 0.00 | ???TF???????F??? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420000209.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 marciexred
Input is JoinFreeModules-PT-1000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000209
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 JoinFreeModules-PT-1000-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-1000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679461610125
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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-1000
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 05:06:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 05:06:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:06:51] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2023-03-22 05:06:52] [INFO ] Transformed 5001 places.
[2023-03-22 05:06:52] [INFO ] Transformed 8001 transitions.
[2023-03-22 05:06:52] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 2 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-1000-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 115 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 475 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-22 05:06:52] [INFO ] Computed 1000 place invariants in 67 ms
[2023-03-22 05:06:57] [INFO ] Dead Transitions using invariants and state equation in 4847 ms found 0 transitions.
[2023-03-22 05:06:57] [INFO ] Invariant cache hit.
[2023-03-22 05:06:58] [INFO ] Implicit Places using invariants in 906 ms returned []
[2023-03-22 05:06:58] [INFO ] Invariant cache hit.
[2023-03-22 05:06:59] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2023-03-22 05:06:59] [INFO ] Invariant cache hit.
[2023-03-22 05:07:04] [INFO ] Dead Transitions using invariants and state equation in 4876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11861 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Support contains 115 out of 5000 places after structural reductions.
[2023-03-22 05:07:04] [INFO ] Flatten gal took : 358 ms
[2023-03-22 05:07:04] [INFO ] Flatten gal took : 218 ms
[2023-03-22 05:07:05] [INFO ] Input system was already deterministic with 8001 transitions.
Incomplete random walk after 10514 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=22 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 92 ms. (steps per millisecond=10 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 65) seen :0
Probabilistic random walk after 56103 steps, saw 56062 distinct states, run finished after 6057 ms. (steps per millisecond=9 ) properties seen :9
Running SMT prover for 56 properties.
[2023-03-22 05:07:14] [INFO ] Invariant cache hit.
[2023-03-22 05:07:18] [INFO ] [Real]Absence check using 1000 positive place invariants in 248 ms returned sat
[2023-03-22 05:07:18] [INFO ] After 4628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:56
[2023-03-22 05:07:23] [INFO ] [Nat]Absence check using 1000 positive place invariants in 241 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-22 05:07:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 05:07:44] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:56
Fused 56 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 85 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 420 are kept as prefixes of interest. Removing 4580 places using SCC suffix rule.12 ms
Discarding 4580 places :
Also discarding 7328 output transitions
Drop transitions removed 7328 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 672
Applied a total of 2 rules in 67 ms. Remains 420 /5000 variables (removed 4580) and now considering 672/8001 (removed 7329) transitions.
// Phase 1: matrix 672 rows 420 cols
[2023-03-22 05:07:44] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-22 05:07:44] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 420/5000 places, 672/8001 transitions.
Incomplete random walk after 10516 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=300 ) properties (out of 56) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Running SMT prover for 45 properties.
[2023-03-22 05:07:44] [INFO ] Invariant cache hit.
[2023-03-22 05:07:44] [INFO ] [Real]Absence check using 84 positive place invariants in 13 ms returned sat
[2023-03-22 05:07:45] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:45
[2023-03-22 05:07:45] [INFO ] [Nat]Absence check using 84 positive place invariants in 12 ms returned sat
[2023-03-22 05:07:47] [INFO ] After 1794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :45
[2023-03-22 05:07:47] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-22 05:07:49] [INFO ] After 2016ms SMT Verify possible using 84 Read/Feed constraints in natural domain returned unsat :0 sat :45
[2023-03-22 05:07:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
[2023-03-22 05:07:49] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2023-03-22 05:07:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:07:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2023-03-22 05:07:52] [INFO ] After 4653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :45
Attempting to minimize the solution found.
Minimization took 1743 ms.
[2023-03-22 05:07:53] [INFO ] After 8781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :45
Parikh walk visited 22 properties in 31778 ms.
Support contains 35 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 672/672 transitions.
Graph (complete) has 1008 edges and 420 vertex of which 175 are kept as prefixes of interest. Removing 245 places using SCC suffix rule.1 ms
Discarding 245 places :
Also discarding 392 output transitions
Drop transitions removed 392 transitions
Applied a total of 1 rules in 11 ms. Remains 175 /420 variables (removed 245) and now considering 280/672 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 175/420 places, 280/672 transitions.
Incomplete random walk after 10518 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=657 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 134256 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{3=1}
Probabilistic random walk after 134256 steps, saw 131465 distinct states, run finished after 3003 ms. (steps per millisecond=44 ) properties seen :1
Running SMT prover for 20 properties.
// Phase 1: matrix 280 rows 175 cols
[2023-03-22 05:08:28] [INFO ] Computed 35 place invariants in 3 ms
[2023-03-22 05:08:28] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-22 05:08:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-22 05:08:29] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-22 05:08:29] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-22 05:08:29] [INFO ] After 398ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-03-22 05:08:29] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 5 ms to minimize.
[2023-03-22 05:08:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:08:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-22 05:08:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 29 ms to minimize.
[2023-03-22 05:08:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-22 05:08:30] [INFO ] After 1182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 547 ms.
[2023-03-22 05:08:31] [INFO ] After 2334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Finished Parikh walk after 15943 steps, including 0 resets, run visited all 1 properties in 52 ms. (steps per millisecond=306 )
Parikh walk visited 20 properties in 11560 ms.
[2023-03-22 05:08:42] [INFO ] Flatten gal took : 163 ms
[2023-03-22 05:08:43] [INFO ] Flatten gal took : 164 ms
[2023-03-22 05:08:43] [INFO ] Input system was already deterministic with 8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 263 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-22 05:08:43] [INFO ] Computed 1000 place invariants in 21 ms
[2023-03-22 05:08:48] [INFO ] Dead Transitions using invariants and state equation in 4566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4840 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:08:48] [INFO ] Flatten gal took : 144 ms
[2023-03-22 05:08:48] [INFO ] Flatten gal took : 149 ms
[2023-03-22 05:08:49] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 258 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:08:49] [INFO ] Invariant cache hit.
[2023-03-22 05:08:53] [INFO ] Dead Transitions using invariants and state equation in 4556 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4815 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:08:54] [INFO ] Flatten gal took : 140 ms
[2023-03-22 05:08:54] [INFO ] Flatten gal took : 165 ms
[2023-03-22 05:08:54] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 199 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:08:54] [INFO ] Invariant cache hit.
[2023-03-22 05:08:59] [INFO ] Dead Transitions using invariants and state equation in 4433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4652 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:08:59] [INFO ] Flatten gal took : 144 ms
[2023-03-22 05:08:59] [INFO ] Flatten gal took : 143 ms
[2023-03-22 05:08:59] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 789 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:09:00] [INFO ] Invariant cache hit.
[2023-03-22 05:09:04] [INFO ] Dead Transitions using invariants and state equation in 4272 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5067 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:09:05] [INFO ] Flatten gal took : 131 ms
[2023-03-22 05:09:05] [INFO ] Flatten gal took : 142 ms
[2023-03-22 05:09:05] [INFO ] Input system was already deterministic with 8001 transitions.
Incomplete random walk after 10516 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Probabilistic random walk after 47084 steps, saw 47049 distinct states, run finished after 3049 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:09:09] [INFO ] Invariant cache hit.
[2023-03-22 05:09:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 227 ms returned sat
[2023-03-22 05:09:14] [INFO ] After 4661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:09:14] [INFO ] [Nat]Absence check using 1000 positive place invariants in 234 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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.Application.startNoEx(Application.java:669)
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-22 05:09:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 05:09:39] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 5 are kept as prefixes of interest. Removing 4995 places using SCC suffix rule.16 ms
Discarding 4995 places :
Also discarding 7992 output transitions
Drop transitions removed 7992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 46 ms. Remains 5 /5000 variables (removed 4995) and now considering 8/8001 (removed 7993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 05:09:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 05:09:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 5/5000 places, 8/8001 transitions.
Finished random walk after 3764 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1254 )
FORMULA JoinFreeModules-PT-1000-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 267 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-22 05:09:39] [INFO ] Computed 1000 place invariants in 18 ms
[2023-03-22 05:09:44] [INFO ] Dead Transitions using invariants and state equation in 4739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5009 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:09:44] [INFO ] Flatten gal took : 143 ms
[2023-03-22 05:09:44] [INFO ] Flatten gal took : 153 ms
[2023-03-22 05:09:44] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 194 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:09:45] [INFO ] Invariant cache hit.
[2023-03-22 05:09:49] [INFO ] Dead Transitions using invariants and state equation in 4562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4766 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:09:49] [INFO ] Flatten gal took : 129 ms
[2023-03-22 05:09:50] [INFO ] Flatten gal took : 134 ms
[2023-03-22 05:09:50] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 582 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:09:50] [INFO ] Invariant cache hit.
[2023-03-22 05:09:55] [INFO ] Dead Transitions using invariants and state equation in 4375 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4967 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:09:55] [INFO ] Flatten gal took : 129 ms
[2023-03-22 05:09:55] [INFO ] Flatten gal took : 137 ms
[2023-03-22 05:09:55] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 206 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:09:56] [INFO ] Invariant cache hit.
[2023-03-22 05:10:00] [INFO ] Dead Transitions using invariants and state equation in 4519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4731 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:10:00] [INFO ] Flatten gal took : 133 ms
[2023-03-22 05:10:00] [INFO ] Flatten gal took : 139 ms
[2023-03-22 05:10:01] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 198 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:10:01] [INFO ] Invariant cache hit.
[2023-03-22 05:10:05] [INFO ] Dead Transitions using invariants and state equation in 4489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4688 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:10:06] [INFO ] Flatten gal took : 146 ms
[2023-03-22 05:10:06] [INFO ] Flatten gal took : 154 ms
[2023-03-22 05:10:06] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 600 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:10:07] [INFO ] Invariant cache hit.
[2023-03-22 05:10:11] [INFO ] Dead Transitions using invariants and state equation in 4585 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5193 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:10:11] [INFO ] Flatten gal took : 139 ms
[2023-03-22 05:10:12] [INFO ] Flatten gal took : 164 ms
[2023-03-22 05:10:12] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 191 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:10:12] [INFO ] Invariant cache hit.
[2023-03-22 05:10:17] [INFO ] Dead Transitions using invariants and state equation in 4667 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4859 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:10:17] [INFO ] Flatten gal took : 141 ms
[2023-03-22 05:10:17] [INFO ] Flatten gal took : 143 ms
[2023-03-22 05:10:17] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 193 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:10:18] [INFO ] Invariant cache hit.
[2023-03-22 05:10:22] [INFO ] Dead Transitions using invariants and state equation in 4689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4883 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:10:22] [INFO ] Flatten gal took : 129 ms
[2023-03-22 05:10:22] [INFO ] Flatten gal took : 137 ms
[2023-03-22 05:10:23] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 199 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:10:23] [INFO ] Invariant cache hit.
[2023-03-22 05:10:28] [INFO ] Dead Transitions using invariants and state equation in 4531 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4730 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:10:28] [INFO ] Flatten gal took : 150 ms
[2023-03-22 05:10:28] [INFO ] Flatten gal took : 164 ms
[2023-03-22 05:10:28] [INFO ] Input system was already deterministic with 8001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 221 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-22 05:10:29] [INFO ] Invariant cache hit.
[2023-03-22 05:10:33] [INFO ] Dead Transitions using invariants and state equation in 4820 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5043 ms. Remains : 5000/5000 places, 8001/8001 transitions.
[2023-03-22 05:10:33] [INFO ] Flatten gal took : 131 ms
[2023-03-22 05:10:34] [INFO ] Flatten gal took : 138 ms
[2023-03-22 05:10:34] [INFO ] Input system was already deterministic with 8001 transitions.
[2023-03-22 05:10:34] [INFO ] Flatten gal took : 133 ms
[2023-03-22 05:10:34] [INFO ] Flatten gal took : 140 ms
[2023-03-22 05:10:34] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 05:10:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 8001 transitions and 23000 arcs took 33 ms.
Total runtime 223145 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 5000 NrTr: 8001 NrArc: 23000)
parse formulas
formulas created successfully
place and transition orderings generation:0m 2.749sec
net check time: 0m 0.003sec
init dd package: 0m 2.605sec
BK_STOP 1679462037835
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.168sec
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 653 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}
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="JoinFreeModules-PT-1000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is JoinFreeModules-PT-1000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420000209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;