./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/parallel-ticket-4.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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:47:46,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:47:46,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:47:46,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:47:46,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:47:46,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:47:46,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:47:46,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:47:46,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:47:46,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:47:46,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:47:46,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:47:46,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:47:46,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:47:46,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:47:46,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:47:46,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:47:46,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:47:46,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:47:46,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:47:46,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:47:46,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:47:46,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:47:46,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:47:46,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:47:46,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:47:46,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:47:46,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:47:46,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:47:46,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:47:46,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:47:46,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:47:46,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:47:46,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:47:46,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:47:46,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:47:46,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:47:46,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:47:46,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:47:46,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:47:46,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:47:46,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:47:46,471 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2024-11-22 13:47:46,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:47:46,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:47:46,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:47:46,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:47:46,669 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:47:46,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-22 13:47:48,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:47:48,177 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:47:48,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-22 13:47:48,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1d730a2/aeb1082e60b84c74a73c5a2f6ecafa49/FLAG5179c9b95 [2024-11-22 13:47:48,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d1d730a2/aeb1082e60b84c74a73c5a2f6ecafa49 [2024-11-22 13:47:48,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:47:48,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:47:48,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:47:48,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:47:48,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:47:48,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e28f5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48, skipping insertion in model container [2024-11-22 13:47:48,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:47:48,370 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/parallel-ticket-4.wvr.c[2554,2567] [2024-11-22 13:47:48,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:47:48,381 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:47:48,397 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/parallel-ticket-4.wvr.c[2554,2567] [2024-11-22 13:47:48,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:47:48,410 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:47:48,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48 WrapperNode [2024-11-22 13:47:48,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:47:48,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:47:48,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:47:48,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:47:48,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,436 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-22 13:47:48,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:47:48,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:47:48,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:47:48,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:47:48,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,459 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-22 13:47:48,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:47:48,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:47:48,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:47:48,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:47:48,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (1/1) ... [2024-11-22 13:47:48,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:47:48,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:47:48,507 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-22 13:47:48,513 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-22 13:47:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:47:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 13:47:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 13:47:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 13:47:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 13:47:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 13:47:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 13:47:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-22 13:47:48,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-22 13:47:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:47:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:47:48,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:47:48,581 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:47:48,679 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:47:48,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:47:48,839 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:47:48,841 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:47:49,021 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:47:49,021 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 13:47:49,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:47:49 BoogieIcfgContainer [2024-11-22 13:47:49,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:47:49,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:47:49,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:47:49,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:47:49,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:47:48" (1/3) ... [2024-11-22 13:47:49,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd93206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:47:49, skipping insertion in model container [2024-11-22 13:47:49,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:48" (2/3) ... [2024-11-22 13:47:49,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd93206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:47:49, skipping insertion in model container [2024-11-22 13:47:49,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:47:49" (3/3) ... [2024-11-22 13:47:49,029 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-22 13:47:49,043 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:47:49,044 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:47:49,044 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:47:49,101 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-22 13:47:49,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 146 flow [2024-11-22 13:47:49,165 INFO L124 PetriNetUnfolderBase]: 3/55 cut-off events. [2024-11-22 13:47:49,165 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 13:47:49,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 3/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-22 13:47:49,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 146 flow [2024-11-22 13:47:49,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 132 flow [2024-11-22 13:47:49,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:47:49,192 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;@3173c5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:47:49,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-22 13:47:49,205 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:47:49,205 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-22 13:47:49,206 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 13:47:49,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:49,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:47:49,207 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-22 13:47:49,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash -338410394, now seen corresponding path program 1 times [2024-11-22 13:47:49,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:49,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268076358] [2024-11-22 13:47:49,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:49,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:49,577 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-22 13:47:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268076358] [2024-11-22 13:47:49,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268076358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:49,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:49,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:47:49,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937075230] [2024-11-22 13:47:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:49,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:47:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:49,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:47:49,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:47:49,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2024-11-22 13:47:49,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-22 13:47:49,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:49,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2024-11-22 13:47:49,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:50,774 INFO L124 PetriNetUnfolderBase]: 12679/17507 cut-off events. [2024-11-22 13:47:50,776 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-11-22 13:47:50,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35337 conditions, 17507 events. 12679/17507 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 101565 event pairs, 4419 based on Foata normal form. 1/17032 useless extension candidates. Maximal degree in co-relation 32049. Up to 10696 conditions per place. [2024-11-22 13:47:50,889 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 59 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2024-11-22 13:47:50,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 338 flow [2024-11-22 13:47:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:47:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:47:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-11-22 13:47:50,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7175141242937854 [2024-11-22 13:47:50,901 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 3 states and 127 transitions. [2024-11-22 13:47:50,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 338 flow [2024-11-22 13:47:50,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-22 13:47:50,928 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2024-11-22 13:47:50,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-11-22 13:47:50,934 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2024-11-22 13:47:50,934 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2024-11-22 13:47:50,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-22 13:47:50,935 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:50,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:47:50,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:47:50,936 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-22 13:47:50,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash -728591479, now seen corresponding path program 1 times [2024-11-22 13:47:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:50,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770343891] [2024-11-22 13:47:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:51,037 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-22 13:47:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770343891] [2024-11-22 13:47:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770343891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:51,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:47:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48552400] [2024-11-22 13:47:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:51,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:47:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:47:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:47:51,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-22 13:47:51,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-22 13:47:51,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:51,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-22 13:47:51,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:52,710 INFO L124 PetriNetUnfolderBase]: 21965/30404 cut-off events. [2024-11-22 13:47:52,711 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-11-22 13:47:52,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61554 conditions, 30404 events. 21965/30404 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 181661 event pairs, 16979 based on Foata normal form. 0/29844 useless extension candidates. Maximal degree in co-relation 41623. Up to 26138 conditions per place. [2024-11-22 13:47:52,826 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 58 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-11-22 13:47:52,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 329 flow [2024-11-22 13:47:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:47:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:47:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-22 13:47:52,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-11-22 13:47:52,831 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 114 transitions. [2024-11-22 13:47:52,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 329 flow [2024-11-22 13:47:52,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:47:52,835 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2024-11-22 13:47:52,835 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2024-11-22 13:47:52,836 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2024-11-22 13:47:52,836 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2024-11-22 13:47:52,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-22 13:47:52,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:52,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:47:52,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:47:52,837 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-22 13:47:52,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:52,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1852755381, now seen corresponding path program 1 times [2024-11-22 13:47:52,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:52,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722607979] [2024-11-22 13:47:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:52,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:53,171 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-22 13:47:53,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722607979] [2024-11-22 13:47:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722607979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:53,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:47:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14128252] [2024-11-22 13:47:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:53,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:47:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:47:53,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:47:53,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:47:53,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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-22 13:47:53,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:53,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:47:53,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:54,642 INFO L124 PetriNetUnfolderBase]: 18572/28993 cut-off events. [2024-11-22 13:47:54,642 INFO L125 PetriNetUnfolderBase]: For 1566/1670 co-relation queries the response was YES. [2024-11-22 13:47:54,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59625 conditions, 28993 events. 18572/28993 cut-off events. For 1566/1670 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 225070 event pairs, 3513 based on Foata normal form. 358/27918 useless extension candidates. Maximal degree in co-relation 37875. Up to 9172 conditions per place. [2024-11-22 13:47:54,775 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 105 selfloop transitions, 41 changer transitions 1/172 dead transitions. [2024-11-22 13:47:54,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 172 transitions, 732 flow [2024-11-22 13:47:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:47:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:47:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2024-11-22 13:47:54,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-11-22 13:47:54,777 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 348 transitions. [2024-11-22 13:47:54,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 172 transitions, 732 flow [2024-11-22 13:47:54,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:47:54,810 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2024-11-22 13:47:54,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=366, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2024-11-22 13:47:54,811 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2024-11-22 13:47:54,811 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2024-11-22 13:47:54,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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-22 13:47:54,811 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:54,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:47:54,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:47:54,812 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-22 13:47:54,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1191460215, now seen corresponding path program 2 times [2024-11-22 13:47:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393766874] [2024-11-22 13:47:54,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:47:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:54,828 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:47:54,828 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:47:54,954 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-22 13:47:54,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:54,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393766874] [2024-11-22 13:47:54,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393766874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:54,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:54,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:47:54,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971485224] [2024-11-22 13:47:54,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:54,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:47:54,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:54,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:47:54,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:47:54,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:47:54,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-22 13:47:54,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:54,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:47:54,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:57,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,093 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 13:47:57,093 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:47:57,093 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:47:57,094 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:47:57,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,094 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 13:47:57,094 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:47:57,094 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:47:57,094 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:47:57,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,435 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,435 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,435 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,435 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,436 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,436 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,436 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,436 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,436 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,436 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,436 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,437 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,437 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,437 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,437 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,437 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,438 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,438 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,438 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,438 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,438 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,438 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,439 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,439 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:57,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 29#L76-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,580 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,580 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,580 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,580 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,581 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,581 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,581 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,581 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, 51#thread2EXITtrue, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,581 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,581 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,581 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,582 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,582 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,582 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,583 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,583 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:47:57,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, 51#thread2EXITtrue, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,677 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:47:57,677 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:47:57,677 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:47:57,677 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:47:57,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:47:57,678 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:47:57,678 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:47:57,678 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:47:57,678 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:47:57,791 INFO L124 PetriNetUnfolderBase]: 31017/48718 cut-off events. [2024-11-22 13:47:57,791 INFO L125 PetriNetUnfolderBase]: For 23066/23594 co-relation queries the response was YES. [2024-11-22 13:47:58,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120023 conditions, 48718 events. 31017/48718 cut-off events. For 23066/23594 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 401575 event pairs, 7493 based on Foata normal form. 523/47334 useless extension candidates. Maximal degree in co-relation 77638. Up to 18165 conditions per place. [2024-11-22 13:47:58,212 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 104 selfloop transitions, 55 changer transitions 4/188 dead transitions. [2024-11-22 13:47:58,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 188 transitions, 998 flow [2024-11-22 13:47:58,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:47:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:47:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2024-11-22 13:47:58,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7220338983050848 [2024-11-22 13:47:58,214 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 213 transitions. [2024-11-22 13:47:58,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 188 transitions, 998 flow [2024-11-22 13:47:58,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 188 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:47:58,358 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 759 flow [2024-11-22 13:47:58,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=77, PETRI_TRANSITIONS=134} [2024-11-22 13:47:58,359 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2024-11-22 13:47:58,359 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 759 flow [2024-11-22 13:47:58,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-22 13:47:58,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:58,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:47:58,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:47:58,360 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-22 13:47:58,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:58,361 INFO L85 PathProgramCache]: Analyzing trace with hash 475877975, now seen corresponding path program 1 times [2024-11-22 13:47:58,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:58,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409916289] [2024-11-22 13:47:58,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:58,518 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-22 13:47:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:58,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409916289] [2024-11-22 13:47:58,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409916289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:58,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:58,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:47:58,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906750070] [2024-11-22 13:47:58,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:58,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:47:58,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:58,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:47:58,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:47:58,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:47:58,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 134 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-22 13:47:58,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:58,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:47:58,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:00,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 5#L100-4true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:00,500 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 13:48:00,500 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:00,500 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:00,500 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:00,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:00,500 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 13:48:00,501 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:00,501 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:00,501 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:00,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:00,685 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,686 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,686 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,686 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:00,686 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,686 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,686 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,686 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 5#L100-4true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:00,687 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,687 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,687 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,687 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), 108#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:00,687 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,687 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,687 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,688 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:00,688 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,688 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,688 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,688 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:00,688 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,689 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,689 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:00,689 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:01,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:01,018 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,019 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,019 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,019 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 100#(<= ~s~0 ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:01,019 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,019 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,019 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,020 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 108#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:01,020 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,020 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,020 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,020 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:01,021 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,021 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,021 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,021 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:01,022 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,022 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,022 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,022 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:01,022 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,022 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,023 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,023 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:01,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:01,187 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:48:01,187 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:01,187 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:01,187 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:01,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:01,187 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:48:01,188 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:01,188 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:01,188 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:01,383 INFO L124 PetriNetUnfolderBase]: 28896/45634 cut-off events. [2024-11-22 13:48:01,384 INFO L125 PetriNetUnfolderBase]: For 66729/68306 co-relation queries the response was YES. [2024-11-22 13:48:01,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139415 conditions, 45634 events. 28896/45634 cut-off events. For 66729/68306 co-relation queries the response was YES. Maximal size of possible extension queue 2401. Compared 374889 event pairs, 7274 based on Foata normal form. 952/44887 useless extension candidates. Maximal degree in co-relation 86598. Up to 17640 conditions per place. [2024-11-22 13:48:01,664 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 68 changer transitions 0/200 dead transitions. [2024-11-22 13:48:01,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 1397 flow [2024-11-22 13:48:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:48:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:48:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-11-22 13:48:01,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7186440677966102 [2024-11-22 13:48:01,666 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 759 flow. Second operand 5 states and 212 transitions. [2024-11-22 13:48:01,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 1397 flow [2024-11-22 13:48:01,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 1382 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-22 13:48:01,848 INFO L231 Difference]: Finished difference. Result has 82 places, 147 transitions, 1057 flow [2024-11-22 13:48:01,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1057, PETRI_PLACES=82, PETRI_TRANSITIONS=147} [2024-11-22 13:48:01,849 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places. [2024-11-22 13:48:01,849 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 147 transitions, 1057 flow [2024-11-22 13:48:01,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-22 13:48:01,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:01,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:48:01,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:48:01,850 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-22 13:48:01,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:01,850 INFO L85 PathProgramCache]: Analyzing trace with hash 93800467, now seen corresponding path program 3 times [2024-11-22 13:48:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:01,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196434243] [2024-11-22 13:48:01,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:48:01,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:01,863 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 13:48:01,863 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:48:01,984 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-22 13:48:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196434243] [2024-11-22 13:48:01,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196434243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:01,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:01,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:48:01,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084769065] [2024-11-22 13:48:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:01,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:48:01,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:01,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:48:01,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:48:01,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:01,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 147 transitions, 1057 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-22 13:48:01,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:01,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:01,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:04,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:04,330 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 13:48:04,330 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:04,330 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:04,330 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:04,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:04,681 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,681 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,681 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,681 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:04,682 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,682 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,682 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,682 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:04,682 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,682 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,682 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,683 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:04,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:04,974 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,974 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,974 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,974 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:04,974 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,975 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,975 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,975 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:04,975 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,975 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,976 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:04,976 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:05,190 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:05,191 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:48:05,191 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:05,191 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:05,191 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:05,645 INFO L124 PetriNetUnfolderBase]: 32470/50995 cut-off events. [2024-11-22 13:48:05,645 INFO L125 PetriNetUnfolderBase]: For 103598/106226 co-relation queries the response was YES. [2024-11-22 13:48:05,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169020 conditions, 50995 events. 32470/50995 cut-off events. For 103598/106226 co-relation queries the response was YES. Maximal size of possible extension queue 2826. Compared 425275 event pairs, 6385 based on Foata normal form. 1598/50204 useless extension candidates. Maximal degree in co-relation 105849. Up to 17284 conditions per place. [2024-11-22 13:48:05,894 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 106 changer transitions 4/242 dead transitions. [2024-11-22 13:48:05,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 242 transitions, 1922 flow [2024-11-22 13:48:05,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:48:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:48:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2024-11-22 13:48:05,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7259887005649718 [2024-11-22 13:48:05,896 INFO L175 Difference]: Start difference. First operand has 82 places, 147 transitions, 1057 flow. Second operand 6 states and 257 transitions. [2024-11-22 13:48:05,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 242 transitions, 1922 flow [2024-11-22 13:48:06,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 242 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:48:06,028 INFO L231 Difference]: Finished difference. Result has 87 places, 175 transitions, 1487 flow [2024-11-22 13:48:06,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1487, PETRI_PLACES=87, PETRI_TRANSITIONS=175} [2024-11-22 13:48:06,029 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 23 predicate places. [2024-11-22 13:48:06,029 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 175 transitions, 1487 flow [2024-11-22 13:48:06,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-22 13:48:06,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:06,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:48:06,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:48:06,029 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-22 13:48:06,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash 150968343, now seen corresponding path program 4 times [2024-11-22 13:48:06,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:06,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268313593] [2024-11-22 13:48:06,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:48:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:06,045 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:48:06,046 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:48:06,211 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-22 13:48:06,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:06,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268313593] [2024-11-22 13:48:06,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268313593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:06,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:06,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:48:06,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023396073] [2024-11-22 13:48:06,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:06,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:48:06,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:06,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:48:06,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:48:06,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:06,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 175 transitions, 1487 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-22 13:48:06,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:06,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:06,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:08,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:08,705 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 13:48:08,705 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:08,705 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:08,705 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:48:09,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,006 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,006 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,006 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,006 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 117#true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,084 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,084 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,084 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,085 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,085 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,085 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,086 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,086 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,086 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:48:09,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,598 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,598 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,598 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,598 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,599 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,599 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,599 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,599 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,677 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,677 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,677 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,677 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,677 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,678 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,678 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-22 13:48:09,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,811 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:48:09,811 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:09,811 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:09,811 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:09,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-22 13:48:09,833 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-22 13:48:09,833 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:09,833 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:09,833 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-22 13:48:10,028 INFO L124 PetriNetUnfolderBase]: 31732/50954 cut-off events. [2024-11-22 13:48:10,028 INFO L125 PetriNetUnfolderBase]: For 160772/163129 co-relation queries the response was YES. [2024-11-22 13:48:10,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178732 conditions, 50954 events. 31732/50954 cut-off events. For 160772/163129 co-relation queries the response was YES. Maximal size of possible extension queue 2810. Compared 436290 event pairs, 8150 based on Foata normal form. 1179/50358 useless extension candidates. Maximal degree in co-relation 111088. Up to 23495 conditions per place. [2024-11-22 13:48:10,340 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 124 selfloop transitions, 85 changer transitions 12/246 dead transitions. [2024-11-22 13:48:10,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 246 transitions, 2344 flow [2024-11-22 13:48:10,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:48:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:48:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-11-22 13:48:10,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7254237288135593 [2024-11-22 13:48:10,342 INFO L175 Difference]: Start difference. First operand has 87 places, 175 transitions, 1487 flow. Second operand 5 states and 214 transitions. [2024-11-22 13:48:10,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 246 transitions, 2344 flow [2024-11-22 13:48:10,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 246 transitions, 2275 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-22 13:48:10,655 INFO L231 Difference]: Finished difference. Result has 91 places, 185 transitions, 1807 flow [2024-11-22 13:48:10,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1807, PETRI_PLACES=91, PETRI_TRANSITIONS=185} [2024-11-22 13:48:10,656 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 27 predicate places. [2024-11-22 13:48:10,656 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 185 transitions, 1807 flow [2024-11-22 13:48:10,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-22 13:48:10,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:10,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, 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-22 13:48:10,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:48:10,657 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-22 13:48:10,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1047806689, now seen corresponding path program 5 times [2024-11-22 13:48:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:10,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784767410] [2024-11-22 13:48:10,658 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 13:48:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:10,668 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:48:10,668 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:48:10,762 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-22 13:48:10,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:10,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784767410] [2024-11-22 13:48:10,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784767410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:10,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:10,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:48:10,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188927814] [2024-11-22 13:48:10,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:10,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:48:10,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:10,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:48:10,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:48:10,769 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:10,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 185 transitions, 1807 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-22 13:48:10,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:10,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:10,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:13,250 INFO L124 PetriNetUnfolderBase]: 20188/32582 cut-off events. [2024-11-22 13:48:13,250 INFO L125 PetriNetUnfolderBase]: For 113177/115127 co-relation queries the response was YES. [2024-11-22 13:48:13,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115558 conditions, 32582 events. 20188/32582 cut-off events. For 113177/115127 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 263393 event pairs, 5504 based on Foata normal form. 1250/32738 useless extension candidates. Maximal degree in co-relation 89621. Up to 16794 conditions per place. [2024-11-22 13:48:13,470 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 116 selfloop transitions, 91 changer transitions 5/237 dead transitions. [2024-11-22 13:48:13,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 237 transitions, 2473 flow [2024-11-22 13:48:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:48:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:48:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-11-22 13:48:13,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7152542372881356 [2024-11-22 13:48:13,472 INFO L175 Difference]: Start difference. First operand has 91 places, 185 transitions, 1807 flow. Second operand 5 states and 211 transitions. [2024-11-22 13:48:13,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 237 transitions, 2473 flow [2024-11-22 13:48:13,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 237 transitions, 2372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:48:13,635 INFO L231 Difference]: Finished difference. Result has 95 places, 189 transitions, 2039 flow [2024-11-22 13:48:13,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2039, PETRI_PLACES=95, PETRI_TRANSITIONS=189} [2024-11-22 13:48:13,636 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 31 predicate places. [2024-11-22 13:48:13,636 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 189 transitions, 2039 flow [2024-11-22 13:48:13,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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-22 13:48:13,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:13,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:48:13,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:48:13,637 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-22 13:48:13,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:13,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1574365825, now seen corresponding path program 6 times [2024-11-22 13:48:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:13,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107359974] [2024-11-22 13:48:13,638 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-22 13:48:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:13,649 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-22 13:48:13,649 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:48:13,777 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-22 13:48:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:13,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107359974] [2024-11-22 13:48:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107359974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:13,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:13,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:48:13,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049632030] [2024-11-22 13:48:13,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:13,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:48:13,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:48:13,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:48:13,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:13,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 189 transitions, 2039 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-22 13:48:13,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:13,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:13,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:16,271 INFO L124 PetriNetUnfolderBase]: 20083/32372 cut-off events. [2024-11-22 13:48:16,271 INFO L125 PetriNetUnfolderBase]: For 133913/136182 co-relation queries the response was YES. [2024-11-22 13:48:16,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120675 conditions, 32372 events. 20083/32372 cut-off events. For 133913/136182 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 262245 event pairs, 4425 based on Foata normal form. 1212/32298 useless extension candidates. Maximal degree in co-relation 94601. Up to 9620 conditions per place. [2024-11-22 13:48:16,454 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 120 selfloop transitions, 127 changer transitions 3/275 dead transitions. [2024-11-22 13:48:16,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 275 transitions, 2941 flow [2024-11-22 13:48:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:48:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 13:48:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 326 transitions. [2024-11-22 13:48:16,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.690677966101695 [2024-11-22 13:48:16,666 INFO L175 Difference]: Start difference. First operand has 95 places, 189 transitions, 2039 flow. Second operand 8 states and 326 transitions. [2024-11-22 13:48:16,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 275 transitions, 2941 flow [2024-11-22 13:48:16,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 275 transitions, 2828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:48:16,770 INFO L231 Difference]: Finished difference. Result has 102 places, 196 transitions, 2333 flow [2024-11-22 13:48:16,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2333, PETRI_PLACES=102, PETRI_TRANSITIONS=196} [2024-11-22 13:48:16,770 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 38 predicate places. [2024-11-22 13:48:16,770 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 196 transitions, 2333 flow [2024-11-22 13:48:16,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-22 13:48:16,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:16,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:48:16,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:48:16,771 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-22 13:48:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash -466208189, now seen corresponding path program 2 times [2024-11-22 13:48:16,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:16,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840004050] [2024-11-22 13:48:16,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:48:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:16,781 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:48:16,781 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:48:16,906 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-22 13:48:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840004050] [2024-11-22 13:48:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840004050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:16,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:48:16,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851733943] [2024-11-22 13:48:16,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:16,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:48:16,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:16,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:48:16,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:48:16,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:16,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 196 transitions, 2333 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-22 13:48:16,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:16,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:16,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:19,715 INFO L124 PetriNetUnfolderBase]: 19464/31902 cut-off events. [2024-11-22 13:48:19,716 INFO L125 PetriNetUnfolderBase]: For 161756/163656 co-relation queries the response was YES. [2024-11-22 13:48:19,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124405 conditions, 31902 events. 19464/31902 cut-off events. For 161756/163656 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 262968 event pairs, 4270 based on Foata normal form. 1207/31930 useless extension candidates. Maximal degree in co-relation 97901. Up to 9533 conditions per place. [2024-11-22 13:48:19,889 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 122 selfloop transitions, 139 changer transitions 26/312 dead transitions. [2024-11-22 13:48:19,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 312 transitions, 3738 flow [2024-11-22 13:48:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:48:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 13:48:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2024-11-22 13:48:19,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7033898305084746 [2024-11-22 13:48:19,893 INFO L175 Difference]: Start difference. First operand has 102 places, 196 transitions, 2333 flow. Second operand 8 states and 332 transitions. [2024-11-22 13:48:19,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 312 transitions, 3738 flow [2024-11-22 13:48:20,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 312 transitions, 3515 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-22 13:48:20,077 INFO L231 Difference]: Finished difference. Result has 107 places, 207 transitions, 2653 flow [2024-11-22 13:48:20,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2653, PETRI_PLACES=107, PETRI_TRANSITIONS=207} [2024-11-22 13:48:20,078 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 43 predicate places. [2024-11-22 13:48:20,078 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 207 transitions, 2653 flow [2024-11-22 13:48:20,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-22 13:48:20,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:20,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:48:20,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:48:20,079 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-22 13:48:20,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash -520405845, now seen corresponding path program 7 times [2024-11-22 13:48:20,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:20,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133231339] [2024-11-22 13:48:20,079 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-22 13:48:20,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:48:20,176 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-22 13:48:20,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133231339] [2024-11-22 13:48:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133231339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:20,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:20,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:48:20,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131341480] [2024-11-22 13:48:20,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:20,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:48:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:48:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:48:20,181 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:20,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 207 transitions, 2653 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-22 13:48:20,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:20,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:20,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:22,039 INFO L124 PetriNetUnfolderBase]: 13479/22220 cut-off events. [2024-11-22 13:48:22,040 INFO L125 PetriNetUnfolderBase]: For 108052/109168 co-relation queries the response was YES. [2024-11-22 13:48:22,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86335 conditions, 22220 events. 13479/22220 cut-off events. For 108052/109168 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 173244 event pairs, 3104 based on Foata normal form. 828/22418 useless extension candidates. Maximal degree in co-relation 71321. Up to 6362 conditions per place. [2024-11-22 13:48:22,161 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 112 selfloop transitions, 138 changer transitions 35/309 dead transitions. [2024-11-22 13:48:22,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 309 transitions, 3930 flow [2024-11-22 13:48:22,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 13:48:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 13:48:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 328 transitions. [2024-11-22 13:48:22,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2024-11-22 13:48:22,163 INFO L175 Difference]: Start difference. First operand has 107 places, 207 transitions, 2653 flow. Second operand 8 states and 328 transitions. [2024-11-22 13:48:22,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 309 transitions, 3930 flow [2024-11-22 13:48:22,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 309 transitions, 3783 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 13:48:22,259 INFO L231 Difference]: Finished difference. Result has 113 places, 202 transitions, 2782 flow [2024-11-22 13:48:22,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2782, PETRI_PLACES=113, PETRI_TRANSITIONS=202} [2024-11-22 13:48:22,260 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 49 predicate places. [2024-11-22 13:48:22,260 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 202 transitions, 2782 flow [2024-11-22 13:48:22,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 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-22 13:48:22,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:22,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:48:22,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:48:22,261 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-22 13:48:22,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1458401591, now seen corresponding path program 8 times [2024-11-22 13:48:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:22,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66210110] [2024-11-22 13:48:22,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:48:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:22,270 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:48:22,270 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:48:22,352 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-22 13:48:22,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:22,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66210110] [2024-11-22 13:48:22,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66210110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:22,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:22,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:48:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007632758] [2024-11-22 13:48:22,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:22,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:48:22,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:22,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:48:22,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:48:22,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:22,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 202 transitions, 2782 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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-22 13:48:22,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:22,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:22,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:24,246 INFO L124 PetriNetUnfolderBase]: 12306/19949 cut-off events. [2024-11-22 13:48:24,246 INFO L125 PetriNetUnfolderBase]: For 116199/117047 co-relation queries the response was YES. [2024-11-22 13:48:24,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79240 conditions, 19949 events. 12306/19949 cut-off events. For 116199/117047 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 151397 event pairs, 2965 based on Foata normal form. 496/19718 useless extension candidates. Maximal degree in co-relation 64408. Up to 7340 conditions per place. [2024-11-22 13:48:24,592 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 100 selfloop transitions, 138 changer transitions 31/293 dead transitions. [2024-11-22 13:48:24,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 293 transitions, 3831 flow [2024-11-22 13:48:24,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:48:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:48:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2024-11-22 13:48:24,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-11-22 13:48:24,594 INFO L175 Difference]: Start difference. First operand has 113 places, 202 transitions, 2782 flow. Second operand 9 states and 348 transitions. [2024-11-22 13:48:24,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 293 transitions, 3831 flow [2024-11-22 13:48:24,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 293 transitions, 3699 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 13:48:24,708 INFO L231 Difference]: Finished difference. Result has 119 places, 191 transitions, 2738 flow [2024-11-22 13:48:24,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2738, PETRI_PLACES=119, PETRI_TRANSITIONS=191} [2024-11-22 13:48:24,708 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 55 predicate places. [2024-11-22 13:48:24,709 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 191 transitions, 2738 flow [2024-11-22 13:48:24,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 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-22 13:48:24,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:24,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:48:24,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 13:48:24,709 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-22 13:48:24,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1356573209, now seen corresponding path program 9 times [2024-11-22 13:48:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867274306] [2024-11-22 13:48:24,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:48:24,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:24,721 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 13:48:24,723 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:48:24,807 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-22 13:48:24,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:24,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867274306] [2024-11-22 13:48:24,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867274306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:24,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:24,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:48:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129619726] [2024-11-22 13:48:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:24,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:48:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:24,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:48:24,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:48:24,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:24,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 191 transitions, 2738 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-22 13:48:24,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:24,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:24,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:26,454 INFO L124 PetriNetUnfolderBase]: 11627/18961 cut-off events. [2024-11-22 13:48:26,454 INFO L125 PetriNetUnfolderBase]: For 129513/130495 co-relation queries the response was YES. [2024-11-22 13:48:26,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76776 conditions, 18961 events. 11627/18961 cut-off events. For 129513/130495 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 144097 event pairs, 2866 based on Foata normal form. 670/18974 useless extension candidates. Maximal degree in co-relation 61763. Up to 7010 conditions per place. [2024-11-22 13:48:26,544 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 110 selfloop transitions, 136 changer transitions 18/288 dead transitions. [2024-11-22 13:48:26,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 3743 flow [2024-11-22 13:48:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:48:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 13:48:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 435 transitions. [2024-11-22 13:48:26,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.614406779661017 [2024-11-22 13:48:26,546 INFO L175 Difference]: Start difference. First operand has 119 places, 191 transitions, 2738 flow. Second operand 12 states and 435 transitions. [2024-11-22 13:48:26,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 3743 flow [2024-11-22 13:48:26,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 288 transitions, 3559 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-22 13:48:26,672 INFO L231 Difference]: Finished difference. Result has 127 places, 190 transitions, 2782 flow [2024-11-22 13:48:26,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2782, PETRI_PLACES=127, PETRI_TRANSITIONS=190} [2024-11-22 13:48:26,673 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 63 predicate places. [2024-11-22 13:48:26,673 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 190 transitions, 2782 flow [2024-11-22 13:48:26,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-22 13:48:26,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:26,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:48:26,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 13:48:26,674 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-22 13:48:26,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1616034583, now seen corresponding path program 10 times [2024-11-22 13:48:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:26,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389259018] [2024-11-22 13:48:26,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:48:26,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:26,683 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:48:26,683 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:48:26,781 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-22 13:48:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389259018] [2024-11-22 13:48:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389259018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:26,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:26,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:48:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831577233] [2024-11-22 13:48:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:26,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:48:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:26,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:48:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:48:26,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:26,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 190 transitions, 2782 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-22 13:48:26,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:26,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:26,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:48:28,410 INFO L124 PetriNetUnfolderBase]: 11595/18937 cut-off events. [2024-11-22 13:48:28,411 INFO L125 PetriNetUnfolderBase]: For 145920/146700 co-relation queries the response was YES. [2024-11-22 13:48:28,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78317 conditions, 18937 events. 11595/18937 cut-off events. For 145920/146700 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 144326 event pairs, 3080 based on Foata normal form. 412/18659 useless extension candidates. Maximal degree in co-relation 62831. Up to 7053 conditions per place. [2024-11-22 13:48:28,499 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 94 selfloop transitions, 128 changer transitions 50/296 dead transitions. [2024-11-22 13:48:28,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 3955 flow [2024-11-22 13:48:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:48:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 13:48:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 438 transitions. [2024-11-22 13:48:28,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2024-11-22 13:48:28,501 INFO L175 Difference]: Start difference. First operand has 127 places, 190 transitions, 2782 flow. Second operand 12 states and 438 transitions. [2024-11-22 13:48:28,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 3955 flow [2024-11-22 13:48:28,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 296 transitions, 3697 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-22 13:48:28,638 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 2659 flow [2024-11-22 13:48:28,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2659, PETRI_PLACES=132, PETRI_TRANSITIONS=181} [2024-11-22 13:48:28,639 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 68 predicate places. [2024-11-22 13:48:28,639 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 181 transitions, 2659 flow [2024-11-22 13:48:28,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-22 13:48:28,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:48:28,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:48:28,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 13:48:28,640 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-22 13:48:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:48:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1751130347, now seen corresponding path program 3 times [2024-11-22 13:48:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:48:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306911753] [2024-11-22 13:48:28,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:48:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:48:28,648 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 13:48:28,649 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:48:28,726 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-22 13:48:28,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:48:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306911753] [2024-11-22 13:48:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306911753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:48:28,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:48:28,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:48:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607258814] [2024-11-22 13:48:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:48:28,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:48:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:48:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:48:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:48:28,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-22 13:48:28,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 181 transitions, 2659 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 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-22 13:48:28,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:48:28,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-22 13:48:28,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand