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.r458-smll-167912650400502.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 StigmergyCommit-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650400502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 6.4K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 11:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 38M Mar 5 18:23 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 StigmergyCommit-PT-08b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679488595302

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 12:36:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 12:36:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:36:41] [INFO ] Load time of PNML (sax parser for PT used): 2454 ms
[2023-03-22 12:36:41] [INFO ] Transformed 2746 places.
[2023-03-22 12:36:41] [INFO ] Transformed 42776 transitions.
[2023-03-22 12:36:41] [INFO ] Found NUPN structural information;
[2023-03-22 12:36:41] [INFO ] Parsed PT model containing 2746 places and 42776 transitions and 723933 arcs in 2920 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 60 resets, run finished after 1203 ms. (steps per millisecond=8 ) properties (out of 15) seen :3
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 42776 rows 2746 cols
[2023-03-22 12:36:46] [INFO ] Computed 10 place invariants in 1324 ms
[2023-03-22 12:36:49] [INFO ] After 2727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 12:36:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 40 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.verifyPossible(DeadlockTester.java:629)
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:902)
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 12:37:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 12:37:14] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 164 out of 2746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Graph (trivial) has 2425 edges and 2746 vertex of which 142 / 2746 are part of one of the 23 SCC in 36 ms
Free SCC test removed 119 places
Drop transitions removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Graph (complete) has 4721 edges and 2627 vertex of which 2611 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.303 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 1734 transitions
Trivial Post-agglo rules discarded 1734 transitions
Performed 1734 trivial Post agglomeration. Transition count delta: 1734
Iterating post reduction 0 with 1742 rules applied. Total rules applied 1744 place count 2611 transition count 40875
Reduce places removed 1734 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1763 rules applied. Total rules applied 3507 place count 877 transition count 40846
Reduce places removed 11 places and 0 transitions.
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Iterating post reduction 2 with 119 rules applied. Total rules applied 3626 place count 866 transition count 40738
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 3 with 108 rules applied. Total rules applied 3734 place count 758 transition count 40738
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 3734 place count 758 transition count 40633
Deduced a syphon composed of 105 places in 39 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 3944 place count 653 transition count 40633
Discarding 81 places :
Symmetric choice reduction at 4 with 81 rule applications. Total rules 4025 place count 572 transition count 40552
Iterating global reduction 4 with 81 rules applied. Total rules applied 4106 place count 572 transition count 40552
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 4109 place count 572 transition count 40549
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4110 place count 571 transition count 40549
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4110 place count 571 transition count 40547
Deduced a syphon composed of 2 places in 41 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4114 place count 569 transition count 40547
Discarding 34 places :
Symmetric choice reduction at 6 with 34 rule applications. Total rules 4148 place count 535 transition count 3065
Iterating global reduction 6 with 34 rules applied. Total rules applied 4182 place count 535 transition count 3065
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 4188 place count 535 transition count 3059
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 4193 place count 530 transition count 3054
Iterating global reduction 7 with 5 rules applied. Total rules applied 4198 place count 530 transition count 3054
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4199 place count 529 transition count 3053
Iterating global reduction 7 with 1 rules applied. Total rules applied 4200 place count 529 transition count 3053
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 4280 place count 489 transition count 3013
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4281 place count 489 transition count 3012
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 4287 place count 483 transition count 3006
Iterating global reduction 8 with 6 rules applied. Total rules applied 4293 place count 483 transition count 3006
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 4296 place count 480 transition count 3003
Iterating global reduction 8 with 3 rules applied. Total rules applied 4299 place count 480 transition count 3003
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4301 place count 478 transition count 3001
Iterating global reduction 8 with 2 rules applied. Total rules applied 4303 place count 478 transition count 3001
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 4315 place count 472 transition count 3019
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 4318 place count 472 transition count 3016
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 4321 place count 472 transition count 3013
Free-agglomeration rule applied 87 times.
Iterating global reduction 9 with 87 rules applied. Total rules applied 4408 place count 472 transition count 2926
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 9 with 87 rules applied. Total rules applied 4495 place count 385 transition count 2926
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 4498 place count 382 transition count 2923
Iterating global reduction 10 with 3 rules applied. Total rules applied 4501 place count 382 transition count 2923
Drop transitions removed 525 transitions
Redundant transition composition rules discarded 525 transitions
Iterating global reduction 10 with 525 rules applied. Total rules applied 5026 place count 382 transition count 2398
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 5034 place count 382 transition count 2398
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 5039 place count 382 transition count 2393
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 5041 place count 382 transition count 2393
Applied a total of 5041 rules in 12885 ms. Remains 382 /2746 variables (removed 2364) and now considering 2393/42776 (removed 40383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12888 ms. Remains : 382/2746 places, 2393/42776 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 780 ms. (steps per millisecond=12 ) properties (out of 12) seen :3
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :1
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2393 rows 382 cols
[2023-03-22 12:37:28] [INFO ] Computed 10 place invariants in 34 ms
[2023-03-22 12:37:29] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-22 12:37:29] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 12:37:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-22 12:37:31] [INFO ] After 2127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 12:37:32] [INFO ] State equation strengthened by 1479 read => feed constraints.
[2023-03-22 12:37:35] [INFO ] After 3675ms SMT Verify possible using 1479 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 12:37:37] [INFO ] Deduced a trap composed of 62 places in 2050 ms of which 16 ms to minimize.
[2023-03-22 12:37:39] [INFO ] Deduced a trap composed of 53 places in 1827 ms of which 2 ms to minimize.
[2023-03-22 12:37:41] [INFO ] Deduced a trap composed of 65 places in 1590 ms of which 5 ms to minimize.
[2023-03-22 12:37:43] [INFO ] Deduced a trap composed of 54 places in 1769 ms of which 2 ms to minimize.
[2023-03-22 12:37:45] [INFO ] Deduced a trap composed of 48 places in 1607 ms of which 1 ms to minimize.
[2023-03-22 12:37:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 9467 ms
[2023-03-22 12:37:47] [INFO ] Deduced a trap composed of 57 places in 1646 ms of which 2 ms to minimize.
[2023-03-22 12:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1855 ms
[2023-03-22 12:37:49] [INFO ] Deduced a trap composed of 53 places in 1570 ms of which 1 ms to minimize.
[2023-03-22 12:37:50] [INFO ] Deduced a trap composed of 69 places in 1544 ms of which 2 ms to minimize.
[2023-03-22 12:37:52] [INFO ] Deduced a trap composed of 68 places in 1409 ms of which 1 ms to minimize.
[2023-03-22 12:37:53] [INFO ] Deduced a trap composed of 66 places in 1397 ms of which 1 ms to minimize.
[2023-03-22 12:37:55] [INFO ] Deduced a trap composed of 68 places in 1346 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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 12:37:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 12:37:55] [INFO ] After 26027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 111 ms.
Support contains 117 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 2393/2393 transitions.
Graph (trivial) has 97 edges and 382 vertex of which 4 / 382 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 380 transition count 2352
Reduce places removed 37 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 83 place count 343 transition count 2344
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 91 place count 335 transition count 2344
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 91 place count 335 transition count 2339
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 101 place count 330 transition count 2339
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 326 transition count 2335
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 326 transition count 2335
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 324 transition count 2332
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 324 transition count 2332
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 133 place count 314 transition count 2322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 136 place count 314 transition count 2319
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 145 place count 305 transition count 2310
Iterating global reduction 4 with 9 rules applied. Total rules applied 154 place count 305 transition count 2310
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 163 place count 305 transition count 2301
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 167 place count 301 transition count 2297
Iterating global reduction 5 with 4 rules applied. Total rules applied 171 place count 301 transition count 2297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 173 place count 300 transition count 2296
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 177 place count 300 transition count 2292
Free-agglomeration rule applied 13 times.
Iterating global reduction 5 with 13 rules applied. Total rules applied 190 place count 300 transition count 2279
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 204 place count 287 transition count 2278
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 208 place count 287 transition count 2274
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 209 place count 287 transition count 2274
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 210 place count 287 transition count 2273
Applied a total of 210 rules in 2614 ms. Remains 287 /382 variables (removed 95) and now considering 2273/2393 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2614 ms. Remains : 287/382 places, 2273/2393 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :1
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2273 rows 287 cols
[2023-03-22 12:37:58] [INFO ] Computed 10 place invariants in 32 ms
[2023-03-22 12:37:59] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-22 12:37:59] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 12:37:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-22 12:38:00] [INFO ] After 1433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 12:38:00] [INFO ] State equation strengthened by 1713 read => feed constraints.
[2023-03-22 12:38:03] [INFO ] After 2684ms SMT Verify possible using 1713 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 12:38:05] [INFO ] Deduced a trap composed of 43 places in 1399 ms of which 0 ms to minimize.
[2023-03-22 12:38:06] [INFO ] Deduced a trap composed of 46 places in 1442 ms of which 1 ms to minimize.
[2023-03-22 12:38:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3089 ms
[2023-03-22 12:38:08] [INFO ] Deduced a trap composed of 59 places in 1553 ms of which 1 ms to minimize.
[2023-03-22 12:38:10] [INFO ] Deduced a trap composed of 54 places in 1447 ms of which 7 ms to minimize.
[2023-03-22 12:38:11] [INFO ] Deduced a trap composed of 60 places in 1407 ms of which 0 ms to minimize.
[2023-03-22 12:38:13] [INFO ] Deduced a trap composed of 63 places in 1257 ms of which 1 ms to minimize.
[2023-03-22 12:38:14] [INFO ] Deduced a trap composed of 37 places in 1202 ms of which 0 ms to minimize.
[2023-03-22 12:38:15] [INFO ] Deduced a trap composed of 52 places in 1433 ms of which 0 ms to minimize.
[2023-03-22 12:38:17] [INFO ] Deduced a trap composed of 35 places in 1421 ms of which 1 ms to minimize.
[2023-03-22 12:38:19] [INFO ] Deduced a trap composed of 40 places in 1548 ms of which 1 ms to minimize.
[2023-03-22 12:38:20] [INFO ] Deduced a trap composed of 33 places in 1420 ms of which 1 ms to minimize.
[2023-03-22 12:38:22] [INFO ] Deduced a trap composed of 48 places in 1792 ms of which 0 ms to minimize.
[2023-03-22 12:38:24] [INFO ] Deduced a trap composed of 55 places in 1575 ms of which 1 ms to minimize.
[2023-03-22 12:38:25] [INFO ] Deduced a trap composed of 2 places in 1540 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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 12:38:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 12:38:25] [INFO ] After 26553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 84 ms.
Support contains 115 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 2273/2273 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 287 transition count 2271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 285 transition count 2271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 283 transition count 2269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 283 transition count 2268
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 11 place count 281 transition count 2266
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 281 transition count 2266
Applied a total of 13 rules in 703 ms. Remains 281 /287 variables (removed 6) and now considering 2266/2273 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 703 ms. Remains : 281/287 places, 2266/2273 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 255275 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255275 steps, saw 40622 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2266 rows 281 cols
[2023-03-22 12:38:30] [INFO ] Computed 10 place invariants in 20 ms
[2023-03-22 12:38:30] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-22 12:38:30] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 12:38:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-22 12:38:31] [INFO ] After 1517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 12:38:32] [INFO ] State equation strengthened by 1710 read => feed constraints.
[2023-03-22 12:38:35] [INFO ] After 3517ms SMT Verify possible using 1710 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 12:38:37] [INFO ] Deduced a trap composed of 41 places in 1417 ms of which 1 ms to minimize.
[2023-03-22 12:38:38] [INFO ] Deduced a trap composed of 53 places in 1286 ms of which 1 ms to minimize.
[2023-03-22 12:38:40] [INFO ] Deduced a trap composed of 39 places in 1274 ms of which 1 ms to minimize.
[2023-03-22 12:38:41] [INFO ] Deduced a trap composed of 56 places in 1088 ms of which 1 ms to minimize.
[2023-03-22 12:38:42] [INFO ] Deduced a trap composed of 44 places in 1156 ms of which 1 ms to minimize.
[2023-03-22 12:38:43] [INFO ] Deduced a trap composed of 42 places in 1194 ms of which 1 ms to minimize.
[2023-03-22 12:38:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 8296 ms
[2023-03-22 12:38:45] [INFO ] Deduced a trap composed of 50 places in 1350 ms of which 5 ms to minimize.
[2023-03-22 12:38:47] [INFO ] Deduced a trap composed of 54 places in 1298 ms of which 1 ms to minimize.
[2023-03-22 12:38:48] [INFO ] Deduced a trap composed of 33 places in 1232 ms of which 1 ms to minimize.
[2023-03-22 12:38:50] [INFO ] Deduced a trap composed of 54 places in 1461 ms of which 1 ms to minimize.
[2023-03-22 12:38:51] [INFO ] Deduced a trap composed of 52 places in 1457 ms of which 0 ms to minimize.
[2023-03-22 12:38:53] [INFO ] Deduced a trap composed of 34 places in 1127 ms of which 1 ms to minimize.
[2023-03-22 12:38:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 8804 ms
[2023-03-22 12:38:54] [INFO ] Deduced a trap composed of 36 places in 1001 ms of which 0 ms to minimize.
[2023-03-22 12:38:56] [INFO ] Deduced a trap composed of 48 places in 1458 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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 12:38:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 12:38:56] [INFO ] After 26241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 85 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 2266/2266 transitions.
Graph (trivial) has 67 edges and 281 vertex of which 8 / 281 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 277 transition count 2236
Reduce places removed 22 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 28 rules applied. Total rules applied 51 place count 255 transition count 2230
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 58 place count 249 transition count 2229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 249 transition count 2227
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 247 transition count 2227
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 244 transition count 1969
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 244 transition count 1969
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 244 transition count 1968
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 243 transition count 1966
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 243 transition count 1966
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 83 place count 237 transition count 1960
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 85 place count 237 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 90 place count 232 transition count 1953
Iterating global reduction 5 with 5 rules applied. Total rules applied 95 place count 232 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 231 transition count 1952
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 231 transition count 1952
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 99 place count 230 transition count 1952
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 101 place count 230 transition count 1950
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 108 place count 230 transition count 1943
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 116 place count 223 transition count 1942
Drop transitions removed 384 transitions
Redundant transition composition rules discarded 384 transitions
Iterating global reduction 6 with 384 rules applied. Total rules applied 500 place count 223 transition count 1558
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 502 place count 223 transition count 1558
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 504 place count 223 transition count 1556
Applied a total of 504 rules in 2270 ms. Remains 223 /281 variables (removed 58) and now considering 1556/2266 (removed 710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2272 ms. Remains : 223/281 places, 1556/2266 transitions.
Incomplete random walk after 10000 steps, including 184 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 327308 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327308 steps, saw 53729 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1556 rows 223 cols
[2023-03-22 12:39:02] [INFO ] Computed 10 place invariants in 10 ms
[2023-03-22 12:39:02] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-22 12:39:02] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 12:39:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-22 12:39:03] [INFO ] After 1042ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 12:39:03] [INFO ] State equation strengthened by 1266 read => feed constraints.
[2023-03-22 12:39:05] [INFO ] After 1895ms SMT Verify possible using 1266 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 12:39:06] [INFO ] Deduced a trap composed of 36 places in 1045 ms of which 7 ms to minimize.
[2023-03-22 12:39:07] [INFO ] Deduced a trap composed of 31 places in 804 ms of which 0 ms to minimize.
[2023-03-22 12:39:08] [INFO ] Deduced a trap composed of 32 places in 810 ms of which 3 ms to minimize.
[2023-03-22 12:39:09] [INFO ] Deduced a trap composed of 32 places in 678 ms of which 0 ms to minimize.
[2023-03-22 12:39:10] [INFO ] Deduced a trap composed of 35 places in 522 ms of which 1 ms to minimize.
[2023-03-22 12:39:10] [INFO ] Deduced a trap composed of 40 places in 629 ms of which 1 ms to minimize.
[2023-03-22 12:39:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5099 ms
[2023-03-22 12:39:12] [INFO ] Deduced a trap composed of 34 places in 1203 ms of which 1 ms to minimize.
[2023-03-22 12:39:13] [INFO ] Deduced a trap composed of 39 places in 1116 ms of which 1 ms to minimize.
[2023-03-22 12:39:15] [INFO ] Deduced a trap composed of 24 places in 1018 ms of which 2 ms to minimize.
[2023-03-22 12:39:16] [INFO ] Deduced a trap composed of 44 places in 1128 ms of which 0 ms to minimize.
[2023-03-22 12:39:17] [INFO ] Deduced a trap composed of 45 places in 1114 ms of which 1 ms to minimize.
[2023-03-22 12:39:18] [INFO ] Deduced a trap composed of 26 places in 1094 ms of which 2 ms to minimize.
[2023-03-22 12:39:19] [INFO ] Deduced a trap composed of 32 places in 1083 ms of which 0 ms to minimize.
[2023-03-22 12:39:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 8279 ms
[2023-03-22 12:39:20] [INFO ] After 16650ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1535 ms.
[2023-03-22 12:39:22] [INFO ] After 19402ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 35 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 1556/1556 transitions.
Graph (trivial) has 108 edges and 223 vertex of which 8 / 223 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 827 edges and 219 vertex of which 218 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 218 transition count 1508
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 179 transition count 1504
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 176 transition count 1504
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 88 place count 176 transition count 1497
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 102 place count 169 transition count 1497
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 108 place count 163 transition count 1491
Iterating global reduction 3 with 6 rules applied. Total rules applied 114 place count 163 transition count 1491
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 161 transition count 1489
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 161 transition count 1489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 161 transition count 1488
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 149 place count 146 transition count 1473
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 159 place count 146 transition count 1463
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 171 place count 134 transition count 1451
Iterating global reduction 5 with 12 rules applied. Total rules applied 183 place count 134 transition count 1451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 134 transition count 1450
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 189 place count 129 transition count 1445
Iterating global reduction 6 with 5 rules applied. Total rules applied 194 place count 129 transition count 1445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 195 place count 129 transition count 1444
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 197 place count 127 transition count 1442
Iterating global reduction 7 with 2 rules applied. Total rules applied 199 place count 127 transition count 1442
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 204 place count 127 transition count 1437
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 206 place count 126 transition count 1443
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 209 place count 126 transition count 1440
Free-agglomeration rule applied 14 times.
Iterating global reduction 8 with 14 rules applied. Total rules applied 223 place count 126 transition count 1426
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 239 place count 112 transition count 1424
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 242 place count 112 transition count 1424
Applied a total of 242 rules in 1549 ms. Remains 112 /223 variables (removed 111) and now considering 1424/1556 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1550 ms. Remains : 112/223 places, 1424/1556 transitions.
Incomplete random walk after 10000 steps, including 304 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 373883 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 373883 steps, saw 57194 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1424 rows 112 cols
[2023-03-22 12:39:27] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-22 12:39:27] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-22 12:39:27] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 12:39:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 12:39:28] [INFO ] After 863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 12:39:28] [INFO ] State equation strengthened by 1316 read => feed constraints.
[2023-03-22 12:39:29] [INFO ] After 933ms SMT Verify possible using 1316 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 12:39:30] [INFO ] Deduced a trap composed of 17 places in 747 ms of which 4 ms to minimize.
[2023-03-22 12:39:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 862 ms
[2023-03-22 12:39:31] [INFO ] Deduced a trap composed of 19 places in 689 ms of which 1 ms to minimize.
[2023-03-22 12:39:31] [INFO ] Deduced a trap composed of 14 places in 678 ms of which 1 ms to minimize.
[2023-03-22 12:39:32] [INFO ] Deduced a trap composed of 16 places in 768 ms of which 7 ms to minimize.
[2023-03-22 12:39:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2419 ms
[2023-03-22 12:39:32] [INFO ] After 4648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 432 ms.
[2023-03-22 12:39:33] [INFO ] After 6089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 31 ms.
Support contains 35 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 1424/1424 transitions.
Applied a total of 0 rules in 251 ms. Remains 112 /112 variables (removed 0) and now considering 1424/1424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 112/112 places, 1424/1424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 1424/1424 transitions.
Applied a total of 0 rules in 352 ms. Remains 112 /112 variables (removed 0) and now considering 1424/1424 (removed 0) transitions.
[2023-03-22 12:39:34] [INFO ] Invariant cache hit.
[2023-03-22 12:39:34] [INFO ] Implicit Places using invariants in 394 ms returned [111]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 400 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/112 places, 1424/1424 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 111 transition count 1419
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 106 transition count 1415
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 102 transition count 1415
Performed 22 Post agglomeration using F-continuation condition with reduction of 1164 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 62 place count 80 transition count 229
Drop transitions removed 5 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 160 place count 80 transition count 131
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 170 place count 75 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 174 place count 73 transition count 142
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 199 place count 73 transition count 117
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 73 transition count 114
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 205 place count 70 transition count 114
Applied a total of 205 rules in 91 ms. Remains 70 /111 variables (removed 41) and now considering 114/1424 (removed 1310) transitions.
// Phase 1: matrix 114 rows 70 cols
[2023-03-22 12:39:34] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-22 12:39:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-22 12:39:34] [INFO ] Invariant cache hit.
[2023-03-22 12:39:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 12:39:34] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 70/112 places, 114/1424 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1039 ms. Remains : 70/112 places, 114/1424 transitions.
Finished random walk after 1388 steps, including 72 resets, run visited all 4 properties in 21 ms. (steps per millisecond=66 )
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 175936 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: StigmergyCommit_PT_08b
(NrP: 2746 NrTr: 42776 NrArc: 723933)

parse formulas
formulas created successfully
place and transition orderings generation:4m36.577sec

net check time: 0m 0.100sec

init dd package: 0m 3.301sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9148120 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16061252 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 ReachabilityCardinality -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: 0m30.246sec

1858075

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="StigmergyCommit-PT-08b"
export BK_EXAMINATION="ReachabilityCardinality"
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 StigmergyCommit-PT-08b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r458-smll-167912650400502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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