./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/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-?-c7c6ca5-m [2024-11-09 02:44:10,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:44:11,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:44:11,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:44:11,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:44:11,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:44:11,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:44:11,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:44:11,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:44:11,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:44:11,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:44:11,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:44:11,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:44:11,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:44:11,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:44:11,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:44:11,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:44:11,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:44:11,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:44:11,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:44:11,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:44:11,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:44:11,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:44:11,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:44:11,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:44:11,080 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:44:11,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:44:11,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:44:11,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:44:11,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:44:11,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:44:11,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:44:11,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:44:11,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:44:11,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:44:11,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:44:11,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:44:11,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:44:11,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:44:11,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:44:11,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:44:11,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:44:11,085 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-09 02:44:11,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:44:11,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:44:11,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:44:11,352 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:44:11,353 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:44:11,354 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-09 02:44:12,834 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:44:13,029 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:44:13,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-09 02:44:13,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aad3b377/bfa06d25539844e285ef0ca3663f9a08/FLAGfeed16a13 [2024-11-09 02:44:13,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aad3b377/bfa06d25539844e285ef0ca3663f9a08 [2024-11-09 02:44:13,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:44:13,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:44:13,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:44:13,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:44:13,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:44:13,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59af7788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13, skipping insertion in model container [2024-11-09 02:44:13,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:44:13,288 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-09 02:44:13,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:44:13,304 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:44:13,325 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-09 02:44:13,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:44:13,346 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:44:13,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13 WrapperNode [2024-11-09 02:44:13,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:44:13,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:44:13,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:44:13,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:44:13,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,395 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-09 02:44:13,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:44:13,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:44:13,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:44:13,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:44:13,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,436 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-09 02:44:13,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:44:13,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:44:13,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:44:13,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:44:13,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (1/1) ... [2024-11-09 02:44:13,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:44:13,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:44:13,495 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-09 02:44:13,500 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-09 02:44:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:44:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 02:44:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 02:44:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 02:44:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 02:44:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 02:44:13,553 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 02:44:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 02:44:13,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 02:44:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:44:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:44:13,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:44:13,556 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:44:13,653 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:44:13,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:44:13,961 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:44:13,962 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:44:14,130 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:44:14,131 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 02:44:14,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:44:14 BoogieIcfgContainer [2024-11-09 02:44:14,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:44:14,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:44:14,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:44:14,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:44:14,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:44:13" (1/3) ... [2024-11-09 02:44:14,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778422e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:44:14, skipping insertion in model container [2024-11-09 02:44:14,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:44:13" (2/3) ... [2024-11-09 02:44:14,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778422e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:44:14, skipping insertion in model container [2024-11-09 02:44:14,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:44:14" (3/3) ... [2024-11-09 02:44:14,143 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-09 02:44:14,157 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:44:14,158 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:44:14,158 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:44:14,230 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 02:44:14,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 146 flow [2024-11-09 02:44:14,367 INFO L124 PetriNetUnfolderBase]: 3/55 cut-off events. [2024-11-09 02:44:14,367 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 02:44:14,373 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-09 02:44:14,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 146 flow [2024-11-09 02:44:14,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 132 flow [2024-11-09 02:44:14,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:44:14,397 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;@f31afa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:44:14,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 02:44:14,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:44:14,418 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-09 02:44:14,418 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 02:44:14,418 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:14,419 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-09 02:44:14,419 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-09 02:44:14,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash -338410394, now seen corresponding path program 1 times [2024-11-09 02:44:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:14,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916414837] [2024-11-09 02:44:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:14,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:14,882 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-09 02:44:14,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:14,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916414837] [2024-11-09 02:44:14,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916414837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:14,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:14,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:44:14,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492564060] [2024-11-09 02:44:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:14,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:44:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:14,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:44:14,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:44:14,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2024-11-09 02:44:14,946 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-09 02:44:14,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:14,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2024-11-09 02:44:14,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:16,762 INFO L124 PetriNetUnfolderBase]: 12679/17507 cut-off events. [2024-11-09 02:44:16,763 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-11-09 02:44:16,831 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-09 02:44:17,055 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 59 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2024-11-09 02:44:17,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 338 flow [2024-11-09 02:44:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:44:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:44:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-11-09 02:44:17,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7175141242937854 [2024-11-09 02:44:17,072 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 3 states and 127 transitions. [2024-11-09 02:44:17,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 338 flow [2024-11-09 02:44:17,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 02:44:17,111 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2024-11-09 02:44:17,114 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-09 02:44:17,118 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2024-11-09 02:44:17,119 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2024-11-09 02:44:17,119 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-09 02:44:17,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:17,119 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-09 02:44:17,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:44:17,120 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-09 02:44:17,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash -728591479, now seen corresponding path program 1 times [2024-11-09 02:44:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:17,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152959465] [2024-11-09 02:44:17,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:17,214 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-09 02:44:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:17,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152959465] [2024-11-09 02:44:17,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152959465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:17,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:17,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:44:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818972880] [2024-11-09 02:44:17,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:17,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:44:17,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:17,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:44:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:44:17,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-09 02:44:17,232 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-09 02:44:17,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:17,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-09 02:44:17,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:19,537 INFO L124 PetriNetUnfolderBase]: 21965/30404 cut-off events. [2024-11-09 02:44:19,537 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-11-09 02:44:19,593 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-09 02:44:19,710 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 58 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-11-09 02:44:19,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 329 flow [2024-11-09 02:44:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:44:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:44:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-09 02:44:19,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-11-09 02:44:19,713 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 114 transitions. [2024-11-09 02:44:19,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 329 flow [2024-11-09 02:44:19,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:44:19,719 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2024-11-09 02:44:19,719 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-09 02:44:19,720 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2024-11-09 02:44:19,720 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2024-11-09 02:44:19,721 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-09 02:44:19,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:19,721 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-09 02:44:19,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:44:19,722 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-09 02:44:19,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:19,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1852755381, now seen corresponding path program 1 times [2024-11-09 02:44:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:19,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537720752] [2024-11-09 02:44:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:20,057 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-09 02:44:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537720752] [2024-11-09 02:44:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537720752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:20,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:20,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:44:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513229980] [2024-11-09 02:44:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:20,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:44:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:44:20,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:44:20,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:20,068 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-09 02:44:20,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:20,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:20,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:22,133 INFO L124 PetriNetUnfolderBase]: 18572/28993 cut-off events. [2024-11-09 02:44:22,133 INFO L125 PetriNetUnfolderBase]: For 1566/1670 co-relation queries the response was YES. [2024-11-09 02:44:22,202 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-09 02:44:22,324 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 105 selfloop transitions, 41 changer transitions 1/172 dead transitions. [2024-11-09 02:44:22,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 172 transitions, 732 flow [2024-11-09 02:44:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:44:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 02:44:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2024-11-09 02:44:22,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-11-09 02:44:22,328 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 348 transitions. [2024-11-09 02:44:22,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 172 transitions, 732 flow [2024-11-09 02:44:22,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:44:22,589 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2024-11-09 02:44:22,589 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-09 02:44:22,590 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2024-11-09 02:44:22,590 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2024-11-09 02:44:22,591 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-09 02:44:22,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:22,591 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-09 02:44:22,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:44:22,592 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-09 02:44:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1191460215, now seen corresponding path program 2 times [2024-11-09 02:44:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:22,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585667051] [2024-11-09 02:44:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:22,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:22,791 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-09 02:44:22,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:22,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585667051] [2024-11-09 02:44:22,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585667051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:22,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:22,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:44:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623946272] [2024-11-09 02:44:22,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:22,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:44:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:22,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:44:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:44:22,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:22,798 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-09 02:44:22,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:22,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:22,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:25,138 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-09 02:44:25,138 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 02:44:25,139 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:25,142 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:25,142 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:25,143 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-09 02:44:25,143 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 02:44:25,143 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:25,143 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:25,143 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:25,343 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-09 02:44:25,343 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,344 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,344 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,344 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,344 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-09 02:44:25,344 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,345 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,345 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,345 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,345 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-09 02:44:25,346 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,346 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,346 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,346 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,347 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-09 02:44:25,347 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,347 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,347 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,347 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,348 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-09 02:44:25,348 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,348 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,348 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,348 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,349 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-09 02:44:25,349 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,349 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,349 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,349 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:25,690 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-09 02:44:25,691 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,691 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,691 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,691 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,692 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-09 02:44:25,692 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,692 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,692 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,692 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,693 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-09 02:44:25,693 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,693 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,693 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,693 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,693 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-09 02:44:25,694 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,694 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,694 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,694 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,694 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-09 02:44:25,694 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,694 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,694 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,694 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,695 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-09 02:44:25,695 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,695 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,695 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,695 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:25,813 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-09 02:44:25,813 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-09 02:44:25,813 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:25,813 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:25,814 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:25,814 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-09 02:44:25,814 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-09 02:44:25,814 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:25,814 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:25,814 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:25,944 INFO L124 PetriNetUnfolderBase]: 31017/48718 cut-off events. [2024-11-09 02:44:25,945 INFO L125 PetriNetUnfolderBase]: For 23066/23594 co-relation queries the response was YES. [2024-11-09 02:44:26,069 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-09 02:44:26,252 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 104 selfloop transitions, 55 changer transitions 4/188 dead transitions. [2024-11-09 02:44:26,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 188 transitions, 998 flow [2024-11-09 02:44:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:44:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:44:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2024-11-09 02:44:26,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7220338983050848 [2024-11-09 02:44:26,257 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 213 transitions. [2024-11-09 02:44:26,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 188 transitions, 998 flow [2024-11-09 02:44:26,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 188 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:44:26,627 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 759 flow [2024-11-09 02:44:26,627 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-09 02:44:26,628 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2024-11-09 02:44:26,628 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 759 flow [2024-11-09 02:44:26,628 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-09 02:44:26,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:26,629 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-09 02:44:26,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:44:26,629 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-09 02:44:26,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash 475877975, now seen corresponding path program 1 times [2024-11-09 02:44:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:26,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857347206] [2024-11-09 02:44:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:26,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:26,806 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-09 02:44:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857347206] [2024-11-09 02:44:26,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857347206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:26,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:26,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:44:26,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767758240] [2024-11-09 02:44:26,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:26,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:44:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:44:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:44:26,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:26,813 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-09 02:44:26,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:26,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:26,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:29,174 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-09 02:44:29,175 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 02:44:29,175 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:29,175 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:29,175 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:29,175 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-09 02:44:29,175 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 02:44:29,175 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:29,175 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:29,176 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:29,378 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-09 02:44:29,378 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,378 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,378 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,378 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,379 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-09 02:44:29,379 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,379 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,379 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,379 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,379 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-09 02:44:29,379 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,379 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,379 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,380 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,380 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-09 02:44:29,380 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,380 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,380 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,380 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,380 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-09 02:44:29,380 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,380 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,380 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,381 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,381 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-09 02:44:29,381 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,381 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,381 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,381 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:29,773 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-09 02:44:29,774 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,774 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,774 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,774 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,774 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-09 02:44:29,774 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,774 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,775 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,775 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,775 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-09 02:44:29,775 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,775 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,775 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,775 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,776 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-09 02:44:29,776 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,776 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,776 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,776 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,776 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-09 02:44:29,776 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,776 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,777 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-09 02:44:29,777 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:29,943 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-09 02:44:29,943 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-09 02:44:29,943 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:29,943 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:29,943 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:29,944 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-09 02:44:29,944 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-09 02:44:29,944 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:29,944 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:29,944 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:30,147 INFO L124 PetriNetUnfolderBase]: 28896/45634 cut-off events. [2024-11-09 02:44:30,147 INFO L125 PetriNetUnfolderBase]: For 66729/68306 co-relation queries the response was YES. [2024-11-09 02:44:30,297 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-09 02:44:30,503 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 68 changer transitions 0/200 dead transitions. [2024-11-09 02:44:30,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 1397 flow [2024-11-09 02:44:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:44:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:44:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-11-09 02:44:30,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7186440677966102 [2024-11-09 02:44:30,506 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 759 flow. Second operand 5 states and 212 transitions. [2024-11-09 02:44:30,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 1397 flow [2024-11-09 02:44:30,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 1382 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-09 02:44:30,699 INFO L231 Difference]: Finished difference. Result has 82 places, 147 transitions, 1057 flow [2024-11-09 02:44:30,699 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-09 02:44:30,700 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places. [2024-11-09 02:44:30,700 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 147 transitions, 1057 flow [2024-11-09 02:44:30,700 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-09 02:44:30,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:30,701 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-09 02:44:30,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:44:30,701 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-09 02:44:30,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 93800467, now seen corresponding path program 3 times [2024-11-09 02:44:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777701978] [2024-11-09 02:44:30,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:30,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:30,901 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-09 02:44:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:30,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777701978] [2024-11-09 02:44:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777701978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:30,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:30,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:44:30,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327320031] [2024-11-09 02:44:30,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:30,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:44:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:30,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:44:30,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:44:30,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:30,911 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-09 02:44:30,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:30,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:30,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:33,363 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-09 02:44:33,363 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 02:44:33,363 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:33,363 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:33,363 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:33,933 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-09 02:44:33,933 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,933 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,933 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,933 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,934 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-09 02:44:33,934 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,934 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,934 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,934 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,934 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-09 02:44:33,934 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,934 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,935 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:33,935 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:34,233 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-09 02:44:34,233 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,234 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,234 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,234 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,234 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-09 02:44:34,234 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,234 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,234 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,234 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,235 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-09 02:44:34,235 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,235 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,235 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,235 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:34,451 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-09 02:44:34,451 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-09 02:44:34,451 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:34,451 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:34,451 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:35,028 INFO L124 PetriNetUnfolderBase]: 32470/50995 cut-off events. [2024-11-09 02:44:35,028 INFO L125 PetriNetUnfolderBase]: For 103598/106226 co-relation queries the response was YES. [2024-11-09 02:44:35,185 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-09 02:44:35,320 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 106 changer transitions 4/242 dead transitions. [2024-11-09 02:44:35,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 242 transitions, 1922 flow [2024-11-09 02:44:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:44:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:44:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2024-11-09 02:44:35,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7259887005649718 [2024-11-09 02:44:35,321 INFO L175 Difference]: Start difference. First operand has 82 places, 147 transitions, 1057 flow. Second operand 6 states and 257 transitions. [2024-11-09 02:44:35,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 242 transitions, 1922 flow [2024-11-09 02:44:35,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 242 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:44:35,478 INFO L231 Difference]: Finished difference. Result has 87 places, 175 transitions, 1487 flow [2024-11-09 02:44:35,478 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-09 02:44:35,479 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 23 predicate places. [2024-11-09 02:44:35,479 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 175 transitions, 1487 flow [2024-11-09 02:44:35,479 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-09 02:44:35,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:35,480 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-09 02:44:35,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:44:35,480 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-09 02:44:35,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash 150968343, now seen corresponding path program 4 times [2024-11-09 02:44:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:35,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120843056] [2024-11-09 02:44:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:44:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120843056] [2024-11-09 02:44:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120843056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:35,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:44:35,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396677553] [2024-11-09 02:44:35,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:35,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:44:35,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:35,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:44:35,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:44:35,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:35,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 175 transitions, 1487 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-09 02:44:35,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:35,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:35,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:38,780 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][208], [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, 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-09 02:44:38,781 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 02:44:38,781 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:38,781 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:38,781 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 02:44:39,176 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][208], [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-09 02:44:39,177 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,177 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,177 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,177 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,178 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][208], [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-09 02:44:39,178 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,178 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,178 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,178 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,179 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][208], [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), 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-09 02:44:39,179 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,179 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,179 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,179 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 02:44:39,523 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][208], [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-09 02:44:39,523 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,523 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,523 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,523 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,524 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][208], [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-09 02:44:39,524 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,524 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,524 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,524 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,524 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][208], [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), 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-09 02:44:39,524 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,524 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,524 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,525 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-09 02:44:39,753 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][208], [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-09 02:44:39,754 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-09 02:44:39,754 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:39,754 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:39,754 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:44:40,295 INFO L124 PetriNetUnfolderBase]: 33384/52574 cut-off events. [2024-11-09 02:44:40,296 INFO L125 PetriNetUnfolderBase]: For 173933/176849 co-relation queries the response was YES. [2024-11-09 02:44:40,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188514 conditions, 52574 events. 33384/52574 cut-off events. For 173933/176849 co-relation queries the response was YES. Maximal size of possible extension queue 2897. Compared 442359 event pairs, 6641 based on Foata normal form. 1948/52119 useless extension candidates. Maximal degree in co-relation 117618. Up to 16795 conditions per place. [2024-11-09 02:44:40,635 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 124 selfloop transitions, 115 changer transitions 1/265 dead transitions. [2024-11-09 02:44:40,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 265 transitions, 2315 flow [2024-11-09 02:44:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:44:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 02:44:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 330 transitions. [2024-11-09 02:44:40,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6991525423728814 [2024-11-09 02:44:40,637 INFO L175 Difference]: Start difference. First operand has 87 places, 175 transitions, 1487 flow. Second operand 8 states and 330 transitions. [2024-11-09 02:44:40,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 265 transitions, 2315 flow [2024-11-09 02:44:41,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 265 transitions, 2258 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-09 02:44:41,088 INFO L231 Difference]: Finished difference. Result has 94 places, 184 transitions, 1828 flow [2024-11-09 02:44:41,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1828, PETRI_PLACES=94, PETRI_TRANSITIONS=184} [2024-11-09 02:44:41,089 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 30 predicate places. [2024-11-09 02:44:41,089 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 184 transitions, 1828 flow [2024-11-09 02:44:41,089 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-09 02:44:41,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:41,089 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-09 02:44:41,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:44:41,090 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-09 02:44:41,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1047361237, now seen corresponding path program 2 times [2024-11-09 02:44:41,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:41,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652816066] [2024-11-09 02:44:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:41,235 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-09 02:44:41,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652816066] [2024-11-09 02:44:41,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652816066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:41,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:41,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:44:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361015692] [2024-11-09 02:44:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:41,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:44:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:41,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:44:41,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:44:41,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:41,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 184 transitions, 1828 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-09 02:44:41,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:41,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:41,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:45,937 INFO L124 PetriNetUnfolderBase]: 33115/52821 cut-off events. [2024-11-09 02:44:45,937 INFO L125 PetriNetUnfolderBase]: For 238707/241624 co-relation queries the response was YES. [2024-11-09 02:44:46,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205143 conditions, 52821 events. 33115/52821 cut-off events. For 238707/241624 co-relation queries the response was YES. Maximal size of possible extension queue 2903. Compared 452647 event pairs, 6616 based on Foata normal form. 2317/52716 useless extension candidates. Maximal degree in co-relation 130936. Up to 17233 conditions per place. [2024-11-09 02:44:46,279 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 134 selfloop transitions, 147 changer transitions 2/308 dead transitions. [2024-11-09 02:44:46,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 308 transitions, 3151 flow [2024-11-09 02:44:46,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:44:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 02:44:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 336 transitions. [2024-11-09 02:44:46,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.711864406779661 [2024-11-09 02:44:46,281 INFO L175 Difference]: Start difference. First operand has 94 places, 184 transitions, 1828 flow. Second operand 8 states and 336 transitions. [2024-11-09 02:44:46,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 308 transitions, 3151 flow [2024-11-09 02:44:46,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 308 transitions, 2929 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-09 02:44:46,868 INFO L231 Difference]: Finished difference. Result has 99 places, 215 transitions, 2404 flow [2024-11-09 02:44:46,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2404, PETRI_PLACES=99, PETRI_TRANSITIONS=215} [2024-11-09 02:44:46,869 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 35 predicate places. [2024-11-09 02:44:46,870 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 215 transitions, 2404 flow [2024-11-09 02:44:46,870 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-09 02:44:46,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:46,870 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-09 02:44:46,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:44:46,871 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-09 02:44:46,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:46,871 INFO L85 PathProgramCache]: Analyzing trace with hash -592954411, now seen corresponding path program 2 times [2024-11-09 02:44:46,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:46,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920006641] [2024-11-09 02:44:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:47,019 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-09 02:44:47,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:47,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920006641] [2024-11-09 02:44:47,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920006641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:47,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:47,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:44:47,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727558754] [2024-11-09 02:44:47,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:47,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:44:47,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:47,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:44:47,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:44:47,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:47,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 215 transitions, 2404 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-09 02:44:47,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:47,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:47,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:51,775 INFO L124 PetriNetUnfolderBase]: 31338/51477 cut-off events. [2024-11-09 02:44:51,776 INFO L125 PetriNetUnfolderBase]: For 255680/256921 co-relation queries the response was YES. [2024-11-09 02:44:51,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198910 conditions, 51477 events. 31338/51477 cut-off events. For 255680/256921 co-relation queries the response was YES. Maximal size of possible extension queue 2755. Compared 455424 event pairs, 8736 based on Foata normal form. 686/50507 useless extension candidates. Maximal degree in co-relation 126718. Up to 22761 conditions per place. [2024-11-09 02:44:52,107 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 126 selfloop transitions, 127 changer transitions 14/292 dead transitions. [2024-11-09 02:44:52,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 292 transitions, 3522 flow [2024-11-09 02:44:52,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:44:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:44:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-11-09 02:44:52,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7254237288135593 [2024-11-09 02:44:52,109 INFO L175 Difference]: Start difference. First operand has 99 places, 215 transitions, 2404 flow. Second operand 5 states and 214 transitions. [2024-11-09 02:44:52,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 292 transitions, 3522 flow [2024-11-09 02:44:52,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 292 transitions, 3464 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:44:52,462 INFO L231 Difference]: Finished difference. Result has 103 places, 229 transitions, 2929 flow [2024-11-09 02:44:52,462 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2929, PETRI_PLACES=103, PETRI_TRANSITIONS=229} [2024-11-09 02:44:52,463 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 39 predicate places. [2024-11-09 02:44:52,463 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 229 transitions, 2929 flow [2024-11-09 02:44:52,463 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-09 02:44:52,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:52,463 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-09 02:44:52,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:44:52,464 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-09 02:44:52,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash -962217197, now seen corresponding path program 5 times [2024-11-09 02:44:52,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:52,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448572065] [2024-11-09 02:44:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:52,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:52,585 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-09 02:44:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448572065] [2024-11-09 02:44:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448572065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:52,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:52,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:44:52,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129594500] [2024-11-09 02:44:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:52,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:44:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:52,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:44:52,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:44:52,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:52,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 229 transitions, 2929 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-09 02:44:52,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:52,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:52,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:55,288 INFO L124 PetriNetUnfolderBase]: 19839/32654 cut-off events. [2024-11-09 02:44:55,289 INFO L125 PetriNetUnfolderBase]: For 176004/177330 co-relation queries the response was YES. [2024-11-09 02:44:55,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124372 conditions, 32654 events. 19839/32654 cut-off events. For 176004/177330 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 271214 event pairs, 5780 based on Foata normal form. 1016/32562 useless extension candidates. Maximal degree in co-relation 98280. Up to 16284 conditions per place. [2024-11-09 02:44:55,522 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 112 selfloop transitions, 113 changer transitions 24/274 dead transitions. [2024-11-09 02:44:55,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 274 transitions, 3579 flow [2024-11-09 02:44:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:44:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:44:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-11-09 02:44:55,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7152542372881356 [2024-11-09 02:44:55,523 INFO L175 Difference]: Start difference. First operand has 103 places, 229 transitions, 2929 flow. Second operand 5 states and 211 transitions. [2024-11-09 02:44:55,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 274 transitions, 3579 flow [2024-11-09 02:44:55,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 274 transitions, 3435 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:44:55,681 INFO L231 Difference]: Finished difference. Result has 107 places, 209 transitions, 2770 flow [2024-11-09 02:44:55,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2770, PETRI_PLACES=107, PETRI_TRANSITIONS=209} [2024-11-09 02:44:55,682 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 43 predicate places. [2024-11-09 02:44:55,683 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 209 transitions, 2770 flow [2024-11-09 02:44:55,683 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-09 02:44:55,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:55,683 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-09 02:44:55,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:44:55,684 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-09 02:44:55,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash 803745903, now seen corresponding path program 6 times [2024-11-09 02:44:55,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:55,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190198063] [2024-11-09 02:44:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:55,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:55,809 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-09 02:44:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190198063] [2024-11-09 02:44:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190198063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:55,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:44:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913556192] [2024-11-09 02:44:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:55,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:44:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:44:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:44:55,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:55,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 209 transitions, 2770 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-09 02:44:55,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:55,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:55,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:44:58,313 INFO L124 PetriNetUnfolderBase]: 13463/22329 cut-off events. [2024-11-09 02:44:58,314 INFO L125 PetriNetUnfolderBase]: For 115184/116320 co-relation queries the response was YES. [2024-11-09 02:44:58,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85762 conditions, 22329 events. 13463/22329 cut-off events. For 115184/116320 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 175396 event pairs, 3114 based on Foata normal form. 930/22705 useless extension candidates. Maximal degree in co-relation 71239. Up to 6337 conditions per place. [2024-11-09 02:44:58,447 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 112 selfloop transitions, 138 changer transitions 37/311 dead transitions. [2024-11-09 02:44:58,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 311 transitions, 4072 flow [2024-11-09 02:44:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:44:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 02:44:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 328 transitions. [2024-11-09 02:44:58,448 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2024-11-09 02:44:58,448 INFO L175 Difference]: Start difference. First operand has 107 places, 209 transitions, 2770 flow. Second operand 8 states and 328 transitions. [2024-11-09 02:44:58,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 311 transitions, 4072 flow [2024-11-09 02:44:58,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 311 transitions, 3826 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 02:44:58,528 INFO L231 Difference]: Finished difference. Result has 113 places, 202 transitions, 2782 flow [2024-11-09 02:44:58,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2782, PETRI_PLACES=113, PETRI_TRANSITIONS=202} [2024-11-09 02:44:58,529 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 49 predicate places. [2024-11-09 02:44:58,529 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 202 transitions, 2782 flow [2024-11-09 02:44:58,529 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-09 02:44:58,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:44:58,530 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-09 02:44:58,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:44:58,530 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-09 02:44:58,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:44:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash 609163479, now seen corresponding path program 7 times [2024-11-09 02:44:58,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:44:58,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416044113] [2024-11-09 02:44:58,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:44:58,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:44:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:44:58,678 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-09 02:44:58,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:44:58,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416044113] [2024-11-09 02:44:58,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416044113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:44:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:44:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:44:58,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666456271] [2024-11-09 02:44:58,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:44:58,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:44:58,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:44:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:44:58,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:44:58,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:44:58,684 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-09 02:44:58,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:44:58,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:44:58,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:45:00,817 INFO L124 PetriNetUnfolderBase]: 12306/19949 cut-off events. [2024-11-09 02:45:00,817 INFO L125 PetriNetUnfolderBase]: For 116133/116981 co-relation queries the response was YES. [2024-11-09 02:45:00,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79240 conditions, 19949 events. 12306/19949 cut-off events. For 116133/116981 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 151378 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-09 02:45:00,931 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 100 selfloop transitions, 138 changer transitions 31/293 dead transitions. [2024-11-09 02:45:00,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 293 transitions, 3831 flow [2024-11-09 02:45:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:45:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 02:45:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2024-11-09 02:45:00,933 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-11-09 02:45:00,933 INFO L175 Difference]: Start difference. First operand has 113 places, 202 transitions, 2782 flow. Second operand 9 states and 348 transitions. [2024-11-09 02:45:00,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 293 transitions, 3831 flow [2024-11-09 02:45:01,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 293 transitions, 3699 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 02:45:01,039 INFO L231 Difference]: Finished difference. Result has 119 places, 191 transitions, 2738 flow [2024-11-09 02:45:01,040 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-09 02:45:01,040 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 55 predicate places. [2024-11-09 02:45:01,040 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 191 transitions, 2738 flow [2024-11-09 02:45:01,041 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-09 02:45:01,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:45:01,041 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-09 02:45:01,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:45:01,041 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-09 02:45:01,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:45:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -399461363, now seen corresponding path program 8 times [2024-11-09 02:45:01,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:45:01,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883300578] [2024-11-09 02:45:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:45:01,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:45:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:45:01,173 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-09 02:45:01,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:45:01,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883300578] [2024-11-09 02:45:01,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883300578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:45:01,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:45:01,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:45:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193961687] [2024-11-09 02:45:01,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:45:01,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:45:01,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:45:01,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:45:01,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:45:01,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:45:01,180 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-09 02:45:01,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:45:01,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:45:01,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:45:03,308 INFO L124 PetriNetUnfolderBase]: 11602/19036 cut-off events. [2024-11-09 02:45:03,308 INFO L125 PetriNetUnfolderBase]: For 131458/132504 co-relation queries the response was YES. [2024-11-09 02:45:03,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76781 conditions, 19036 events. 11602/19036 cut-off events. For 131458/132504 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 145751 event pairs, 2893 based on Foata normal form. 644/19054 useless extension candidates. Maximal degree in co-relation 61767. Up to 6983 conditions per place. [2024-11-09 02:45:03,439 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 109 selfloop transitions, 136 changer transitions 19/288 dead transitions. [2024-11-09 02:45:03,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 3743 flow [2024-11-09 02:45:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:45:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 02:45:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 435 transitions. [2024-11-09 02:45:03,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.614406779661017 [2024-11-09 02:45:03,441 INFO L175 Difference]: Start difference. First operand has 119 places, 191 transitions, 2738 flow. Second operand 12 states and 435 transitions. [2024-11-09 02:45:03,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 3743 flow [2024-11-09 02:45:03,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 288 transitions, 3559 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-09 02:45:03,562 INFO L231 Difference]: Finished difference. Result has 127 places, 190 transitions, 2782 flow [2024-11-09 02:45:03,563 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-09 02:45:03,563 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 63 predicate places. [2024-11-09 02:45:03,563 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 190 transitions, 2782 flow [2024-11-09 02:45:03,564 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-09 02:45:03,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:45:03,564 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-09 02:45:03,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:45:03,564 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-09 02:45:03,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:45:03,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1616034583, now seen corresponding path program 9 times [2024-11-09 02:45:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:45:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922746243] [2024-11-09 02:45:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:45:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:45:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:45:03,689 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-09 02:45:03,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:45:03,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922746243] [2024-11-09 02:45:03,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922746243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:45:03,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:45:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:45:03,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031544291] [2024-11-09 02:45:03,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:45:03,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:45:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:45:03,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:45:03,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:45:03,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:45:03,696 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-09 02:45:03,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:45:03,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:45:03,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:45:05,628 INFO L124 PetriNetUnfolderBase]: 11593/18921 cut-off events. [2024-11-09 02:45:05,628 INFO L125 PetriNetUnfolderBase]: For 146091/146869 co-relation queries the response was YES. [2024-11-09 02:45:05,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78286 conditions, 18921 events. 11593/18921 cut-off events. For 146091/146869 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 143993 event pairs, 3101 based on Foata normal form. 412/18644 useless extension candidates. Maximal degree in co-relation 62815. Up to 7053 conditions per place. [2024-11-09 02:45:05,735 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 94 selfloop transitions, 128 changer transitions 50/296 dead transitions. [2024-11-09 02:45:05,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 3955 flow [2024-11-09 02:45:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:45:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 02:45:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 438 transitions. [2024-11-09 02:45:05,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2024-11-09 02:45:05,737 INFO L175 Difference]: Start difference. First operand has 127 places, 190 transitions, 2782 flow. Second operand 12 states and 438 transitions. [2024-11-09 02:45:05,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 3955 flow [2024-11-09 02:45:05,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 296 transitions, 3697 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-09 02:45:05,871 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 2659 flow [2024-11-09 02:45:05,871 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-09 02:45:05,872 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 68 predicate places. [2024-11-09 02:45:05,872 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 181 transitions, 2659 flow [2024-11-09 02:45:05,872 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-09 02:45:05,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:45:05,872 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-09 02:45:05,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:45:05,873 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-09 02:45:05,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:45:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash 928130973, now seen corresponding path program 3 times [2024-11-09 02:45:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:45:05,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815090523] [2024-11-09 02:45:05,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:45:05,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:45:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:45:06,003 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-09 02:45:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:45:06,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815090523] [2024-11-09 02:45:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815090523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:45:06,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:45:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:45:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563754296] [2024-11-09 02:45:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:45:06,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:45:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:45:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:45:06,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:45:06,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-09 02:45:06,009 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-09 02:45:06,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:45:06,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-09 02:45:06,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand