./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:53:49,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:53:49,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:53:49,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:53:49,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:53:49,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:53:49,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:53:49,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:53:49,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:53:49,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:53:49,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:53:49,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:53:49,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:53:49,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:53:49,185 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:53:49,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:53:49,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:53:49,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:53:49,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:53:49,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:53:49,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:53:49,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:53:49,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:53:49,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:53:49,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:53:49,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:53:49,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:53:49,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:53:49,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:53:49,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:53:49,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:53:49,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:53:49,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:53:49,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:53:49,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:53:49,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:53:49,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:53:49,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:53:49,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:53:49,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:53:49,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:53:49,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:53:49,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 [2024-11-19 01:53:49,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:53:49,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:53:49,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:53:49,473 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:53:49,473 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:53:49,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-11-19 01:53:50,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:53:51,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:53:51,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-11-19 01:53:51,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73291eaf/42944c19495d4928809e8e413b6202d8/FLAG45cbdeade [2024-11-19 01:53:51,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73291eaf/42944c19495d4928809e8e413b6202d8 [2024-11-19 01:53:51,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:53:51,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:53:51,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:53:51,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:53:51,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:53:51,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc259f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51, skipping insertion in model container [2024-11-19 01:53:51,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:53:51,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-11-19 01:53:51,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:53:51,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:53:51,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-11-19 01:53:51,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:53:51,403 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:53:51,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51 WrapperNode [2024-11-19 01:53:51,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:53:51,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:53:51,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:53:51,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:53:51,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,447 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-11-19 01:53:51,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:53:51,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:53:51,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:53:51,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:53:51,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,483 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 01:53:51,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:53:51,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:53:51,496 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:53:51,496 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:53:51,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (1/1) ... [2024-11-19 01:53:51,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:53:51,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:53:51,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:53:51,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:53:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:53:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 01:53:51,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 01:53:51,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 01:53:51,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 01:53:51,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 01:53:51,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 01:53:51,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 01:53:51,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 01:53:51,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:53:51,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 01:53:51,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 01:53:51,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:53:51,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:53:51,577 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:53:51,672 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:53:51,674 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:53:51,934 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:53:51,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:53:52,129 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:53:52,130 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 01:53:52,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:53:52 BoogieIcfgContainer [2024-11-19 01:53:52,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:53:52,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:53:52,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:53:52,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:53:52,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:53:51" (1/3) ... [2024-11-19 01:53:52,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5482f92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:53:52, skipping insertion in model container [2024-11-19 01:53:52,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:53:51" (2/3) ... [2024-11-19 01:53:52,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5482f92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:53:52, skipping insertion in model container [2024-11-19 01:53:52,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:53:52" (3/3) ... [2024-11-19 01:53:52,139 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-11-19 01:53:52,150 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:53:52,151 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:53:52,151 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:53:52,212 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 01:53:52,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 100 flow [2024-11-19 01:53:52,290 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2024-11-19 01:53:52,290 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 01:53:52,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 32 events. 4/32 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2024-11-19 01:53:52,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 36 transitions, 100 flow [2024-11-19 01:53:52,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2024-11-19 01:53:52,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:53:52,344 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@780e2132, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:53:52,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 01:53:52,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:53:52,367 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-11-19 01:53:52,369 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 01:53:52,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:52,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:52,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:52,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1863071349, now seen corresponding path program 1 times [2024-11-19 01:53:52,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286263407] [2024-11-19 01:53:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:53:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:53:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286263407] [2024-11-19 01:53:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286263407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:53:52,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:53:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:53:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520943767] [2024-11-19 01:53:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:52,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:53:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:52,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:53:52,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:53:52,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-11-19 01:53:52,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:52,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:52,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-11-19 01:53:52,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:53,075 INFO L124 PetriNetUnfolderBase]: 1184/1704 cut-off events. [2024-11-19 01:53:53,079 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-19 01:53:53,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1704 events. 1184/1704 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7289 event pairs, 182 based on Foata normal form. 44/1726 useless extension candidates. Maximal degree in co-relation 2858. Up to 1334 conditions per place. [2024-11-19 01:53:53,099 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 34 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2024-11-19 01:53:53,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 219 flow [2024-11-19 01:53:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:53:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:53:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-11-19 01:53:53,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-19 01:53:53,113 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 3 states and 81 transitions. [2024-11-19 01:53:53,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 219 flow [2024-11-19 01:53:53,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 01:53:53,124 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 93 flow [2024-11-19 01:53:53,126 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2024-11-19 01:53:53,129 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2024-11-19 01:53:53,131 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 93 flow [2024-11-19 01:53:53,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:53,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:53,132 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:53,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:53:53,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:53,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash 297338149, now seen corresponding path program 1 times [2024-11-19 01:53:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:53,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701245699] [2024-11-19 01:53:53,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:53:53,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:53:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:53,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:53,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701245699] [2024-11-19 01:53:53,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701245699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:53:53,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:53:53,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:53:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166029891] [2024-11-19 01:53:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:53,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:53:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:53,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:53:53,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:53:53,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-19 01:53:53,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:53,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:53,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-19 01:53:53,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:53,841 INFO L124 PetriNetUnfolderBase]: 1990/2821 cut-off events. [2024-11-19 01:53:53,841 INFO L125 PetriNetUnfolderBase]: For 694/740 co-relation queries the response was YES. [2024-11-19 01:53:53,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6514 conditions, 2821 events. 1990/2821 cut-off events. For 694/740 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 13010 event pairs, 331 based on Foata normal form. 8/2644 useless extension candidates. Maximal degree in co-relation 1262. Up to 1664 conditions per place. [2024-11-19 01:53:53,861 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 68 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2024-11-19 01:53:53,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 85 transitions, 398 flow [2024-11-19 01:53:53,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:53:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:53:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-19 01:53:53,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2024-11-19 01:53:53,864 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 93 flow. Second operand 5 states and 134 transitions. [2024-11-19 01:53:53,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 85 transitions, 398 flow [2024-11-19 01:53:53,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 85 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:53:53,867 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 155 flow [2024-11-19 01:53:53,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2024-11-19 01:53:53,868 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-11-19 01:53:53,868 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 155 flow [2024-11-19 01:53:53,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:53,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:53,868 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:53,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:53:53,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:53,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1487597447, now seen corresponding path program 2 times [2024-11-19 01:53:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425102889] [2024-11-19 01:53:53,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:53:53,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:53,893 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:53:53,893 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:54,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:54,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425102889] [2024-11-19 01:53:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425102889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:53:54,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612303492] [2024-11-19 01:53:54,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:53:54,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:53:54,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:53:54,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:53:54,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:53:54,128 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:53:54,129 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:54,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:53:54,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:53:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:54,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:53:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612303492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:53:54,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:53:54,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-19 01:53:54,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445305922] [2024-11-19 01:53:54,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:54,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:53:54,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:54,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:53:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:53:54,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-19 01:53:54,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:54,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:54,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-19 01:53:54,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:54,625 INFO L124 PetriNetUnfolderBase]: 2154/3129 cut-off events. [2024-11-19 01:53:54,625 INFO L125 PetriNetUnfolderBase]: For 2715/2715 co-relation queries the response was YES. [2024-11-19 01:53:54,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8841 conditions, 3129 events. 2154/3129 cut-off events. For 2715/2715 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 15455 event pairs, 320 based on Foata normal form. 96/3211 useless extension candidates. Maximal degree in co-relation 1832. Up to 1840 conditions per place. [2024-11-19 01:53:54,649 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 61 selfloop transitions, 5 changer transitions 2/76 dead transitions. [2024-11-19 01:53:54,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 417 flow [2024-11-19 01:53:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:53:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:53:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-11-19 01:53:54,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2024-11-19 01:53:54,651 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 155 flow. Second operand 4 states and 105 transitions. [2024-11-19 01:53:54,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 417 flow [2024-11-19 01:53:54,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 76 transitions, 417 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 01:53:54,655 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 189 flow [2024-11-19 01:53:54,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2024-11-19 01:53:54,656 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-11-19 01:53:54,656 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 189 flow [2024-11-19 01:53:54,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:54,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:54,657 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:54,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:53:54,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:53:54,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:54,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2084442391, now seen corresponding path program 3 times [2024-11-19 01:53:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:54,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291916661] [2024-11-19 01:53:54,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:53:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:54,881 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:53:54,881 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291916661] [2024-11-19 01:53:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291916661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:53:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:53:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:53:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991509666] [2024-11-19 01:53:54,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:53:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:54,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:53:54,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:53:54,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-19 01:53:54,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:54,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:54,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-19 01:53:54,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:55,303 INFO L124 PetriNetUnfolderBase]: 2169/3111 cut-off events. [2024-11-19 01:53:55,303 INFO L125 PetriNetUnfolderBase]: For 3865/3931 co-relation queries the response was YES. [2024-11-19 01:53:55,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9617 conditions, 3111 events. 2169/3111 cut-off events. For 3865/3931 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 15027 event pairs, 498 based on Foata normal form. 14/3098 useless extension candidates. Maximal degree in co-relation 3577. Up to 2237 conditions per place. [2024-11-19 01:53:55,330 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 65 selfloop transitions, 8 changer transitions 7/88 dead transitions. [2024-11-19 01:53:55,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 508 flow [2024-11-19 01:53:55,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:53:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:53:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-11-19 01:53:55,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-11-19 01:53:55,332 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 189 flow. Second operand 5 states and 128 transitions. [2024-11-19 01:53:55,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 508 flow [2024-11-19 01:53:55,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 88 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:53:55,338 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 235 flow [2024-11-19 01:53:55,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-11-19 01:53:55,339 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2024-11-19 01:53:55,339 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 235 flow [2024-11-19 01:53:55,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:55,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:55,340 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:55,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:53:55,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:55,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:55,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1459367843, now seen corresponding path program 1 times [2024-11-19 01:53:55,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448459067] [2024-11-19 01:53:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:53:55,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:53:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:55,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:55,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448459067] [2024-11-19 01:53:55,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448459067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:53:55,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:53:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:53:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274525327] [2024-11-19 01:53:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:55,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:53:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:53:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:53:55,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-19 01:53:55,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:55,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:55,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-19 01:53:55,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:55,903 INFO L124 PetriNetUnfolderBase]: 3230/4524 cut-off events. [2024-11-19 01:53:55,903 INFO L125 PetriNetUnfolderBase]: For 6748/6817 co-relation queries the response was YES. [2024-11-19 01:53:55,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14275 conditions, 4524 events. 3230/4524 cut-off events. For 6748/6817 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 22466 event pairs, 688 based on Foata normal form. 38/4418 useless extension candidates. Maximal degree in co-relation 7860. Up to 3502 conditions per place. [2024-11-19 01:53:55,949 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 56 selfloop transitions, 11 changer transitions 7/83 dead transitions. [2024-11-19 01:53:55,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 574 flow [2024-11-19 01:53:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:53:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:53:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-19 01:53:55,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-11-19 01:53:55,954 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 235 flow. Second operand 4 states and 100 transitions. [2024-11-19 01:53:55,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 574 flow [2024-11-19 01:53:55,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 546 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-19 01:53:55,966 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 302 flow [2024-11-19 01:53:55,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-11-19 01:53:55,967 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-11-19 01:53:55,969 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 302 flow [2024-11-19 01:53:55,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:55,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:55,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:53:55,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:55,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1243983511, now seen corresponding path program 2 times [2024-11-19 01:53:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914895492] [2024-11-19 01:53:55,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:53:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:55,986 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:53:55,987 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:56,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:56,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914895492] [2024-11-19 01:53:56,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914895492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:53:56,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:53:56,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:53:56,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862644477] [2024-11-19 01:53:56,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:56,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:53:56,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:56,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:53:56,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:53:56,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-19 01:53:56,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:56,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:56,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-19 01:53:56,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:56,425 INFO L124 PetriNetUnfolderBase]: 3126/4377 cut-off events. [2024-11-19 01:53:56,426 INFO L125 PetriNetUnfolderBase]: For 7759/7793 co-relation queries the response was YES. [2024-11-19 01:53:56,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 4377 events. 3126/4377 cut-off events. For 7759/7793 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 22007 event pairs, 828 based on Foata normal form. 22/4333 useless extension candidates. Maximal degree in co-relation 7065. Up to 3912 conditions per place. [2024-11-19 01:53:56,468 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 50 selfloop transitions, 11 changer transitions 7/77 dead transitions. [2024-11-19 01:53:56,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 518 flow [2024-11-19 01:53:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:53:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:53:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-19 01:53:56,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-11-19 01:53:56,471 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 302 flow. Second operand 4 states and 100 transitions. [2024-11-19 01:53:56,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 518 flow [2024-11-19 01:53:56,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 01:53:56,478 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 330 flow [2024-11-19 01:53:56,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2024-11-19 01:53:56,480 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-11-19 01:53:56,480 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 330 flow [2024-11-19 01:53:56,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:56,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:56,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:56,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:53:56,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:56,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1927580853, now seen corresponding path program 3 times [2024-11-19 01:53:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:56,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525591836] [2024-11-19 01:53:56,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:53:56,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:56,498 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:53:56,499 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:56,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:56,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525591836] [2024-11-19 01:53:56,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525591836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:53:56,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:53:56,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:53:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846967076] [2024-11-19 01:53:56,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:56,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:53:56,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:53:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:53:56,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-19 01:53:56,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:56,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:56,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-19 01:53:56,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:57,051 INFO L124 PetriNetUnfolderBase]: 4031/5394 cut-off events. [2024-11-19 01:53:57,052 INFO L125 PetriNetUnfolderBase]: For 10476/10508 co-relation queries the response was YES. [2024-11-19 01:53:57,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19394 conditions, 5394 events. 4031/5394 cut-off events. For 10476/10508 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 25000 event pairs, 782 based on Foata normal form. 33/5275 useless extension candidates. Maximal degree in co-relation 8616. Up to 4454 conditions per place. [2024-11-19 01:53:57,088 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 58 selfloop transitions, 8 changer transitions 6/80 dead transitions. [2024-11-19 01:53:57,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 586 flow [2024-11-19 01:53:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:53:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:53:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-19 01:53:57,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6736111111111112 [2024-11-19 01:53:57,090 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 330 flow. Second operand 4 states and 97 transitions. [2024-11-19 01:53:57,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 586 flow [2024-11-19 01:53:57,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 562 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:53:57,096 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 293 flow [2024-11-19 01:53:57,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-11-19 01:53:57,097 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-11-19 01:53:57,097 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 293 flow [2024-11-19 01:53:57,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:57,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:57,097 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:53:57,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:57,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:57,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1595937107, now seen corresponding path program 4 times [2024-11-19 01:53:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:57,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014807783] [2024-11-19 01:53:57,099 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:53:57,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:57,109 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:53:57,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:57,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014807783] [2024-11-19 01:53:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014807783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:53:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244156667] [2024-11-19 01:53:57,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:53:57,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:53:57,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:53:57,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:53:57,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:53:57,231 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:53:57,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:57,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:53:57,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:53:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:57,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:53:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244156667] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:53:57,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:53:57,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2024-11-19 01:53:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084651689] [2024-11-19 01:53:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:57,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:53:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:53:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:53:57,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-19 01:53:57,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:57,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:57,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-19 01:53:57,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:57,816 INFO L124 PetriNetUnfolderBase]: 2816/3779 cut-off events. [2024-11-19 01:53:57,816 INFO L125 PetriNetUnfolderBase]: For 9019/9113 co-relation queries the response was YES. [2024-11-19 01:53:57,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14581 conditions, 3779 events. 2816/3779 cut-off events. For 9019/9113 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 16932 event pairs, 570 based on Foata normal form. 124/3838 useless extension candidates. Maximal degree in co-relation 4578. Up to 1765 conditions per place. [2024-11-19 01:53:57,844 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 65 selfloop transitions, 12 changer transitions 3/88 dead transitions. [2024-11-19 01:53:57,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 627 flow [2024-11-19 01:53:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:53:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:53:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-19 01:53:57,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7152777777777778 [2024-11-19 01:53:57,846 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 293 flow. Second operand 4 states and 103 transitions. [2024-11-19 01:53:57,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 627 flow [2024-11-19 01:53:57,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 597 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-11-19 01:53:57,853 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 332 flow [2024-11-19 01:53:57,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-11-19 01:53:57,853 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-11-19 01:53:57,854 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 332 flow [2024-11-19 01:53:57,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:57,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:57,854 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:57,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:53:58,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 01:53:58,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:58,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash -369155627, now seen corresponding path program 1 times [2024-11-19 01:53:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:58,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638041972] [2024-11-19 01:53:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:53:58,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:53:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:58,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638041972] [2024-11-19 01:53:58,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638041972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:53:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625097520] [2024-11-19 01:53:58,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:53:58,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:53:58,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:53:58,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:53:58,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:53:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:53:58,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:53:58,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:53:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:58,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:53:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:58,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625097520] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:53:58,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:53:58,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2024-11-19 01:53:58,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017684988] [2024-11-19 01:53:58,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:58,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:53:58,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:53:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:53:58,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-19 01:53:58,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:58,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:58,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-19 01:53:58,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:58,884 INFO L124 PetriNetUnfolderBase]: 3051/4147 cut-off events. [2024-11-19 01:53:58,887 INFO L125 PetriNetUnfolderBase]: For 12229/12325 co-relation queries the response was YES. [2024-11-19 01:53:58,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16811 conditions, 4147 events. 3051/4147 cut-off events. For 12229/12325 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 19204 event pairs, 570 based on Foata normal form. 70/4130 useless extension candidates. Maximal degree in co-relation 4824. Up to 2083 conditions per place. [2024-11-19 01:53:58,926 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 79 selfloop transitions, 10 changer transitions 1/100 dead transitions. [2024-11-19 01:53:58,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 100 transitions, 806 flow [2024-11-19 01:53:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:53:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:53:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-11-19 01:53:58,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-11-19 01:53:58,928 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 332 flow. Second operand 4 states and 102 transitions. [2024-11-19 01:53:58,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 100 transitions, 806 flow [2024-11-19 01:53:58,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 794 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-19 01:53:58,938 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 427 flow [2024-11-19 01:53:58,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-11-19 01:53:58,940 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-11-19 01:53:58,940 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 427 flow [2024-11-19 01:53:58,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:58,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:58,941 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:58,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:53:59,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:53:59,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:59,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:59,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1547694181, now seen corresponding path program 2 times [2024-11-19 01:53:59,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:59,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837441640] [2024-11-19 01:53:59,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:53:59,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:59,163 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:53:59,163 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:53:59,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837441640] [2024-11-19 01:53:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837441640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:53:59,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:53:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:53:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900316687] [2024-11-19 01:53:59,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:53:59,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:53:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:53:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:53:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:53:59,262 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-19 01:53:59,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:59,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:53:59,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-19 01:53:59,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:53:59,627 INFO L124 PetriNetUnfolderBase]: 3572/4933 cut-off events. [2024-11-19 01:53:59,628 INFO L125 PetriNetUnfolderBase]: For 17072/17638 co-relation queries the response was YES. [2024-11-19 01:53:59,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20860 conditions, 4933 events. 3572/4933 cut-off events. For 17072/17638 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 23771 event pairs, 815 based on Foata normal form. 53/4869 useless extension candidates. Maximal degree in co-relation 6937. Up to 4076 conditions per place. [2024-11-19 01:53:59,674 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 64 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2024-11-19 01:53:59,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 766 flow [2024-11-19 01:53:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:53:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:53:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-11-19 01:53:59,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2024-11-19 01:53:59,675 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 427 flow. Second operand 4 states and 98 transitions. [2024-11-19 01:53:59,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 766 flow [2024-11-19 01:53:59,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 766 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 01:53:59,687 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 540 flow [2024-11-19 01:53:59,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=540, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-11-19 01:53:59,688 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2024-11-19 01:53:59,688 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 540 flow [2024-11-19 01:53:59,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:53:59,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:53:59,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:53:59,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:53:59,689 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:53:59,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:53:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1381948709, now seen corresponding path program 3 times [2024-11-19 01:53:59,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:53:59,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299444941] [2024-11-19 01:53:59,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:53:59,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:53:59,700 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:53:59,700 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:53:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:53:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299444941] [2024-11-19 01:53:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299444941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:53:59,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061982056] [2024-11-19 01:53:59,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:53:59,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:53:59,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:53:59,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:53:59,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 01:53:59,851 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:53:59,852 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:53:59,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:53:59,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:53:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:53:59,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:54:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:54:00,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061982056] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:54:00,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:54:00,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2024-11-19 01:54:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339743333] [2024-11-19 01:54:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:54:00,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:54:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:54:00,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:54:00,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-19 01:54:00,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 540 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:54:00,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:00,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-19 01:54:00,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:00,431 INFO L124 PetriNetUnfolderBase]: 3739/5020 cut-off events. [2024-11-19 01:54:00,432 INFO L125 PetriNetUnfolderBase]: For 21689/21865 co-relation queries the response was YES. [2024-11-19 01:54:00,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23079 conditions, 5020 events. 3739/5020 cut-off events. For 21689/21865 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 23343 event pairs, 566 based on Foata normal form. 29/4883 useless extension candidates. Maximal degree in co-relation 14031. Up to 2172 conditions per place. [2024-11-19 01:54:00,475 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 80 selfloop transitions, 6 changer transitions 5/102 dead transitions. [2024-11-19 01:54:00,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 1012 flow [2024-11-19 01:54:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:54:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:54:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-11-19 01:54:00,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-19 01:54:00,477 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 540 flow. Second operand 4 states and 93 transitions. [2024-11-19 01:54:00,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 1012 flow [2024-11-19 01:54:00,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 102 transitions, 1005 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:54:00,496 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 601 flow [2024-11-19 01:54:00,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=601, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-11-19 01:54:00,496 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2024-11-19 01:54:00,496 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 601 flow [2024-11-19 01:54:00,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:54:00,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:00,497 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:54:00,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 01:54:00,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:00,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:54:00,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash 341393769, now seen corresponding path program 1 times [2024-11-19 01:54:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:00,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823352814] [2024-11-19 01:54:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:00,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823352814] [2024-11-19 01:54:00,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823352814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:54:00,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:54:00,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:54:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804432568] [2024-11-19 01:54:00,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:54:00,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:54:00,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:00,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:54:00,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:54:00,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-19 01:54:00,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:54:00,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:00,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-19 01:54:00,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:01,170 INFO L124 PetriNetUnfolderBase]: 3597/5013 cut-off events. [2024-11-19 01:54:01,170 INFO L125 PetriNetUnfolderBase]: For 30328/31236 co-relation queries the response was YES. [2024-11-19 01:54:01,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24681 conditions, 5013 events. 3597/5013 cut-off events. For 30328/31236 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 24711 event pairs, 261 based on Foata normal form. 256/5158 useless extension candidates. Maximal degree in co-relation 14105. Up to 2998 conditions per place. [2024-11-19 01:54:01,212 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 88 selfloop transitions, 12 changer transitions 0/115 dead transitions. [2024-11-19 01:54:01,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 115 transitions, 1145 flow [2024-11-19 01:54:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:54:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:54:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-11-19 01:54:01,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2024-11-19 01:54:01,214 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 601 flow. Second operand 5 states and 124 transitions. [2024-11-19 01:54:01,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 115 transitions, 1145 flow [2024-11-19 01:54:01,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 115 transitions, 1131 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-19 01:54:01,245 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 632 flow [2024-11-19 01:54:01,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=632, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2024-11-19 01:54:01,246 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2024-11-19 01:54:01,246 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 632 flow [2024-11-19 01:54:01,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:54:01,246 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:01,246 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:54:01,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:54:01,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:54:01,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1506728749, now seen corresponding path program 1 times [2024-11-19 01:54:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:01,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618497016] [2024-11-19 01:54:01,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:01,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618497016] [2024-11-19 01:54:01,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618497016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:54:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822018973] [2024-11-19 01:54:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:54:01,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:01,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:54:01,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:54:01,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 01:54:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:54:01,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:54:01,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:54:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:54:01,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:54:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:54:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822018973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:54:01,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:54:01,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-11-19 01:54:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807618634] [2024-11-19 01:54:01,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:54:01,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:54:01,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:01,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:54:01,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:54:01,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-11-19 01:54:01,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 632 flow. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:54:01,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:01,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-11-19 01:54:01,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:02,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L67true, Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 6#L56true, 151#true, Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 445#(< ~j2~0 ~M2~0), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, 681#(= ~counter~0 0), Black: 50#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,332 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-19 01:54:02,333 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:54:02,333 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:54:02,333 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:54:02,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L67true, Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 6#L56true, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, 11#L99true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,400 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,400 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,400 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,400 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 445#(< ~j2~0 ~M2~0), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,400 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,400 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,401 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,401 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 327#true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L67true, Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 3#thread4EXITtrue, 6#L56true, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,401 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,401 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,402 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,402 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,466 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,466 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,466 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,466 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,466 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,466 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:54:02,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 6#L56true, 36#thread3EXITtrue, 151#true, Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 445#(< ~j2~0 ~M2~0), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L99true, 13#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,469 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,469 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,469 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,469 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L67true, Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 3#thread4EXITtrue, 6#L56true, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, 11#L99true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,470 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,470 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,470 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,470 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 3#thread4EXITtrue, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,471 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,471 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,471 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,471 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,641 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, 11#L99true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,641 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,641 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,641 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,641 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,641 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,642 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 327#true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 3#thread4EXITtrue, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,642 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,642 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,642 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,642 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,642 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:54:02,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 3#thread4EXITtrue, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L99true, 13#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,645 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 01:54:02,645 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:54:02,645 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:54:02,645 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:54:02,676 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 3#thread4EXITtrue, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, 11#L99true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-19 01:54:02,677 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 01:54:02,677 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:54:02,677 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:54:02,677 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:54:02,677 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:54:02,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L75-->L79: Formula: (and (not (= (ite (< 0 v_~counter~0_128) 1 0) 0)) (= (+ v_~counter~0_127 1) v_~counter~0_128) (= v_~j2~0_42 (+ v_~j2~0_43 1))) InVars {~counter~0=v_~counter~0_128, ~j2~0=v_~j2~0_43} OutVars{~counter~0=v_~counter~0_127, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_42, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][128], [18#L99-1true, Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 176#(<= (+ ~i1~0 1) ~N1~0), 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, 19#L64true, Black: 503#true, 327#true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 173#true, 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 10#thread2EXITtrue, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 621#(<= ~N1~0 ~i1~0), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2024-11-19 01:54:02,742 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 01:54:02,742 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 01:54:02,742 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 01:54:02,742 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:54:02,746 INFO L124 PetriNetUnfolderBase]: 8892/13328 cut-off events. [2024-11-19 01:54:02,747 INFO L125 PetriNetUnfolderBase]: For 83146/84845 co-relation queries the response was YES. [2024-11-19 01:54:02,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68546 conditions, 13328 events. 8892/13328 cut-off events. For 83146/84845 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 84869 event pairs, 1550 based on Foata normal form. 894/13813 useless extension candidates. Maximal degree in co-relation 39129. Up to 5508 conditions per place. [2024-11-19 01:54:02,854 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 86 selfloop transitions, 33 changer transitions 2/152 dead transitions. [2024-11-19 01:54:02,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 152 transitions, 1494 flow [2024-11-19 01:54:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:54:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:54:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-11-19 01:54:02,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-11-19 01:54:02,855 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 632 flow. Second operand 5 states and 147 transitions. [2024-11-19 01:54:02,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 152 transitions, 1494 flow [2024-11-19 01:54:02,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 152 transitions, 1445 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 01:54:02,891 INFO L231 Difference]: Finished difference. Result has 76 places, 96 transitions, 1013 flow [2024-11-19 01:54:02,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1013, PETRI_PLACES=76, PETRI_TRANSITIONS=96} [2024-11-19 01:54:02,892 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2024-11-19 01:54:02,892 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 96 transitions, 1013 flow [2024-11-19 01:54:02,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:54:02,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:02,893 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:54:02,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 01:54:03,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 01:54:03,094 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:54:03,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash -381347263, now seen corresponding path program 2 times [2024-11-19 01:54:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:03,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478131123] [2024-11-19 01:54:03,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:54:03,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:03,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:54:03,108 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:54:03,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478131123] [2024-11-19 01:54:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478131123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:54:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538284183] [2024-11-19 01:54:03,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:54:03,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:03,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:54:03,223 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:54:03,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 01:54:03,298 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:54:03,299 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:03,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:54:03,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:54:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:03,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:54:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:03,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538284183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:54:03,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:54:03,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-19 01:54:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760967607] [2024-11-19 01:54:03,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:54:03,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 01:54:03,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:03,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 01:54:03,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:54:03,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-11-19 01:54:03,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 96 transitions, 1013 flow. Second operand has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:54:03,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:03,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-11-19 01:54:03,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:54:11,417 INFO L124 PetriNetUnfolderBase]: 51822/70930 cut-off events. [2024-11-19 01:54:11,417 INFO L125 PetriNetUnfolderBase]: For 424524/424720 co-relation queries the response was YES. [2024-11-19 01:54:11,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365106 conditions, 70930 events. 51822/70930 cut-off events. For 424524/424720 co-relation queries the response was YES. Maximal size of possible extension queue 2761. Compared 457604 event pairs, 1792 based on Foata normal form. 6373/77164 useless extension candidates. Maximal degree in co-relation 136942. Up to 22627 conditions per place. [2024-11-19 01:54:12,080 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 730 selfloop transitions, 416 changer transitions 16/1169 dead transitions. [2024-11-19 01:54:12,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 1169 transitions, 13411 flow [2024-11-19 01:54:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-19 01:54:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-11-19 01:54:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 1139 transitions. [2024-11-19 01:54:12,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2024-11-19 01:54:12,084 INFO L175 Difference]: Start difference. First operand has 76 places, 96 transitions, 1013 flow. Second operand 51 states and 1139 transitions. [2024-11-19 01:54:12,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 1169 transitions, 13411 flow [2024-11-19 01:54:12,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 1169 transitions, 12339 flow, removed 536 selfloop flow, removed 0 redundant places. [2024-11-19 01:54:12,254 INFO L231 Difference]: Finished difference. Result has 168 places, 498 transitions, 6908 flow [2024-11-19 01:54:12,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=6908, PETRI_PLACES=168, PETRI_TRANSITIONS=498} [2024-11-19 01:54:12,255 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-11-19 01:54:12,255 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 498 transitions, 6908 flow [2024-11-19 01:54:12,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:54:12,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:54:12,256 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:54:12,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 01:54:12,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:12,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:54:12,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:54:12,460 INFO L85 PathProgramCache]: Analyzing trace with hash 564055613, now seen corresponding path program 3 times [2024-11-19 01:54:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:54:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968549865] [2024-11-19 01:54:12,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:54:12,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:54:12,472 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:54:12,476 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 01:54:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:54:12,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968549865] [2024-11-19 01:54:12,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968549865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:54:12,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050006433] [2024-11-19 01:54:12,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:54:12,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:54:12,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:54:12,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:54:12,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 01:54:12,638 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:54:12,638 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:54:12,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:54:12,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:54:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 01:54:12,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:54:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 01:54:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050006433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:54:12,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:54:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-19 01:54:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175751411] [2024-11-19 01:54:12,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:54:12,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 01:54:12,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:54:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 01:54:12,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:54:12,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-11-19 01:54:12,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 498 transitions, 6908 flow. Second operand has 14 states, 14 states have (on average 15.5) internal successors, (217), 14 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:54:12,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:54:12,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-11-19 01:54:12,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand