Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r308-tajo-171654461500267.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S10J60, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r308-tajo-171654461500267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717191050855

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=gold2023
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J60
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202304061127
[2024-05-31 21:30:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 21:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:30:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 21:30:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 21:30:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 550 ms
[2024-05-31 21:30:53] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 24 ms.
[2024-05-31 21:30:53] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 212 ms.
[2024-05-31 21:30:53] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-31 21:30:53] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-31 21:30:53] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-31 21:30:53] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 60 places in 31 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2024-05-31 21:30:54] [INFO ] Flatten gal took : 435 ms
[2024-05-31 21:30:54] [INFO ] Flatten gal took : 227 ms
[2024-05-31 21:30:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16935460437013604446.gal : 110 ms
[2024-05-31 21:30:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13777233840500698294.prop : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16935460437013604446.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13777233840500698294.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13777233840500698294.prop.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1722 ms. (steps per millisecond=5 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 122 ms. (steps per millisecond=8 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-31 21:30:56] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-31 21:30:56] [INFO ] Computed 152 invariants in 258 ms
Reachability property qltransition_31 is true.
SDD proceeding with computation,35 properties remain. new max is 2
SDD size :1 after 2
Reachability property qltransition_32 is true.
SDD proceeding with computation,34 properties remain. new max is 2
SDD size :2 after 3
Reachability property qltransition_35 is true.
Reachability property qltransition_16 is true.
SDD proceeding with computation,32 properties remain. new max is 2
SDD size :3 after 6
Reachability property qltransition_27 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,29 properties remain. new max is 2
SDD size :6 after 14
[2024-05-31 21:30:59] [INFO ] [Real]Absence check using 145 positive place invariants in 110 ms returned sat
[2024-05-31 21:30:59] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 47 ms returned sat
Reachability property qltransition_21 is true.
SDD proceeding with computation,28 properties remain. new max is 2
SDD size :14 after 15
Reachability property qltransition_6 is true.
SDD proceeding with computation,27 properties remain. new max is 2
SDD size :15 after 16
SDD proceeding with computation,27 properties remain. new max is 4
SDD size :16 after 17
SDD proceeding with computation,27 properties remain. new max is 8
SDD size :17 after 18
SDD proceeding with computation,27 properties remain. new max is 16
SDD size :18 after 19
Reachability property qltransition_25 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,23 properties remain. new max is 16
SDD size :19 after 28
Reachability property qltransition_36 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
Reachability property qltransition_8 is true.
SDD proceeding with computation,19 properties remain. new max is 16
SDD size :28 after 32
SDD proceeding with computation,19 properties remain. new max is 32
SDD size :32 after 33
Reachability property qltransition_30 is true.
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :33 after 34
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :34 after 42
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :42 after 43
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :43 after 56
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :56 after 70
Reachability property qltransition_34 is true.
Reachability property qltransition_28 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :70 after 83
[2024-05-31 21:31:04] [INFO ] After 4694ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:15
[2024-05-31 21:31:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Reachability property qltransition_33 is true.
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :83 after 106
[2024-05-31 21:31:05] [INFO ] After 455ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:15
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :106 after 129
[2024-05-31 21:31:05] [INFO ] After 930ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:15
Attempting to minimize the solution found.
Minimization took 315 ms.
[2024-05-31 21:31:05] [INFO ] After 7333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:15
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :129 after 172
[2024-05-31 21:31:06] [INFO ] [Nat]Absence check using 145 positive place invariants in 57 ms returned sat
[2024-05-31 21:31:06] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 49 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :172 after 258
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :258 after 408
Reachability property qltransition_24 is true.
[2024-05-31 21:31:31] [INFO ] After 23778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 21:31:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 21:31:31] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:15
Reachability property qltransition_19 is true.
Parikh walk visited 0 properties in 699 ms.
Support contains 206 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Reachability property qltransition_13 is true.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 1224 transition count 2745
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 140 place count 1159 transition count 2745
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 140 place count 1159 transition count 2682
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 266 place count 1096 transition count 2682
Reachability property qltransition_4 is true.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 270 place count 1094 transition count 2680
Applied a total of 270 rules in 538 ms. Remains 1094 /1234 variables (removed 140) and now considering 2680/2810 (removed 130) transitions.
[2024-05-31 21:31:32] [INFO ] Flow matrix only has 2671 transitions (discarded 9 similar events)
// Phase 1: matrix 2671 rows 1094 cols
[2024-05-31 21:31:32] [INFO ] Computed 142 invariants in 88 ms
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :408 after 1752
[2024-05-31 21:31:33] [INFO ] Dead Transitions using invariants and state equation in 1583 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1094/1234 places, 2065/2810 transitions.
Applied a total of 0 rules in 64 ms. Remains 1094 /1094 variables (removed 0) and now considering 2065/2065 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2188 ms. Remains : 1094/1234 places, 2065/2810 transitions.
Incomplete random walk after 1000000 steps, including 64401 resets, run finished after 8092 ms. (steps per millisecond=123 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 7051 resets, run finished after 1980 ms. (steps per millisecond=505 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:31:44] [INFO ] Flow matrix only has 2056 transitions (discarded 9 similar events)
// Phase 1: matrix 2056 rows 1094 cols
[2024-05-31 21:31:44] [INFO ] Computed 142 invariants in 88 ms
[2024-05-31 21:31:44] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-31 21:31:44] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 35 ms returned sat
[2024-05-31 21:31:44] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:31:44] [INFO ] [Nat]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-31 21:31:44] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 36 ms returned sat
[2024-05-31 21:31:45] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:31:45] [INFO ] After 457ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:46] [INFO ] Deduced a trap composed of 455 places in 724 ms of which 1 ms to minimize.
[2024-05-31 21:31:47] [INFO ] Deduced a trap composed of 465 places in 652 ms of which 2 ms to minimize.
[2024-05-31 21:31:47] [INFO ] Deduced a trap composed of 443 places in 569 ms of which 12 ms to minimize.
[2024-05-31 21:31:48] [INFO ] Deduced a trap composed of 457 places in 631 ms of which 2 ms to minimize.
[2024-05-31 21:31:49] [INFO ] Deduced a trap composed of 482 places in 489 ms of which 1 ms to minimize.
[2024-05-31 21:31:49] [INFO ] Deduced a trap composed of 451 places in 481 ms of which 2 ms to minimize.
[2024-05-31 21:31:50] [INFO ] Deduced a trap composed of 465 places in 594 ms of which 1 ms to minimize.
[2024-05-31 21:31:51] [INFO ] Deduced a trap composed of 447 places in 679 ms of which 1 ms to minimize.
[2024-05-31 21:31:52] [INFO ] Deduced a trap composed of 451 places in 658 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :1752 after 3075
[2024-05-31 21:31:52] [INFO ] Deduced a trap composed of 433 places in 560 ms of which 1 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 445 places in 516 ms of which 1 ms to minimize.
[2024-05-31 21:31:54] [INFO ] Deduced a trap composed of 539 places in 556 ms of which 1 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 451 places in 653 ms of which 1 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 463 places in 652 ms of which 1 ms to minimize.
[2024-05-31 21:31:56] [INFO ] Deduced a trap composed of 455 places in 679 ms of which 1 ms to minimize.
[2024-05-31 21:31:57] [INFO ] Deduced a trap composed of 459 places in 686 ms of which 1 ms to minimize.
[2024-05-31 21:31:58] [INFO ] Deduced a trap composed of 453 places in 691 ms of which 1 ms to minimize.
[2024-05-31 21:31:58] [INFO ] Deduced a trap composed of 449 places in 687 ms of which 2 ms to minimize.
[2024-05-31 21:31:59] [INFO ] Deduced a trap composed of 453 places in 631 ms of which 2 ms to minimize.
[2024-05-31 21:32:00] [INFO ] Deduced a trap composed of 455 places in 473 ms of which 1 ms to minimize.
[2024-05-31 21:32:00] [INFO ] Deduced a trap composed of 447 places in 657 ms of which 1 ms to minimize.
[2024-05-31 21:32:01] [INFO ] Deduced a trap composed of 457 places in 561 ms of which 1 ms to minimize.
[2024-05-31 21:32:10] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 24911 ms
[2024-05-31 21:32:10] [INFO ] After 25605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:32:10] [INFO ] After 26450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 1094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1094/1094 places, 2065/2065 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1094 transition count 2064
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1093 transition count 2064
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1093 transition count 2062
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 6 place count 1091 transition count 2062
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 2 with 2 rules applied. Total rules applied 8 place count 1090 transition count 2061
Applied a total of 8 rules in 196 ms. Remains 1090 /1094 variables (removed 4) and now considering 2061/2065 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 1090/1094 places, 2061/2065 transitions.
Incomplete random walk after 1000000 steps, including 72783 resets, run finished after 12138 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7161 resets, run finished after 2342 ms. (steps per millisecond=426 ) properties (out of 1) seen :0
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :3075 after 6236
Interrupted probabilistic random walk after 4451054 steps, run timeout after 42001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 4451054 steps, saw 752076 distinct states, run finished after 42007 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:33:07] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 21:33:07] [INFO ] Computed 142 invariants in 57 ms
[2024-05-31 21:33:07] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2024-05-31 21:33:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 21:33:07] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:33:07] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
SDD proceeding with computation,10 properties remain. new max is 65536
[2024-05-31 21:33:08] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
SDD size :6236 after 12970
[2024-05-31 21:33:08] [INFO ] After 541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:33:09] [INFO ] After 895ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:10] [INFO ] Deduced a trap composed of 430 places in 605 ms of which 1 ms to minimize.
[2024-05-31 21:33:10] [INFO ] Deduced a trap composed of 432 places in 521 ms of which 1 ms to minimize.
[2024-05-31 21:33:11] [INFO ] Deduced a trap composed of 442 places in 565 ms of which 1 ms to minimize.
[2024-05-31 21:33:11] [INFO ] Deduced a trap composed of 438 places in 554 ms of which 1 ms to minimize.
[2024-05-31 21:33:12] [INFO ] Deduced a trap composed of 442 places in 541 ms of which 1 ms to minimize.
[2024-05-31 21:33:13] [INFO ] Deduced a trap composed of 440 places in 557 ms of which 1 ms to minimize.
[2024-05-31 21:33:14] [INFO ] Deduced a trap composed of 440 places in 567 ms of which 1 ms to minimize.
[2024-05-31 21:33:14] [INFO ] Deduced a trap composed of 436 places in 540 ms of which 1 ms to minimize.
[2024-05-31 21:33:15] [INFO ] Deduced a trap composed of 446 places in 539 ms of which 1 ms to minimize.
[2024-05-31 21:33:16] [INFO ] Deduced a trap composed of 436 places in 570 ms of which 1 ms to minimize.
[2024-05-31 21:33:16] [INFO ] Deduced a trap composed of 442 places in 517 ms of which 2 ms to minimize.
[2024-05-31 21:33:17] [INFO ] Deduced a trap composed of 444 places in 605 ms of which 5 ms to minimize.
[2024-05-31 21:33:18] [INFO ] Deduced a trap composed of 446 places in 629 ms of which 1 ms to minimize.
[2024-05-31 21:33:19] [INFO ] Deduced a trap composed of 440 places in 653 ms of which 15 ms to minimize.
[2024-05-31 21:33:20] [INFO ] Deduced a trap composed of 436 places in 719 ms of which 1 ms to minimize.
[2024-05-31 21:33:21] [INFO ] Deduced a trap composed of 450 places in 658 ms of which 1 ms to minimize.
[2024-05-31 21:33:21] [INFO ] Deduced a trap composed of 442 places in 604 ms of which 3 ms to minimize.
[2024-05-31 21:33:22] [INFO ] Deduced a trap composed of 444 places in 574 ms of which 1 ms to minimize.
[2024-05-31 21:33:23] [INFO ] Deduced a trap composed of 444 places in 570 ms of which 3 ms to minimize.
[2024-05-31 21:33:23] [INFO ] Deduced a trap composed of 434 places in 562 ms of which 2 ms to minimize.
[2024-05-31 21:33:25] [INFO ] Deduced a trap composed of 448 places in 873 ms of which 1 ms to minimize.
[2024-05-31 21:33:26] [INFO ] Deduced a trap composed of 448 places in 976 ms of which 1 ms to minimize.
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 432 places in 597 ms of which 1 ms to minimize.
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 440 places in 606 ms of which 1 ms to minimize.
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 440 places in 876 ms of which 1 ms to minimize.
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 436 places in 846 ms of which 1 ms to minimize.
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 434 places in 816 ms of which 1 ms to minimize.
[2024-05-31 21:33:32] [INFO ] Deduced a trap composed of 448 places in 609 ms of which 13 ms to minimize.
[2024-05-31 21:33:33] [INFO ] Deduced a trap composed of 436 places in 793 ms of which 1 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 442 places in 830 ms of which 1 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 456 places in 810 ms of which 1 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 434 places in 842 ms of which 2 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 434 places in 894 ms of which 1 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 452 places in 904 ms of which 24 ms to minimize.
[2024-05-31 21:33:39] [INFO ] Deduced a trap composed of 446 places in 852 ms of which 2 ms to minimize.
[2024-05-31 21:33:42] [INFO ] Deduced a trap composed of 440 places in 840 ms of which 1 ms to minimize.
[2024-05-31 21:33:44] [INFO ] Deduced a trap composed of 438 places in 850 ms of which 1 ms to minimize.
[2024-05-31 21:33:45] [INFO ] Deduced a trap composed of 446 places in 856 ms of which 1 ms to minimize.
[2024-05-31 21:33:46] [INFO ] Deduced a trap composed of 444 places in 857 ms of which 1 ms to minimize.
[2024-05-31 21:33:48] [INFO ] Deduced a trap composed of 452 places in 871 ms of which 1 ms to minimize.
[2024-05-31 21:33:50] [INFO ] Deduced a trap composed of 448 places in 974 ms of which 2 ms to minimize.
[2024-05-31 21:33:51] [INFO ] Deduced a trap composed of 458 places in 508 ms of which 1 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 440 places in 788 ms of which 1 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 448 places in 836 ms of which 3 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 438 places in 976 ms of which 20 ms to minimize.
[2024-05-31 21:33:56] [INFO ] Deduced a trap composed of 436 places in 846 ms of which 7 ms to minimize.
[2024-05-31 21:33:57] [INFO ] Deduced a trap composed of 438 places in 756 ms of which 1 ms to minimize.
[2024-05-31 21:33:58] [INFO ] Deduced a trap composed of 434 places in 857 ms of which 2 ms to minimize.
[2024-05-31 21:34:01] [INFO ] Deduced a trap composed of 446 places in 592 ms of which 1 ms to minimize.
[2024-05-31 21:34:02] [INFO ] Deduced a trap composed of 448 places in 859 ms of which 2 ms to minimize.
[2024-05-31 21:34:03] [INFO ] Deduced a trap composed of 440 places in 851 ms of which 1 ms to minimize.
[2024-05-31 21:34:05] [INFO ] Deduced a trap composed of 452 places in 880 ms of which 1 ms to minimize.
[2024-05-31 21:34:07] [INFO ] Deduced a trap composed of 440 places in 901 ms of which 2 ms to minimize.
[2024-05-31 21:34:09] [INFO ] Deduced a trap composed of 438 places in 941 ms of which 1 ms to minimize.
[2024-05-31 21:34:10] [INFO ] Deduced a trap composed of 434 places in 616 ms of which 1 ms to minimize.
[2024-05-31 21:34:11] [INFO ] Deduced a trap composed of 440 places in 600 ms of which 1 ms to minimize.
[2024-05-31 21:34:12] [INFO ] Deduced a trap composed of 442 places in 574 ms of which 1 ms to minimize.
[2024-05-31 21:34:14] [INFO ] Deduced a trap composed of 420 places in 597 ms of which 1 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 440 places in 614 ms of which 1 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 434 places in 586 ms of which 1 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 446 places in 606 ms of which 1 ms to minimize.
[2024-05-31 21:34:26] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 76599 ms
[2024-05-31 21:34:26] [INFO ] After 77837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:34:26] [INFO ] After 78604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 127 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 78 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2024-05-31 21:34:26] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:34:26] [INFO ] Invariant cache hit.
[2024-05-31 21:34:27] [INFO ] Implicit Places using invariants in 1083 ms returned []
[2024-05-31 21:34:27] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:34:27] [INFO ] Invariant cache hit.
[2024-05-31 21:34:28] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 131072
SDD size :12970 after 27362
[2024-05-31 21:34:37] [INFO ] Implicit Places using invariants and state equation in 9977 ms returned []
Implicit Place search using SMT with State Equation took 11093 ms to find 0 implicit places.
[2024-05-31 21:34:37] [INFO ] Redundant transitions in 215 ms returned []
[2024-05-31 21:34:37] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:34:37] [INFO ] Invariant cache hit.
[2024-05-31 21:34:39] [INFO ] Dead Transitions using invariants and state equation in 2012 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13421 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7274 resets, run finished after 1115 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:34:41] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:34:41] [INFO ] Invariant cache hit.
[2024-05-31 21:34:42] [INFO ] [Real]Absence check using 135 positive place invariants in 875 ms returned sat
[2024-05-31 21:34:42] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 61 ms returned sat
[2024-05-31 21:34:47] [INFO ] After 4819ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:34:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:34:47] [INFO ] After 210ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:34:47] [INFO ] After 379ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:34:47] [INFO ] After 6352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:34:48] [INFO ] [Nat]Absence check using 135 positive place invariants in 891 ms returned sat
[2024-05-31 21:34:48] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 56 ms returned sat
[2024-05-31 21:34:51] [INFO ] After 2331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:34:51] [INFO ] After 723ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:34:52] [INFO ] Deduced a trap composed of 438 places in 530 ms of which 1 ms to minimize.
[2024-05-31 21:34:52] [INFO ] Deduced a trap composed of 444 places in 479 ms of which 1 ms to minimize.
[2024-05-31 21:34:53] [INFO ] Deduced a trap composed of 442 places in 434 ms of which 1 ms to minimize.
[2024-05-31 21:34:53] [INFO ] Deduced a trap composed of 452 places in 435 ms of which 1 ms to minimize.
[2024-05-31 21:34:54] [INFO ] Deduced a trap composed of 440 places in 548 ms of which 2 ms to minimize.
[2024-05-31 21:34:55] [INFO ] Deduced a trap composed of 432 places in 548 ms of which 1 ms to minimize.
[2024-05-31 21:34:55] [INFO ] Deduced a trap composed of 442 places in 563 ms of which 1 ms to minimize.
[2024-05-31 21:34:56] [INFO ] Deduced a trap composed of 450 places in 559 ms of which 1 ms to minimize.
[2024-05-31 21:34:57] [INFO ] Deduced a trap composed of 442 places in 569 ms of which 1 ms to minimize.
[2024-05-31 21:34:57] [INFO ] Deduced a trap composed of 442 places in 576 ms of which 1 ms to minimize.
[2024-05-31 21:34:58] [INFO ] Deduced a trap composed of 444 places in 628 ms of which 1 ms to minimize.
[2024-05-31 21:34:59] [INFO ] Deduced a trap composed of 444 places in 613 ms of which 1 ms to minimize.
[2024-05-31 21:35:00] [INFO ] Deduced a trap composed of 428 places in 625 ms of which 2 ms to minimize.
[2024-05-31 21:35:01] [INFO ] Deduced a trap composed of 446 places in 636 ms of which 1 ms to minimize.
[2024-05-31 21:35:02] [INFO ] Deduced a trap composed of 446 places in 620 ms of which 1 ms to minimize.
[2024-05-31 21:35:02] [INFO ] Deduced a trap composed of 448 places in 615 ms of which 1 ms to minimize.
[2024-05-31 21:35:03] [INFO ] Deduced a trap composed of 444 places in 619 ms of which 1 ms to minimize.
[2024-05-31 21:35:04] [INFO ] Deduced a trap composed of 438 places in 622 ms of which 1 ms to minimize.
[2024-05-31 21:35:05] [INFO ] Deduced a trap composed of 446 places in 612 ms of which 2 ms to minimize.
[2024-05-31 21:35:06] [INFO ] Deduced a trap composed of 444 places in 615 ms of which 1 ms to minimize.
[2024-05-31 21:35:07] [INFO ] Deduced a trap composed of 426 places in 618 ms of which 1 ms to minimize.
[2024-05-31 21:35:07] [INFO ] Deduced a trap composed of 446 places in 620 ms of which 1 ms to minimize.
[2024-05-31 21:35:08] [INFO ] Deduced a trap composed of 436 places in 618 ms of which 1 ms to minimize.
[2024-05-31 21:35:09] [INFO ] Deduced a trap composed of 438 places in 622 ms of which 1 ms to minimize.
[2024-05-31 21:35:10] [INFO ] Deduced a trap composed of 446 places in 574 ms of which 1 ms to minimize.
[2024-05-31 21:35:11] [INFO ] Deduced a trap composed of 452 places in 558 ms of which 1 ms to minimize.
[2024-05-31 21:35:11] [INFO ] Deduced a trap composed of 446 places in 569 ms of which 1 ms to minimize.
[2024-05-31 21:35:12] [INFO ] Deduced a trap composed of 444 places in 571 ms of which 1 ms to minimize.
[2024-05-31 21:35:13] [INFO ] Deduced a trap composed of 446 places in 635 ms of which 2 ms to minimize.
[2024-05-31 21:35:14] [INFO ] Deduced a trap composed of 444 places in 600 ms of which 1 ms to minimize.
[2024-05-31 21:35:15] [INFO ] Deduced a trap composed of 428 places in 571 ms of which 1 ms to minimize.
[2024-05-31 21:35:15] [INFO ] Deduced a trap composed of 440 places in 593 ms of which 2 ms to minimize.
[2024-05-31 21:35:16] [INFO ] Deduced a trap composed of 444 places in 567 ms of which 1 ms to minimize.
[2024-05-31 21:35:17] [INFO ] Deduced a trap composed of 436 places in 586 ms of which 1 ms to minimize.
[2024-05-31 21:35:18] [INFO ] Deduced a trap composed of 424 places in 636 ms of which 1 ms to minimize.
[2024-05-31 21:35:18] [INFO ] Deduced a trap composed of 426 places in 603 ms of which 1 ms to minimize.
[2024-05-31 21:35:19] [INFO ] Deduced a trap composed of 444 places in 589 ms of which 1 ms to minimize.
[2024-05-31 21:35:23] [INFO ] Deduced a trap composed of 442 places in 689 ms of which 1 ms to minimize.
[2024-05-31 21:35:25] [INFO ] Deduced a trap composed of 436 places in 720 ms of which 1 ms to minimize.
[2024-05-31 21:35:26] [INFO ] Deduced a trap composed of 440 places in 654 ms of which 1 ms to minimize.
[2024-05-31 21:35:27] [INFO ] Deduced a trap composed of 438 places in 679 ms of which 2 ms to minimize.
[2024-05-31 21:35:32] [INFO ] Deduced a trap composed of 434 places in 601 ms of which 1 ms to minimize.
[2024-05-31 21:35:33] [INFO ] Deduced a trap composed of 448 places in 878 ms of which 1 ms to minimize.
[2024-05-31 21:35:42] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 50861 ms
[2024-05-31 21:35:42] [INFO ] After 51658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:35:42] [INFO ] After 55229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72413 resets, run finished after 9466 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7315 resets, run finished after 1817 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
SDD proceeding with computation,10 properties remain. new max is 262144
SDD size :27362 after 54795
Interrupted probabilistic random walk after 4238195 steps, run timeout after 33001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 4238195 steps, saw 714346 distinct states, run finished after 33001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:36:26] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:36:27] [INFO ] Invariant cache hit.
[2024-05-31 21:36:27] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2024-05-31 21:36:27] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 21:36:27] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:36:27] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2024-05-31 21:36:27] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 21:36:28] [INFO ] After 956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:36:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:36:29] [INFO ] After 791ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:36:29] [INFO ] Deduced a trap composed of 442 places in 638 ms of which 1 ms to minimize.
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 446 places in 598 ms of which 1 ms to minimize.
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 438 places in 615 ms of which 1 ms to minimize.
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 440 places in 570 ms of which 1 ms to minimize.
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 442 places in 582 ms of which 1 ms to minimize.
[2024-05-31 21:36:33] [INFO ] Deduced a trap composed of 446 places in 604 ms of which 1 ms to minimize.
[2024-05-31 21:36:33] [INFO ] Deduced a trap composed of 442 places in 586 ms of which 1 ms to minimize.
[2024-05-31 21:36:34] [INFO ] Deduced a trap composed of 450 places in 502 ms of which 0 ms to minimize.
[2024-05-31 21:36:35] [INFO ] Deduced a trap composed of 440 places in 642 ms of which 1 ms to minimize.
[2024-05-31 21:36:36] [INFO ] Deduced a trap composed of 450 places in 569 ms of which 1 ms to minimize.
[2024-05-31 21:36:37] [INFO ] Deduced a trap composed of 446 places in 618 ms of which 1 ms to minimize.
[2024-05-31 21:36:37] [INFO ] Deduced a trap composed of 444 places in 561 ms of which 1 ms to minimize.
[2024-05-31 21:36:38] [INFO ] Deduced a trap composed of 440 places in 579 ms of which 1 ms to minimize.
[2024-05-31 21:36:39] [INFO ] Deduced a trap composed of 434 places in 567 ms of which 2 ms to minimize.
[2024-05-31 21:36:40] [INFO ] Deduced a trap composed of 434 places in 776 ms of which 1 ms to minimize.
[2024-05-31 21:36:40] [INFO ] Deduced a trap composed of 436 places in 768 ms of which 3 ms to minimize.
[2024-05-31 21:36:41] [INFO ] Deduced a trap composed of 432 places in 737 ms of which 1 ms to minimize.
[2024-05-31 21:36:43] [INFO ] Deduced a trap composed of 448 places in 964 ms of which 1 ms to minimize.
[2024-05-31 21:36:44] [INFO ] Deduced a trap composed of 440 places in 779 ms of which 1 ms to minimize.
[2024-05-31 21:36:45] [INFO ] Deduced a trap composed of 448 places in 757 ms of which 2 ms to minimize.
[2024-05-31 21:36:46] [INFO ] Deduced a trap composed of 444 places in 805 ms of which 1 ms to minimize.
[2024-05-31 21:36:47] [INFO ] Deduced a trap composed of 434 places in 795 ms of which 1 ms to minimize.
[2024-05-31 21:36:48] [INFO ] Deduced a trap composed of 434 places in 799 ms of which 1 ms to minimize.
[2024-05-31 21:36:49] [INFO ] Deduced a trap composed of 441 places in 814 ms of which 1 ms to minimize.
[2024-05-31 21:36:50] [INFO ] Deduced a trap composed of 444 places in 780 ms of which 1 ms to minimize.
[2024-05-31 21:36:51] [INFO ] Deduced a trap composed of 440 places in 743 ms of which 1 ms to minimize.
[2024-05-31 21:36:52] [INFO ] Deduced a trap composed of 444 places in 768 ms of which 1 ms to minimize.
[2024-05-31 21:36:52] [INFO ] Deduced a trap composed of 430 places in 767 ms of which 1 ms to minimize.
[2024-05-31 21:36:54] [INFO ] Deduced a trap composed of 446 places in 792 ms of which 1 ms to minimize.
[2024-05-31 21:36:55] [INFO ] Deduced a trap composed of 444 places in 791 ms of which 1 ms to minimize.
[2024-05-31 21:36:55] [INFO ] Deduced a trap composed of 438 places in 637 ms of which 1 ms to minimize.
[2024-05-31 21:36:57] [INFO ] Deduced a trap composed of 440 places in 630 ms of which 1 ms to minimize.
[2024-05-31 21:37:01] [INFO ] Deduced a trap composed of 446 places in 621 ms of which 1 ms to minimize.
[2024-05-31 21:37:02] [INFO ] Deduced a trap composed of 456 places in 621 ms of which 1 ms to minimize.
[2024-05-31 21:37:03] [INFO ] Deduced a trap composed of 444 places in 636 ms of which 1 ms to minimize.
[2024-05-31 21:37:04] [INFO ] Deduced a trap composed of 440 places in 622 ms of which 1 ms to minimize.
[2024-05-31 21:37:06] [INFO ] Deduced a trap composed of 442 places in 648 ms of which 1 ms to minimize.
[2024-05-31 21:37:06] [INFO ] Deduced a trap composed of 444 places in 626 ms of which 2 ms to minimize.
[2024-05-31 21:37:07] [INFO ] Deduced a trap composed of 460 places in 630 ms of which 2 ms to minimize.
[2024-05-31 21:37:08] [INFO ] Deduced a trap composed of 448 places in 853 ms of which 1 ms to minimize.
[2024-05-31 21:37:09] [INFO ] Deduced a trap composed of 448 places in 617 ms of which 1 ms to minimize.
[2024-05-31 21:37:10] [INFO ] Deduced a trap composed of 446 places in 600 ms of which 1 ms to minimize.
[2024-05-31 21:37:11] [INFO ] Deduced a trap composed of 448 places in 702 ms of which 1 ms to minimize.
[2024-05-31 21:37:14] [INFO ] Deduced a trap composed of 450 places in 688 ms of which 1 ms to minimize.
[2024-05-31 21:37:16] [INFO ] Deduced a trap composed of 448 places in 577 ms of which 2 ms to minimize.
[2024-05-31 21:37:18] [INFO ] Deduced a trap composed of 438 places in 737 ms of which 1 ms to minimize.
[2024-05-31 21:37:20] [INFO ] Deduced a trap composed of 459 places in 714 ms of which 1 ms to minimize.
[2024-05-31 21:37:20] [INFO ] Deduced a trap composed of 444 places in 762 ms of which 1 ms to minimize.
[2024-05-31 21:37:26] [INFO ] Deduced a trap composed of 430 places in 734 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 66347 ms
[2024-05-31 21:37:35] [INFO ] After 67315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:37:35] [INFO ] After 68497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 107 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 110 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2024-05-31 21:37:36] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:37:36] [INFO ] Invariant cache hit.
[2024-05-31 21:37:37] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2024-05-31 21:37:37] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:37:37] [INFO ] Invariant cache hit.
[2024-05-31 21:37:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:37:45] [INFO ] Implicit Places using invariants and state equation in 8488 ms returned []
Implicit Place search using SMT with State Equation took 9738 ms to find 0 implicit places.
[2024-05-31 21:37:45] [INFO ] Redundant transitions in 107 ms returned []
[2024-05-31 21:37:45] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:37:45] [INFO ] Invariant cache hit.
[2024-05-31 21:37:47] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11302 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7189 resets, run finished after 1577 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:37:48] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:37:48] [INFO ] Invariant cache hit.
[2024-05-31 21:37:48] [INFO ] [Real]Absence check using 135 positive place invariants in 27 ms returned sat
[2024-05-31 21:37:49] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 21:37:49] [INFO ] After 548ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:37:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:37:49] [INFO ] After 169ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:37:49] [INFO ] After 312ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:37:49] [INFO ] After 1124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:37:50] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2024-05-31 21:37:50] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-31 21:37:50] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:37:51] [INFO ] After 1004ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:37:52] [INFO ] Deduced a trap composed of 438 places in 569 ms of which 2 ms to minimize.
[2024-05-31 21:37:52] [INFO ] Deduced a trap composed of 444 places in 522 ms of which 1 ms to minimize.
[2024-05-31 21:37:53] [INFO ] Deduced a trap composed of 442 places in 745 ms of which 1 ms to minimize.
[2024-05-31 21:37:54] [INFO ] Deduced a trap composed of 452 places in 791 ms of which 1 ms to minimize.
[2024-05-31 21:37:55] [INFO ] Deduced a trap composed of 440 places in 771 ms of which 1 ms to minimize.
[2024-05-31 21:37:56] [INFO ] Deduced a trap composed of 432 places in 719 ms of which 1 ms to minimize.
[2024-05-31 21:37:57] [INFO ] Deduced a trap composed of 442 places in 590 ms of which 1 ms to minimize.
[2024-05-31 21:37:57] [INFO ] Deduced a trap composed of 450 places in 748 ms of which 1 ms to minimize.
[2024-05-31 21:37:58] [INFO ] Deduced a trap composed of 442 places in 773 ms of which 1 ms to minimize.
[2024-05-31 21:37:59] [INFO ] Deduced a trap composed of 442 places in 717 ms of which 1 ms to minimize.
[2024-05-31 21:38:01] [INFO ] Deduced a trap composed of 444 places in 901 ms of which 1 ms to minimize.
[2024-05-31 21:38:01] [INFO ] Deduced a trap composed of 444 places in 706 ms of which 1 ms to minimize.
[2024-05-31 21:38:02] [INFO ] Deduced a trap composed of 428 places in 774 ms of which 1 ms to minimize.
[2024-05-31 21:38:03] [INFO ] Deduced a trap composed of 446 places in 561 ms of which 1 ms to minimize.
[2024-05-31 21:38:04] [INFO ] Deduced a trap composed of 446 places in 574 ms of which 2 ms to minimize.
[2024-05-31 21:38:05] [INFO ] Deduced a trap composed of 448 places in 569 ms of which 2 ms to minimize.
[2024-05-31 21:38:05] [INFO ] Deduced a trap composed of 444 places in 733 ms of which 1 ms to minimize.
[2024-05-31 21:38:07] [INFO ] Deduced a trap composed of 438 places in 962 ms of which 1 ms to minimize.
[2024-05-31 21:38:08] [INFO ] Deduced a trap composed of 446 places in 775 ms of which 1 ms to minimize.
[2024-05-31 21:38:09] [INFO ] Deduced a trap composed of 444 places in 970 ms of which 1 ms to minimize.
[2024-05-31 21:38:10] [INFO ] Deduced a trap composed of 426 places in 674 ms of which 1 ms to minimize.
[2024-05-31 21:38:11] [INFO ] Deduced a trap composed of 446 places in 506 ms of which 1 ms to minimize.
[2024-05-31 21:38:12] [INFO ] Deduced a trap composed of 436 places in 674 ms of which 1 ms to minimize.
[2024-05-31 21:38:12] [INFO ] Deduced a trap composed of 438 places in 571 ms of which 0 ms to minimize.
[2024-05-31 21:38:13] [INFO ] Deduced a trap composed of 446 places in 599 ms of which 1 ms to minimize.
[2024-05-31 21:38:14] [INFO ] Deduced a trap composed of 452 places in 557 ms of which 1 ms to minimize.
[2024-05-31 21:38:14] [INFO ] Deduced a trap composed of 446 places in 646 ms of which 1 ms to minimize.
[2024-05-31 21:38:15] [INFO ] Deduced a trap composed of 444 places in 708 ms of which 1 ms to minimize.
[2024-05-31 21:38:16] [INFO ] Deduced a trap composed of 446 places in 579 ms of which 1 ms to minimize.
[2024-05-31 21:38:17] [INFO ] Deduced a trap composed of 444 places in 563 ms of which 2 ms to minimize.
[2024-05-31 21:38:18] [INFO ] Deduced a trap composed of 428 places in 558 ms of which 1 ms to minimize.
[2024-05-31 21:38:18] [INFO ] Deduced a trap composed of 440 places in 576 ms of which 1 ms to minimize.
[2024-05-31 21:38:19] [INFO ] Deduced a trap composed of 444 places in 568 ms of which 2 ms to minimize.
[2024-05-31 21:38:20] [INFO ] Deduced a trap composed of 436 places in 616 ms of which 1 ms to minimize.
[2024-05-31 21:38:21] [INFO ] Deduced a trap composed of 424 places in 618 ms of which 1 ms to minimize.
[2024-05-31 21:38:21] [INFO ] Deduced a trap composed of 426 places in 637 ms of which 1 ms to minimize.
[2024-05-31 21:38:22] [INFO ] Deduced a trap composed of 444 places in 640 ms of which 1 ms to minimize.
[2024-05-31 21:38:25] [INFO ] Deduced a trap composed of 442 places in 619 ms of which 1 ms to minimize.
[2024-05-31 21:38:27] [INFO ] Deduced a trap composed of 436 places in 617 ms of which 2 ms to minimize.
[2024-05-31 21:38:29] [INFO ] Deduced a trap composed of 440 places in 629 ms of which 1 ms to minimize.
[2024-05-31 21:38:30] [INFO ] Deduced a trap composed of 438 places in 651 ms of which 1 ms to minimize.
[2024-05-31 21:38:35] [INFO ] Deduced a trap composed of 434 places in 631 ms of which 1 ms to minimize.
[2024-05-31 21:38:36] [INFO ] Deduced a trap composed of 448 places in 612 ms of which 2 ms to minimize.
[2024-05-31 21:38:45] [INFO ] Trap strengthening (SAT) tested/added 43/43 trap constraints in 53776 ms
[2024-05-31 21:38:45] [INFO ] After 54886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:38:45] [INFO ] After 55657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 693 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 312701 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312701 steps, saw 51001 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:38:48] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:38:48] [INFO ] Invariant cache hit.
[2024-05-31 21:38:49] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-31 21:38:49] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-31 21:38:49] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:38:49] [INFO ] [Nat]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-31 21:38:49] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 21:38:50] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:38:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:38:50] [INFO ] After 656ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:38:51] [INFO ] Deduced a trap composed of 446 places in 613 ms of which 1 ms to minimize.
[2024-05-31 21:38:52] [INFO ] Deduced a trap composed of 436 places in 613 ms of which 1 ms to minimize.
[2024-05-31 21:38:52] [INFO ] Deduced a trap composed of 448 places in 589 ms of which 1 ms to minimize.
[2024-05-31 21:38:53] [INFO ] Deduced a trap composed of 448 places in 604 ms of which 1 ms to minimize.
[2024-05-31 21:38:54] [INFO ] Deduced a trap composed of 444 places in 599 ms of which 1 ms to minimize.
[2024-05-31 21:38:55] [INFO ] Deduced a trap composed of 452 places in 582 ms of which 1 ms to minimize.
[2024-05-31 21:38:55] [INFO ] Deduced a trap composed of 440 places in 538 ms of which 1 ms to minimize.
[2024-05-31 21:38:56] [INFO ] Deduced a trap composed of 432 places in 500 ms of which 2 ms to minimize.
[2024-05-31 21:38:56] [INFO ] Deduced a trap composed of 442 places in 473 ms of which 1 ms to minimize.
[2024-05-31 21:38:57] [INFO ] Deduced a trap composed of 446 places in 509 ms of which 1 ms to minimize.
[2024-05-31 21:38:57] [INFO ] Deduced a trap composed of 436 places in 510 ms of which 1 ms to minimize.
[2024-05-31 21:38:58] [INFO ] Deduced a trap composed of 434 places in 497 ms of which 1 ms to minimize.
[2024-05-31 21:38:59] [INFO ] Deduced a trap composed of 436 places in 557 ms of which 2 ms to minimize.
[2024-05-31 21:38:59] [INFO ] Deduced a trap composed of 452 places in 556 ms of which 1 ms to minimize.
[2024-05-31 21:39:00] [INFO ] Deduced a trap composed of 444 places in 619 ms of which 1 ms to minimize.
[2024-05-31 21:39:01] [INFO ] Deduced a trap composed of 434 places in 591 ms of which 1 ms to minimize.
[2024-05-31 21:39:01] [INFO ] Deduced a trap composed of 430 places in 639 ms of which 1 ms to minimize.
[2024-05-31 21:39:02] [INFO ] Deduced a trap composed of 440 places in 583 ms of which 0 ms to minimize.
[2024-05-31 21:39:03] [INFO ] Deduced a trap composed of 444 places in 581 ms of which 1 ms to minimize.
[2024-05-31 21:39:03] [INFO ] Deduced a trap composed of 438 places in 580 ms of which 1 ms to minimize.
[2024-05-31 21:39:04] [INFO ] Deduced a trap composed of 448 places in 579 ms of which 1 ms to minimize.
[2024-05-31 21:39:05] [INFO ] Deduced a trap composed of 430 places in 597 ms of which 1 ms to minimize.
[2024-05-31 21:39:05] [INFO ] Deduced a trap composed of 454 places in 569 ms of which 1 ms to minimize.
[2024-05-31 21:39:06] [INFO ] Deduced a trap composed of 450 places in 550 ms of which 1 ms to minimize.
[2024-05-31 21:39:07] [INFO ] Deduced a trap composed of 442 places in 577 ms of which 1 ms to minimize.
[2024-05-31 21:39:09] [INFO ] Deduced a trap composed of 450 places in 734 ms of which 1 ms to minimize.
[2024-05-31 21:39:10] [INFO ] Deduced a trap composed of 450 places in 722 ms of which 1 ms to minimize.
[2024-05-31 21:39:11] [INFO ] Deduced a trap composed of 440 places in 767 ms of which 1 ms to minimize.
[2024-05-31 21:39:12] [INFO ] Deduced a trap composed of 448 places in 762 ms of which 1 ms to minimize.
[2024-05-31 21:39:13] [INFO ] Deduced a trap composed of 440 places in 778 ms of which 2 ms to minimize.
[2024-05-31 21:39:14] [INFO ] Trap strengthening (SAT) tested/added 30/30 trap constraints in 23457 ms
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.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:256)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 21:39:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 21:39:14] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 156 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2024-05-31 21:39:14] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:39:14] [INFO ] Invariant cache hit.
[2024-05-31 21:39:26] [INFO ] Dead Transitions using invariants and state equation in 12449 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12613 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 10000 steps, including 727 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 323763 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323763 steps, saw 52700 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:39:29] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:39:29] [INFO ] Invariant cache hit.
[2024-05-31 21:39:30] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2024-05-31 21:39:30] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 21:39:30] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:39:30] [INFO ] [Nat]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-31 21:39:30] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 21:39:31] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:39:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:39:31] [INFO ] After 570ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:39:32] [INFO ] Deduced a trap composed of 446 places in 960 ms of which 2 ms to minimize.
[2024-05-31 21:39:33] [INFO ] Deduced a trap composed of 436 places in 632 ms of which 1 ms to minimize.
[2024-05-31 21:39:34] [INFO ] Deduced a trap composed of 448 places in 740 ms of which 1 ms to minimize.
[2024-05-31 21:39:35] [INFO ] Deduced a trap composed of 448 places in 727 ms of which 1 ms to minimize.
[2024-05-31 21:39:36] [INFO ] Deduced a trap composed of 444 places in 782 ms of which 2 ms to minimize.
[2024-05-31 21:39:37] [INFO ] Deduced a trap composed of 452 places in 715 ms of which 2 ms to minimize.
[2024-05-31 21:39:37] [INFO ] Deduced a trap composed of 440 places in 778 ms of which 5 ms to minimize.
[2024-05-31 21:39:38] [INFO ] Deduced a trap composed of 432 places in 731 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 442 places in 765 ms of which 1 ms to minimize.
[2024-05-31 21:39:40] [INFO ] Deduced a trap composed of 446 places in 711 ms of which 1 ms to minimize.
[2024-05-31 21:39:41] [INFO ] Deduced a trap composed of 436 places in 752 ms of which 1 ms to minimize.
[2024-05-31 21:39:41] [INFO ] Deduced a trap composed of 434 places in 600 ms of which 1 ms to minimize.
[2024-05-31 21:39:42] [INFO ] Deduced a trap composed of 436 places in 508 ms of which 1 ms to minimize.
[2024-05-31 21:39:43] [INFO ] Deduced a trap composed of 452 places in 710 ms of which 1 ms to minimize.
[2024-05-31 21:39:44] [INFO ] Deduced a trap composed of 444 places in 602 ms of which 1 ms to minimize.
[2024-05-31 21:39:44] [INFO ] Deduced a trap composed of 434 places in 629 ms of which 1 ms to minimize.
[2024-05-31 21:39:45] [INFO ] Deduced a trap composed of 430 places in 675 ms of which 1 ms to minimize.
[2024-05-31 21:39:46] [INFO ] Deduced a trap composed of 440 places in 974 ms of which 1 ms to minimize.
[2024-05-31 21:39:47] [INFO ] Deduced a trap composed of 444 places in 765 ms of which 1 ms to minimize.
[2024-05-31 21:39:48] [INFO ] Deduced a trap composed of 438 places in 765 ms of which 1 ms to minimize.
[2024-05-31 21:39:49] [INFO ] Deduced a trap composed of 448 places in 628 ms of which 1 ms to minimize.
[2024-05-31 21:39:50] [INFO ] Deduced a trap composed of 430 places in 749 ms of which 1 ms to minimize.
[2024-05-31 21:39:51] [INFO ] Deduced a trap composed of 454 places in 766 ms of which 1 ms to minimize.
[2024-05-31 21:39:51] [INFO ] Deduced a trap composed of 450 places in 731 ms of which 1 ms to minimize.
[2024-05-31 21:39:53] [INFO ] Deduced a trap composed of 442 places in 940 ms of which 1 ms to minimize.
[2024-05-31 21:39:55] [INFO ] Deduced a trap composed of 450 places in 587 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:256)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 21:39:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 21:39:55] [INFO ] After 25375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 99 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 115 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2024-05-31 21:39:55] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:39:55] [INFO ] Invariant cache hit.
[2024-05-31 21:39:56] [INFO ] Implicit Places using invariants in 990 ms returned []
[2024-05-31 21:39:56] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:39:56] [INFO ] Invariant cache hit.
[2024-05-31 21:39:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:40:07] [INFO ] Implicit Places using invariants and state equation in 10763 ms returned []
Implicit Place search using SMT with State Equation took 11787 ms to find 0 implicit places.
[2024-05-31 21:40:07] [INFO ] Redundant transitions in 64 ms returned []
[2024-05-31 21:40:07] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 21:40:07] [INFO ] Invariant cache hit.
[2024-05-31 21:40:09] [INFO ] Dead Transitions using invariants and state equation in 1764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13744 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 369 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2040 rows 1078 cols
[2024-05-31 21:40:09] [INFO ] Computed 142 invariants in 86 ms
[2024-05-31 21:40:10] [INFO ] [Real]Absence check using 135 positive place invariants in 23 ms returned sat
[2024-05-31 21:40:10] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-31 21:40:10] [INFO ] After 466ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:40:11] [INFO ] Deduced a trap composed of 436 places in 564 ms of which 2 ms to minimize.
[2024-05-31 21:40:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 704 ms
[2024-05-31 21:40:11] [INFO ] After 1227ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:40:11] [INFO ] After 1382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:40:11] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2024-05-31 21:40:11] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-31 21:40:12] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:40:12] [INFO ] Deduced a trap composed of 436 places in 502 ms of which 1 ms to minimize.
[2024-05-31 21:40:13] [INFO ] Deduced a trap composed of 430 places in 511 ms of which 1 ms to minimize.
[2024-05-31 21:40:13] [INFO ] Deduced a trap composed of 444 places in 519 ms of which 0 ms to minimize.
[2024-05-31 21:40:14] [INFO ] Deduced a trap composed of 450 places in 584 ms of which 1 ms to minimize.
[2024-05-31 21:40:15] [INFO ] Deduced a trap composed of 448 places in 591 ms of which 2 ms to minimize.
[2024-05-31 21:40:15] [INFO ] Deduced a trap composed of 446 places in 585 ms of which 1 ms to minimize.
[2024-05-31 21:40:16] [INFO ] Deduced a trap composed of 438 places in 582 ms of which 1 ms to minimize.
[2024-05-31 21:40:17] [INFO ] Deduced a trap composed of 434 places in 804 ms of which 2 ms to minimize.
[2024-05-31 21:40:19] [INFO ] Deduced a trap composed of 448 places in 884 ms of which 1 ms to minimize.
[2024-05-31 21:40:19] [INFO ] Deduced a trap composed of 440 places in 696 ms of which 1 ms to minimize.
[2024-05-31 21:40:20] [INFO ] Deduced a trap composed of 438 places in 556 ms of which 1 ms to minimize.
[2024-05-31 21:40:21] [INFO ] Deduced a trap composed of 444 places in 659 ms of which 1 ms to minimize.
[2024-05-31 21:40:22] [INFO ] Deduced a trap composed of 440 places in 664 ms of which 1 ms to minimize.
[2024-05-31 21:40:22] [INFO ] Deduced a trap composed of 434 places in 510 ms of which 1 ms to minimize.
[2024-05-31 21:40:23] [INFO ] Deduced a trap composed of 446 places in 558 ms of which 1 ms to minimize.
[2024-05-31 21:40:24] [INFO ] Deduced a trap composed of 442 places in 704 ms of which 1 ms to minimize.
[2024-05-31 21:40:25] [INFO ] Deduced a trap composed of 432 places in 705 ms of which 1 ms to minimize.
[2024-05-31 21:40:25] [INFO ] Deduced a trap composed of 446 places in 727 ms of which 1 ms to minimize.
[2024-05-31 21:40:26] [INFO ] Deduced a trap composed of 444 places in 725 ms of which 1 ms to minimize.
[2024-05-31 21:40:27] [INFO ] Deduced a trap composed of 440 places in 668 ms of which 1 ms to minimize.
[2024-05-31 21:40:28] [INFO ] Deduced a trap composed of 434 places in 721 ms of which 0 ms to minimize.
[2024-05-31 21:40:29] [INFO ] Deduced a trap composed of 446 places in 681 ms of which 1 ms to minimize.
[2024-05-31 21:40:30] [INFO ] Deduced a trap composed of 436 places in 667 ms of which 1 ms to minimize.
[2024-05-31 21:40:30] [INFO ] Deduced a trap composed of 452 places in 684 ms of which 1 ms to minimize.
[2024-05-31 21:40:31] [INFO ] Deduced a trap composed of 442 places in 719 ms of which 1 ms to minimize.
[2024-05-31 21:40:32] [INFO ] Deduced a trap composed of 432 places in 892 ms of which 1 ms to minimize.
[2024-05-31 21:40:33] [INFO ] Deduced a trap composed of 438 places in 718 ms of which 1 ms to minimize.
[2024-05-31 21:40:34] [INFO ] Deduced a trap composed of 438 places in 712 ms of which 1 ms to minimize.
[2024-05-31 21:40:35] [INFO ] Deduced a trap composed of 446 places in 510 ms of which 1 ms to minimize.
[2024-05-31 21:40:36] [INFO ] Deduced a trap composed of 422 places in 621 ms of which 1 ms to minimize.
[2024-05-31 21:40:37] [INFO ] Deduced a trap composed of 438 places in 668 ms of which 1 ms to minimize.
[2024-05-31 21:40:38] [INFO ] Deduced a trap composed of 436 places in 610 ms of which 2 ms to minimize.
[2024-05-31 21:40:38] [INFO ] Deduced a trap composed of 434 places in 590 ms of which 2 ms to minimize.
[2024-05-31 21:40:40] [INFO ] Deduced a trap composed of 434 places in 705 ms of which 1 ms to minimize.
[2024-05-31 21:40:40] [INFO ] Deduced a trap composed of 428 places in 583 ms of which 1 ms to minimize.
[2024-05-31 21:40:41] [INFO ] Deduced a trap composed of 440 places in 548 ms of which 1 ms to minimize.
[2024-05-31 21:40:41] [INFO ] Deduced a trap composed of 422 places in 483 ms of which 0 ms to minimize.
[2024-05-31 21:40:42] [INFO ] Deduced a trap composed of 430 places in 497 ms of which 1 ms to minimize.
[2024-05-31 21:40:43] [INFO ] Deduced a trap composed of 426 places in 516 ms of which 0 ms to minimize.
[2024-05-31 21:40:43] [INFO ] Deduced a trap composed of 430 places in 528 ms of which 1 ms to minimize.
[2024-05-31 21:40:44] [INFO ] Deduced a trap composed of 432 places in 512 ms of which 1 ms to minimize.
[2024-05-31 21:40:44] [INFO ] Deduced a trap composed of 434 places in 489 ms of which 1 ms to minimize.
[2024-05-31 21:40:45] [INFO ] Deduced a trap composed of 422 places in 481 ms of which 3 ms to minimize.
[2024-05-31 21:40:46] [INFO ] Deduced a trap composed of 457 places in 519 ms of which 1 ms to minimize.
[2024-05-31 21:40:47] [INFO ] Deduced a trap composed of 432 places in 726 ms of which 1 ms to minimize.
[2024-05-31 21:40:49] [INFO ] Deduced a trap composed of 438 places in 894 ms of which 1 ms to minimize.
[2024-05-31 21:40:53] [INFO ] Deduced a trap composed of 426 places in 534 ms of which 1 ms to minimize.
[2024-05-31 21:40:53] [INFO ] Deduced a trap composed of 428 places in 532 ms of which 1 ms to minimize.
[2024-05-31 21:40:54] [INFO ] Deduced a trap composed of 432 places in 541 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2024-05-31 21:40:55] [INFO ] Flatten gal took : 252 ms
[2024-05-31 21:40:55] [INFO ] Applying decomposition
[2024-05-31 21:40:55] [INFO ] Flatten gal took : 343 ms
[2024-05-31 21:40:55] [INFO ] Deduced a trap composed of 428 places in 1178 ms of which 1 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13614333310132415775.txt' '-o' '/tmp/graph13614333310132415775.bin' '-w' '/tmp/graph13614333310132415775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13614333310132415775.bin' '-l' '-1' '-v' '-w' '/tmp/graph13614333310132415775.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:40:56] [INFO ] Decomposing Gal with order
[2024-05-31 21:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:40:56] [INFO ] Deduced a trap composed of 434 places in 684 ms of which 9 ms to minimize.
[2024-05-31 21:40:57] [INFO ] Removed a total of 2581 redundant transitions.
[2024-05-31 21:40:57] [INFO ] Flatten gal took : 676 ms
[2024-05-31 21:40:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 862 labels/synchronizations in 135 ms.
[2024-05-31 21:40:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11565496101702348023.gal : 56 ms
[2024-05-31 21:40:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3163234191225916979.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11565496101702348023.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3163234191225916979.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-31 21:40:58] [INFO ] Deduced a trap composed of 426 places in 1424 ms of which 1 ms to minimize.
Loading property file /tmp/ReachabilityCardinality3163234191225916979.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 2
[2024-05-31 21:40:59] [INFO ] Deduced a trap composed of 430 places in 587 ms of which 1 ms to minimize.
[2024-05-31 21:41:00] [INFO ] Deduced a trap composed of 434 places in 579 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2 after 6212
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6212 after 6218
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6218 after 6224
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6224 after 6266
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6266 after 6278
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6278 after 6341
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6341 after 6388
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.13043e+07 after 1.54725e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.54725e+08 after 2.60238e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.60238e+08 after 2.6026e+08
[2024-05-31 21:43:56] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 224128 ms
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.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:256)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 21:43:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 21:43:56] [INFO ] After 225042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 311 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
[2024-05-31 21:43:56] [INFO ] Invariant cache hit.
[2024-05-31 21:43:57] [INFO ] [Real]Absence check using 135 positive place invariants in 635 ms returned sat
[2024-05-31 21:43:57] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 40 ms returned sat
[2024-05-31 21:43:57] [INFO ] After 1025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:43:57] [INFO ] [Nat]Absence check using 135 positive place invariants in 32 ms returned sat
[2024-05-31 21:43:57] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 35 ms returned sat
[2024-05-31 21:43:58] [INFO ] After 972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:43:59] [INFO ] Deduced a trap composed of 420 places in 588 ms of which 1 ms to minimize.
[2024-05-31 21:44:00] [INFO ] Deduced a trap composed of 440 places in 469 ms of which 1 ms to minimize.
[2024-05-31 21:44:00] [INFO ] Deduced a trap composed of 446 places in 486 ms of which 1 ms to minimize.
[2024-05-31 21:44:01] [INFO ] Deduced a trap composed of 432 places in 573 ms of which 1 ms to minimize.
[2024-05-31 21:44:01] [INFO ] Deduced a trap composed of 436 places in 550 ms of which 1 ms to minimize.
[2024-05-31 21:44:02] [INFO ] Deduced a trap composed of 438 places in 544 ms of which 1 ms to minimize.
[2024-05-31 21:44:03] [INFO ] Deduced a trap composed of 438 places in 502 ms of which 1 ms to minimize.
[2024-05-31 21:44:03] [INFO ] Deduced a trap composed of 438 places in 664 ms of which 1 ms to minimize.
[2024-05-31 21:44:04] [INFO ] Deduced a trap composed of 448 places in 738 ms of which 1 ms to minimize.
[2024-05-31 21:44:05] [INFO ] Deduced a trap composed of 442 places in 742 ms of which 10 ms to minimize.
[2024-05-31 21:44:06] [INFO ] Deduced a trap composed of 444 places in 693 ms of which 2 ms to minimize.
[2024-05-31 21:44:07] [INFO ] Deduced a trap composed of 438 places in 650 ms of which 1 ms to minimize.
[2024-05-31 21:44:07] [INFO ] Deduced a trap composed of 432 places in 689 ms of which 1 ms to minimize.
[2024-05-31 21:44:08] [INFO ] Deduced a trap composed of 436 places in 652 ms of which 1 ms to minimize.
[2024-05-31 21:44:09] [INFO ] Deduced a trap composed of 430 places in 774 ms of which 1 ms to minimize.
[2024-05-31 21:44:10] [INFO ] Deduced a trap composed of 449 places in 638 ms of which 1 ms to minimize.
[2024-05-31 21:44:10] [INFO ] Deduced a trap composed of 442 places in 637 ms of which 1 ms to minimize.
[2024-05-31 21:44:11] [INFO ] Deduced a trap composed of 442 places in 674 ms of which 1 ms to minimize.
[2024-05-31 21:44:12] [INFO ] Deduced a trap composed of 438 places in 681 ms of which 1 ms to minimize.
[2024-05-31 21:44:13] [INFO ] Deduced a trap composed of 434 places in 707 ms of which 1 ms to minimize.
[2024-05-31 21:44:13] [INFO ] Deduced a trap composed of 428 places in 662 ms of which 1 ms to minimize.
[2024-05-31 21:44:14] [INFO ] Deduced a trap composed of 442 places in 659 ms of which 1 ms to minimize.
[2024-05-31 21:44:15] [INFO ] Deduced a trap composed of 438 places in 625 ms of which 1 ms to minimize.
[2024-05-31 21:44:16] [INFO ] Deduced a trap composed of 434 places in 661 ms of which 0 ms to minimize.
[2024-05-31 21:44:16] [INFO ] Deduced a trap composed of 452 places in 660 ms of which 1 ms to minimize.
[2024-05-31 21:44:17] [INFO ] Deduced a trap composed of 440 places in 656 ms of which 1 ms to minimize.
[2024-05-31 21:44:18] [INFO ] Deduced a trap composed of 446 places in 651 ms of which 1 ms to minimize.
[2024-05-31 21:44:18] [INFO ] Deduced a trap composed of 440 places in 688 ms of which 1 ms to minimize.
[2024-05-31 21:44:19] [INFO ] Deduced a trap composed of 442 places in 660 ms of which 1 ms to minimize.
[2024-05-31 21:44:20] [INFO ] Deduced a trap composed of 436 places in 658 ms of which 1 ms to minimize.
[2024-05-31 21:44:21] [INFO ] Deduced a trap composed of 438 places in 654 ms of which 1 ms to minimize.
[2024-05-31 21:44:21] [INFO ] Deduced a trap composed of 452 places in 686 ms of which 1 ms to minimize.
[2024-05-31 21:44:22] [INFO ] Deduced a trap composed of 438 places in 644 ms of which 1 ms to minimize.
[2024-05-31 21:44:23] [INFO ] Deduced a trap composed of 444 places in 657 ms of which 1 ms to minimize.
[2024-05-31 21:44:24] [INFO ] Deduced a trap composed of 444 places in 644 ms of which 1 ms to minimize.
[2024-05-31 21:44:24] [INFO ] Deduced a trap composed of 448 places in 692 ms of which 1 ms to minimize.
[2024-05-31 21:44:25] [INFO ] Deduced a trap composed of 436 places in 660 ms of which 1 ms to minimize.
[2024-05-31 21:44:26] [INFO ] Deduced a trap composed of 440 places in 665 ms of which 1 ms to minimize.
[2024-05-31 21:44:26] [INFO ] Deduced a trap composed of 440 places in 651 ms of which 1 ms to minimize.
[2024-05-31 21:44:27] [INFO ] Deduced a trap composed of 442 places in 664 ms of which 1 ms to minimize.
[2024-05-31 21:44:28] [INFO ] Deduced a trap composed of 432 places in 658 ms of which 1 ms to minimize.
[2024-05-31 21:44:29] [INFO ] Deduced a trap composed of 432 places in 657 ms of which 1 ms to minimize.
[2024-05-31 21:44:29] [INFO ] Deduced a trap composed of 442 places in 677 ms of which 0 ms to minimize.
[2024-05-31 21:44:30] [INFO ] Deduced a trap composed of 438 places in 649 ms of which 1 ms to minimize.
[2024-05-31 21:44:31] [INFO ] Deduced a trap composed of 442 places in 652 ms of which 1 ms to minimize.
[2024-05-31 21:44:31] [INFO ] Deduced a trap composed of 444 places in 682 ms of which 1 ms to minimize.
[2024-05-31 21:44:32] [INFO ] Deduced a trap composed of 432 places in 617 ms of which 1 ms to minimize.
[2024-05-31 21:44:33] [INFO ] Deduced a trap composed of 434 places in 656 ms of which 1 ms to minimize.
[2024-05-31 21:44:33] [INFO ] Deduced a trap composed of 432 places in 648 ms of which 1 ms to minimize.
[2024-05-31 21:44:34] [INFO ] Deduced a trap composed of 440 places in 691 ms of which 1 ms to minimize.
[2024-05-31 21:44:35] [INFO ] Deduced a trap composed of 436 places in 669 ms of which 1 ms to minimize.
[2024-05-31 21:44:37] [INFO ] Deduced a trap composed of 436 places in 659 ms of which 1 ms to minimize.
[2024-05-31 21:44:44] [INFO ] Deduced a trap composed of 432 places in 747 ms of which 1 ms to minimize.
[2024-05-31 21:44:48] [INFO ] Deduced a trap composed of 446 places in 628 ms of which 1 ms to minimize.
[2024-05-31 21:44:49] [INFO ] Deduced a trap composed of 444 places in 656 ms of which 1 ms to minimize.
[2024-05-31 21:44:49] [INFO ] Deduced a trap composed of 450 places in 686 ms of which 1 ms to minimize.
[2024-05-31 21:44:58] [INFO ] Trap strengthening (SAT) tested/added 56/56 trap constraints in 59962 ms
[2024-05-31 21:45:00] [INFO ] After 62349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:45:00] [INFO ] After 62569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 21:45:00] [INFO ] Flatten gal took : 188 ms
[2024-05-31 21:45:00] [INFO ] Flatten gal took : 155 ms
[2024-05-31 21:45:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability105923412100278069.gal : 29 ms
[2024-05-31 21:45:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability18057474724008922669.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability105923412100278069.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability18057474724008922669.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability18057474724008922669.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
Detected timeout of ITS tools.
[2024-05-31 21:45:03] [INFO ] Flatten gal took : 137 ms
[2024-05-31 21:45:03] [INFO ] Applying decomposition
[2024-05-31 21:45:04] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13099453337174596898.txt' '-o' '/tmp/graph13099453337174596898.bin' '-w' '/tmp/graph13099453337174596898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13099453337174596898.bin' '-l' '-1' '-v' '-w' '/tmp/graph13099453337174596898.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:45:04] [INFO ] Decomposing Gal with order
[2024-05-31 21:45:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:45:04] [INFO ] Removed a total of 4060 redundant transitions.
[2024-05-31 21:45:04] [INFO ] Flatten gal took : 355 ms
[2024-05-31 21:45:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 561 labels/synchronizations in 61 ms.
[2024-05-31 21:45:05] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17663233716319058209.gal : 28 ms
[2024-05-31 21:45:05] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2486346828909084002.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17663233716319058209.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2486346828909084002.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability2486346828909084002.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15581120772344752693
[2024-05-31 21:45:08] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15581120772344752693
Running compilation step : cd /tmp/ltsmin15581120772344752693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15581120772344752693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15581120772344752693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 21:45:10] [INFO ] Flatten gal took : 132 ms
[2024-05-31 21:45:10] [INFO ] Flatten gal took : 82 ms
[2024-05-31 21:45:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18195939629120489325.gal : 13 ms
[2024-05-31 21:45:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7591780302338919825.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability18195939629120489325.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7591780302338919825.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability7591780302338919825.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
Detected timeout of ITS tools.
[2024-05-31 21:45:40] [INFO ] Flatten gal took : 59 ms
[2024-05-31 21:45:40] [INFO ] Applying decomposition
[2024-05-31 21:45:40] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5626758416279727575.txt' '-o' '/tmp/graph5626758416279727575.bin' '-w' '/tmp/graph5626758416279727575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5626758416279727575.bin' '-l' '-1' '-v' '-w' '/tmp/graph5626758416279727575.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:45:40] [INFO ] Decomposing Gal with order
[2024-05-31 21:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:45:41] [INFO ] Removed a total of 4060 redundant transitions.
[2024-05-31 21:45:41] [INFO ] Flatten gal took : 279 ms
[2024-05-31 21:45:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 563 labels/synchronizations in 34 ms.
[2024-05-31 21:45:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6388280098746086306.gal : 13 ms
[2024-05-31 21:45:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13704772922993155352.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6388280098746086306.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13704772922993155352.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability13704772922993155352.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8222314193333603008
[2024-05-31 21:46:11] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8222314193333603008
Running compilation step : cd /tmp/ltsmin8222314193333603008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 4184 ms.
Running link step : cd /tmp/ltsmin8222314193333603008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin8222314193333603008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 21:46:41] [INFO ] Flatten gal took : 60 ms
[2024-05-31 21:46:41] [INFO ] Flatten gal took : 58 ms
[2024-05-31 21:46:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability460241735257156205.gal : 10 ms
[2024-05-31 21:46:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2894391091968635743.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability460241735257156205.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2894391091968635743.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityFireability2894391091968635743.prop.
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :2.6026e+08 after 2.60432e+08
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10655 after 39935
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39935 after 52601
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52601 after 256335
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.60432e+08 after 2.60468e+08
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2024-05-31 21:51:42] [INFO ] Flatten gal took : 112 ms
[2024-05-31 21:51:42] [INFO ] Applying decomposition
[2024-05-31 21:51:42] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18237274499897030356.txt' '-o' '/tmp/graph18237274499897030356.bin' '-w' '/tmp/graph18237274499897030356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18237274499897030356.bin' '-l' '-1' '-v' '-w' '/tmp/graph18237274499897030356.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:51:42] [INFO ] Decomposing Gal with order
[2024-05-31 21:51:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:51:42] [INFO ] Removed a total of 2159 redundant transitions.
[2024-05-31 21:51:42] [INFO ] Flatten gal took : 212 ms
[2024-05-31 21:51:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 21 ms.
[2024-05-31 21:51:42] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9147492300783772826.gal : 19 ms
[2024-05-31 21:51:42] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12210890261064493178.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability9147492300783772826.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12210890261064493178.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability12210890261064493178.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1 after 2095
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2095 after 2213
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2213 after 2520
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2520 after 3344
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2710894173381329932
[2024-05-31 21:56:43] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2710894173381329932
Running compilation step : cd /tmp/ltsmin2710894173381329932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 4236 ms.
Running link step : cd /tmp/ltsmin2710894173381329932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2710894173381329932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.119: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.137: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.140: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.147: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.255: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.255: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.256: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.256: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.255: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.259: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.258: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.255: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.262: There are 2062 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.262: State length is 1090, there are 2061 groups
pins2lts-mc-linux64( 0/ 8), 0.263: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.263: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.263: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.263: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.196: ~6 levels ~960 states ~7520 transitions
pins2lts-mc-linux64( 2/ 8), 1.550: ~4 levels ~1920 states ~8104 transitions
pins2lts-mc-linux64( 6/ 8), 2.659: ~5 levels ~3840 states ~136048 transitions
pins2lts-mc-linux64( 6/ 8), 4.052: ~5 levels ~7680 states ~370288 transitions
pins2lts-mc-linux64( 2/ 8), 6.587: ~6 levels ~15360 states ~738360 transitions
pins2lts-mc-linux64( 2/ 8), 9.449: ~6 levels ~30720 states ~1333280 transitions
pins2lts-mc-linux64( 2/ 8), 14.876: ~6 levels ~61440 states ~1972152 transitions
pins2lts-mc-linux64( 2/ 8), 19.130: ~6 levels ~122880 states ~2211144 transitions
pins2lts-mc-linux64( 2/ 8), 26.159: ~6 levels ~245760 states ~2688168 transitions
pins2lts-mc-linux64( 2/ 8), 40.137: ~7 levels ~491520 states ~3445896 transitions
pins2lts-mc-linux64( 0/ 8), 76.032: ~9 levels ~983040 states ~15783504 transitions
pins2lts-mc-linux64( 4/ 8), 94.982: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 97.706:
pins2lts-mc-linux64( 0/ 8), 97.706: mean standard work distribution: 8.5% (states) 29.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 97.706:
pins2lts-mc-linux64( 0/ 8), 97.706: Explored 1040695 states 40763821 transitions, fanout: 39.170
pins2lts-mc-linux64( 0/ 8), 97.706: Total exploration time 97.430 sec (94.720 sec minimum, 95.691 sec on average)
pins2lts-mc-linux64( 0/ 8), 97.706: States per second: 10681, Transitions per second: 418391
pins2lts-mc-linux64( 0/ 8), 97.706:
pins2lts-mc-linux64( 0/ 8), 97.706: Queue width: 8B, total height: 15154550, memory: 115.62MB
pins2lts-mc-linux64( 0/ 8), 97.706: Tree memory: 380.1MB, 24.5 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 97.706: Tree fill ratio (roots/leafs): 12.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 97.706: Stored 2140 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 97.706: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 97.706: Est. total memory use: 495.7MB (~1139.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2710894173381329932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2710894173381329932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 21:58:25] [INFO ] Flatten gal took : 128 ms
[2024-05-31 21:58:25] [INFO ] Flatten gal took : 116 ms
[2024-05-31 21:58:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5151886113175113096.gal : 15 ms
[2024-05-31 21:58:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13616909098525134996.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5151886113175113096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13616909098525134996.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability13616909098525134996.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 5155
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5155 after 6673
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6673 after 8683
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8683 after 10655
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10655 after 39935
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :39935 after 52601
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :52601 after 256335
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393356 kB
MemFree: 10537520 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16091676 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="PolyORBNT-COL-S10J60"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-COL-S10J60, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r308-tajo-171654461500267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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