./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.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 0ead2366baa94ec77674f75cd829f45857f5651e204e91d33a749a2af2868461 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:26:28,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:26:28,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:26:28,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:26:28,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:26:28,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:26:28,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:26:28,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:26:28,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:26:28,915 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:26:28,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:26:28,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:26:28,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:26:28,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:26:28,916 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:26:28,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:26:28,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:26:28,916 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:26:28,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:26:28,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:26:28,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:26:28,917 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:26:28,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:26:28,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:26:28,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:26:28,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:26:28,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:26:28,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:26:28,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:26:28,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:26:28,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:26:28,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:26:28,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:26:28,919 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 0ead2366baa94ec77674f75cd829f45857f5651e204e91d33a749a2af2868461 [2025-03-04 02:26:29,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:26:29,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:26:29,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:26:29,124 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:26:29,124 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:26:29,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-03-04 02:26:30,255 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3684c506/5ff65634d1a4416c8bb7462d0a5d2547/FLAGa9707ce6c [2025-03-04 02:26:30,539 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:26:30,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-03-04 02:26:30,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3684c506/5ff65634d1a4416c8bb7462d0a5d2547/FLAGa9707ce6c [2025-03-04 02:26:30,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3684c506/5ff65634d1a4416c8bb7462d0a5d2547 [2025-03-04 02:26:30,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:26:30,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:26:30,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:26:30,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:26:30,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:26:30,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:26:30" (1/1) ... [2025-03-04 02:26:30,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf7dd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:30, skipping insertion in model container [2025-03-04 02:26:30,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:26:30" (1/1) ... [2025-03-04 02:26:30,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:26:30,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c[2124,2137] [2025-03-04 02:26:30,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:26:30,976 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:26:30,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c[2124,2137] [2025-03-04 02:26:30,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:26:31,004 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:26:31,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31 WrapperNode [2025-03-04 02:26:31,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:26:31,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:26:31,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:26:31,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:26:31,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,027 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2025-03-04 02:26:31,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:26:31,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:26:31,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:26:31,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:26:31,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,051 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]. [2025-03-04 02:26:31,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:26:31,056 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:26:31,056 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:26:31,056 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:26:31,057 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (1/1) ... [2025-03-04 02:26:31,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:26:31,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:31,083 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) [2025-03-04 02:26:31,090 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 [2025-03-04 02:26:31,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:26:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:26:31,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:26:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:26:31,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:26:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:26:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:26:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:26:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:26:31,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:26:31,109 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:26:31,170 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:26:31,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:26:31,301 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:26:31,302 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:26:31,410 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:26:31,410 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:26:31,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:26:31 BoogieIcfgContainer [2025-03-04 02:26:31,411 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:26:31,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:26:31,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:26:31,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:26:31,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:26:30" (1/3) ... [2025-03-04 02:26:31,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31acd6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:26:31, skipping insertion in model container [2025-03-04 02:26:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:26:31" (2/3) ... [2025-03-04 02:26:31,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31acd6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:26:31, skipping insertion in model container [2025-03-04 02:26:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:26:31" (3/3) ... [2025-03-04 02:26:31,419 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2025-03-04 02:26:31,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:26:31,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-nonblocking-cntr-alt.wvr.c that has 3 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:26:31,432 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:26:31,466 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:26:31,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 56 flow [2025-03-04 02:26:31,514 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-03-04 02:26:31,517 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:26:31,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 2/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-03-04 02:26:31,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 21 transitions, 56 flow [2025-03-04 02:26:31,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 48 flow [2025-03-04 02:26:31,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:26:31,546 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;@6cee2d29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:26:31,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:26:31,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:26:31,560 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-04 02:26:31,560 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:26:31,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:31,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:31,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:31,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2073263937, now seen corresponding path program 1 times [2025-03-04 02:26:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670099944] [2025-03-04 02:26:31,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:31,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:26:31,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:26:31,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:31,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:31,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670099944] [2025-03-04 02:26:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670099944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:31,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680210375] [2025-03-04 02:26:31,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:31,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:31,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:31,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:31,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-04 02:26:31,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2025-03-04 02:26:31,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:31,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-04 02:26:31,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:31,874 INFO L124 PetriNetUnfolderBase]: 70/140 cut-off events. [2025-03-04 02:26:31,874 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:26:31,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 140 events. 70/140 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 437 event pairs, 31 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 255. Up to 86 conditions per place. [2025-03-04 02:26:31,877 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 20 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2025-03-04 02:26:31,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 113 flow [2025-03-04 02:26:31,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:26:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:26:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-03-04 02:26:31,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-04 02:26:31,887 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 48 flow. Second operand 4 states and 44 transitions. [2025-03-04 02:26:31,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 113 flow [2025-03-04 02:26:31,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 26 transitions, 103 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:26:31,893 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 54 flow [2025-03-04 02:26:31,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2025-03-04 02:26:31,897 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2025-03-04 02:26:31,898 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 54 flow [2025-03-04 02:26:31,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2025-03-04 02:26:31,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:31,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:31,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:26:31,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:31,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:31,899 INFO L85 PathProgramCache]: Analyzing trace with hash -246956766, now seen corresponding path program 1 times [2025-03-04 02:26:31,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:31,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113838654] [2025-03-04 02:26:31,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:31,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:31,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:26:31,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:26:31,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:31,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:32,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:32,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113838654] [2025-03-04 02:26:32,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113838654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:32,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:32,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:26:32,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312691478] [2025-03-04 02:26:32,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:32,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:26:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:32,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:26:32,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:26:32,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-04 02:26:32,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2025-03-04 02:26:32,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:32,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-04 02:26:32,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:32,108 INFO L124 PetriNetUnfolderBase]: 89/184 cut-off events. [2025-03-04 02:26:32,108 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 02:26:32,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 184 events. 89/184 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 625 event pairs, 49 based on Foata normal form. 13/196 useless extension candidates. Maximal degree in co-relation 87. Up to 124 conditions per place. [2025-03-04 02:26:32,112 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-03-04 02:26:32,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 129 flow [2025-03-04 02:26:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:26:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:26:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-03-04 02:26:32,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-03-04 02:26:32,114 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 54 flow. Second operand 4 states and 43 transitions. [2025-03-04 02:26:32,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 129 flow [2025-03-04 02:26:32,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 123 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:26:32,115 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 64 flow [2025-03-04 02:26:32,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2025-03-04 02:26:32,116 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2025-03-04 02:26:32,116 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 64 flow [2025-03-04 02:26:32,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) [2025-03-04 02:26:32,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:32,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:32,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:26:32,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:32,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1941528830, now seen corresponding path program 1 times [2025-03-04 02:26:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313318923] [2025-03-04 02:26:32,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:32,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:26:32,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:32,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:32,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:32,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313318923] [2025-03-04 02:26:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313318923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991912094] [2025-03-04 02:26:32,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:26:32,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:32,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:32,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:32,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:26:32,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:26:32,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:32,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:32,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:32,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:26:32,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:32,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991912094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:33,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:33,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-04 02:26:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421521392] [2025-03-04 02:26:33,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:33,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 02:26:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:33,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 02:26:33,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-03-04 02:26:33,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:26:33,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 64 flow. Second operand has 24 states, 24 states have (on average 4.875) internal successors, (117), 24 states have internal predecessors, (117), 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) [2025-03-04 02:26:33,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:33,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:26:33,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:34,058 INFO L124 PetriNetUnfolderBase]: 396/689 cut-off events. [2025-03-04 02:26:34,058 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-03-04 02:26:34,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 689 events. 396/689 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2892 event pairs, 26 based on Foata normal form. 2/691 useless extension candidates. Maximal degree in co-relation 632. Up to 195 conditions per place. [2025-03-04 02:26:34,062 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 89 selfloop transitions, 64 changer transitions 13/167 dead transitions. [2025-03-04 02:26:34,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 167 transitions, 833 flow [2025-03-04 02:26:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 02:26:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 02:26:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 244 transitions. [2025-03-04 02:26:34,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2025-03-04 02:26:34,065 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 64 flow. Second operand 28 states and 244 transitions. [2025-03-04 02:26:34,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 167 transitions, 833 flow [2025-03-04 02:26:34,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 167 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:26:34,068 INFO L231 Difference]: Finished difference. Result has 68 places, 90 transitions, 567 flow [2025-03-04 02:26:34,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=567, PETRI_PLACES=68, PETRI_TRANSITIONS=90} [2025-03-04 02:26:34,068 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 45 predicate places. [2025-03-04 02:26:34,068 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 90 transitions, 567 flow [2025-03-04 02:26:34,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.875) internal successors, (117), 24 states have internal predecessors, (117), 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) [2025-03-04 02:26:34,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:34,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:34,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:26:34,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:34,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:34,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash 83652846, now seen corresponding path program 2 times [2025-03-04 02:26:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229125933] [2025-03-04 02:26:34,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:34,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:34,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:34,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:34,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:34,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:34,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229125933] [2025-03-04 02:26:34,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229125933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:34,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23222861] [2025-03-04 02:26:34,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:34,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:34,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:34,481 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:34,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:26:34,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:34,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:34,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:34,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:34,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:26:34,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:34,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:35,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23222861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:35,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:35,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 02:26:35,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348124330] [2025-03-04 02:26:35,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:35,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:26:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:35,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:26:35,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:26:35,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:26:35,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 90 transitions, 567 flow. Second operand has 23 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 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) [2025-03-04 02:26:35,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:35,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:26:35,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:35,983 INFO L124 PetriNetUnfolderBase]: 579/1036 cut-off events. [2025-03-04 02:26:35,983 INFO L125 PetriNetUnfolderBase]: For 2841/2841 co-relation queries the response was YES. [2025-03-04 02:26:35,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4341 conditions, 1036 events. 579/1036 cut-off events. For 2841/2841 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4919 event pairs, 17 based on Foata normal form. 2/1038 useless extension candidates. Maximal degree in co-relation 4284. Up to 219 conditions per place. [2025-03-04 02:26:35,994 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 114 selfloop transitions, 109 changer transitions 29/253 dead transitions. [2025-03-04 02:26:35,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 253 transitions, 2066 flow [2025-03-04 02:26:35,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 02:26:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 02:26:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 275 transitions. [2025-03-04 02:26:35,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40922619047619047 [2025-03-04 02:26:35,996 INFO L175 Difference]: Start difference. First operand has 68 places, 90 transitions, 567 flow. Second operand 32 states and 275 transitions. [2025-03-04 02:26:35,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 253 transitions, 2066 flow [2025-03-04 02:26:36,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 253 transitions, 2035 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 02:26:36,016 INFO L231 Difference]: Finished difference. Result has 106 places, 149 transitions, 1311 flow [2025-03-04 02:26:36,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1311, PETRI_PLACES=106, PETRI_TRANSITIONS=149} [2025-03-04 02:26:36,018 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 83 predicate places. [2025-03-04 02:26:36,018 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 149 transitions, 1311 flow [2025-03-04 02:26:36,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 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) [2025-03-04 02:26:36,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:36,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:36,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:26:36,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 02:26:36,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:36,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:36,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1610253440, now seen corresponding path program 3 times [2025-03-04 02:26:36,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:36,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428014029] [2025-03-04 02:26:36,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:36,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:36,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:36,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:36,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:36,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428014029] [2025-03-04 02:26:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428014029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363853690] [2025-03-04 02:26:36,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:36,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:36,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:36,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:36,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:26:36,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:36,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:36,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:36,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:36,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:26:36,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:36,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:36,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363853690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:36,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:36,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 02:26:36,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14164103] [2025-03-04 02:26:36,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:26:36,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:36,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:26:36,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:26:36,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:26:36,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 149 transitions, 1311 flow. Second operand has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 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) [2025-03-04 02:26:36,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:36,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:26:36,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:37,959 INFO L124 PetriNetUnfolderBase]: 685/1235 cut-off events. [2025-03-04 02:26:37,959 INFO L125 PetriNetUnfolderBase]: For 6753/6753 co-relation queries the response was YES. [2025-03-04 02:26:37,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6481 conditions, 1235 events. 685/1235 cut-off events. For 6753/6753 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6243 event pairs, 17 based on Foata normal form. 16/1251 useless extension candidates. Maximal degree in co-relation 6396. Up to 268 conditions per place. [2025-03-04 02:26:37,969 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 130 selfloop transitions, 144 changer transitions 27/302 dead transitions. [2025-03-04 02:26:37,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 302 transitions, 3091 flow [2025-03-04 02:26:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 02:26:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-04 02:26:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 340 transitions. [2025-03-04 02:26:37,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3948896631823461 [2025-03-04 02:26:37,973 INFO L175 Difference]: Start difference. First operand has 106 places, 149 transitions, 1311 flow. Second operand 41 states and 340 transitions. [2025-03-04 02:26:37,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 302 transitions, 3091 flow [2025-03-04 02:26:38,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 302 transitions, 2752 flow, removed 130 selfloop flow, removed 12 redundant places. [2025-03-04 02:26:38,004 INFO L231 Difference]: Finished difference. Result has 148 places, 185 transitions, 1957 flow [2025-03-04 02:26:38,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1957, PETRI_PLACES=148, PETRI_TRANSITIONS=185} [2025-03-04 02:26:38,005 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 125 predicate places. [2025-03-04 02:26:38,005 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 185 transitions, 1957 flow [2025-03-04 02:26:38,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 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) [2025-03-04 02:26:38,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:38,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:38,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:26:38,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:38,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:38,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1860395712, now seen corresponding path program 4 times [2025-03-04 02:26:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023077245] [2025-03-04 02:26:38,206 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:38,210 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:38,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:38,215 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:38,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:38,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:38,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023077245] [2025-03-04 02:26:38,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023077245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:38,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401300601] [2025-03-04 02:26:38,382 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:38,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:38,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:38,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:38,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:26:38,416 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:38,424 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:38,424 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:38,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:38,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:26:38,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:38,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401300601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:38,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 27 [2025-03-04 02:26:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989016929] [2025-03-04 02:26:38,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:38,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 02:26:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:38,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 02:26:38,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:26:38,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:26:38,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 185 transitions, 1957 flow. Second operand has 28 states, 28 states have (on average 4.714285714285714) internal successors, (132), 28 states have internal predecessors, (132), 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) [2025-03-04 02:26:38,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:38,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:26:38,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:40,905 INFO L124 PetriNetUnfolderBase]: 1036/1841 cut-off events. [2025-03-04 02:26:40,905 INFO L125 PetriNetUnfolderBase]: For 17595/17595 co-relation queries the response was YES. [2025-03-04 02:26:40,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11131 conditions, 1841 events. 1036/1841 cut-off events. For 17595/17595 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9721 event pairs, 6 based on Foata normal form. 22/1863 useless extension candidates. Maximal degree in co-relation 11028. Up to 415 conditions per place. [2025-03-04 02:26:40,918 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 211 selfloop transitions, 302 changer transitions 22/536 dead transitions. [2025-03-04 02:26:40,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 536 transitions, 6611 flow [2025-03-04 02:26:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 02:26:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-03-04 02:26:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 581 transitions. [2025-03-04 02:26:40,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2025-03-04 02:26:40,920 INFO L175 Difference]: Start difference. First operand has 148 places, 185 transitions, 1957 flow. Second operand 70 states and 581 transitions. [2025-03-04 02:26:40,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 536 transitions, 6611 flow [2025-03-04 02:26:40,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 536 transitions, 6121 flow, removed 151 selfloop flow, removed 21 redundant places. [2025-03-04 02:26:40,977 INFO L231 Difference]: Finished difference. Result has 218 places, 363 transitions, 4978 flow [2025-03-04 02:26:40,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=4978, PETRI_PLACES=218, PETRI_TRANSITIONS=363} [2025-03-04 02:26:40,977 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 195 predicate places. [2025-03-04 02:26:40,977 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 363 transitions, 4978 flow [2025-03-04 02:26:40,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.714285714285714) internal successors, (132), 28 states have internal predecessors, (132), 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) [2025-03-04 02:26:40,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:40,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:40,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:26:41,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:41,180 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:41,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:41,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1423069888, now seen corresponding path program 5 times [2025-03-04 02:26:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:41,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109736432] [2025-03-04 02:26:41,181 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:41,184 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:26:41,187 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:41,187 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:26:41,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:41,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:41,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109736432] [2025-03-04 02:26:41,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109736432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:41,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:26:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555810672] [2025-03-04 02:26:41,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:41,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:26:41,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:41,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:26:41,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:26:41,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-04 02:26:41,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 363 transitions, 4978 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:41,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:41,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-04 02:26:41,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:41,723 INFO L124 PetriNetUnfolderBase]: 878/1661 cut-off events. [2025-03-04 02:26:41,723 INFO L125 PetriNetUnfolderBase]: For 33220/33242 co-relation queries the response was YES. [2025-03-04 02:26:41,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12317 conditions, 1661 events. 878/1661 cut-off events. For 33220/33242 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9300 event pairs, 40 based on Foata normal form. 3/1649 useless extension candidates. Maximal degree in co-relation 12160. Up to 1122 conditions per place. [2025-03-04 02:26:41,741 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 244 selfloop transitions, 36 changer transitions 6/394 dead transitions. [2025-03-04 02:26:41,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 394 transitions, 5889 flow [2025-03-04 02:26:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:26:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:26:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2025-03-04 02:26:41,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-03-04 02:26:41,742 INFO L175 Difference]: Start difference. First operand has 218 places, 363 transitions, 4978 flow. Second operand 10 states and 102 transitions. [2025-03-04 02:26:41,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 394 transitions, 5889 flow [2025-03-04 02:26:41,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 394 transitions, 5040 flow, removed 327 selfloop flow, removed 14 redundant places. [2025-03-04 02:26:41,884 INFO L231 Difference]: Finished difference. Result has 210 places, 373 transitions, 4410 flow [2025-03-04 02:26:41,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4136, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4410, PETRI_PLACES=210, PETRI_TRANSITIONS=373} [2025-03-04 02:26:41,885 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 187 predicate places. [2025-03-04 02:26:41,885 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 373 transitions, 4410 flow [2025-03-04 02:26:41,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:41,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:41,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:41,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:26:41,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:41,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:41,886 INFO L85 PathProgramCache]: Analyzing trace with hash 279813022, now seen corresponding path program 6 times [2025-03-04 02:26:41,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:41,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742414831] [2025-03-04 02:26:41,887 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:41,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:41,890 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:26:41,892 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:41,893 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:26:41,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:42,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742414831] [2025-03-04 02:26:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742414831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:26:42,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11886992] [2025-03-04 02:26:42,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:42,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:26:42,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:42,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:26:42,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:26:42,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-04 02:26:42,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 373 transitions, 4410 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:42,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:42,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-04 02:26:42,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:42,325 INFO L124 PetriNetUnfolderBase]: 879/1661 cut-off events. [2025-03-04 02:26:42,325 INFO L125 PetriNetUnfolderBase]: For 28326/28356 co-relation queries the response was YES. [2025-03-04 02:26:42,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11138 conditions, 1661 events. 879/1661 cut-off events. For 28326/28356 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9268 event pairs, 43 based on Foata normal form. 3/1647 useless extension candidates. Maximal degree in co-relation 11006. Up to 1163 conditions per place. [2025-03-04 02:26:42,343 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 261 selfloop transitions, 21 changer transitions 4/394 dead transitions. [2025-03-04 02:26:42,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 394 transitions, 5208 flow [2025-03-04 02:26:42,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:26:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:26:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2025-03-04 02:26:42,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2025-03-04 02:26:42,344 INFO L175 Difference]: Start difference. First operand has 210 places, 373 transitions, 4410 flow. Second operand 10 states and 97 transitions. [2025-03-04 02:26:42,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 394 transitions, 5208 flow [2025-03-04 02:26:42,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 394 transitions, 5037 flow, removed 60 selfloop flow, removed 7 redundant places. [2025-03-04 02:26:42,454 INFO L231 Difference]: Finished difference. Result has 213 places, 375 transitions, 4364 flow [2025-03-04 02:26:42,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4283, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4364, PETRI_PLACES=213, PETRI_TRANSITIONS=375} [2025-03-04 02:26:42,456 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 190 predicate places. [2025-03-04 02:26:42,456 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 375 transitions, 4364 flow [2025-03-04 02:26:42,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:42,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:42,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:42,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:26:42,457 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:42,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:42,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1998156728, now seen corresponding path program 7 times [2025-03-04 02:26:42,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:42,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986666302] [2025-03-04 02:26:42,458 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:42,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:42,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:26:42,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:42,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:42,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:42,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986666302] [2025-03-04 02:26:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986666302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:42,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:42,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:26:42,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104281545] [2025-03-04 02:26:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:42,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:26:42,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:42,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:26:42,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:26:42,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-04 02:26:42,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 375 transitions, 4364 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:42,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:42,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-04 02:26:42,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:42,937 INFO L124 PetriNetUnfolderBase]: 891/1694 cut-off events. [2025-03-04 02:26:42,937 INFO L125 PetriNetUnfolderBase]: For 27162/27186 co-relation queries the response was YES. [2025-03-04 02:26:42,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11275 conditions, 1694 events. 891/1694 cut-off events. For 27162/27186 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9605 event pairs, 45 based on Foata normal form. 3/1684 useless extension candidates. Maximal degree in co-relation 11134. Up to 1149 conditions per place. [2025-03-04 02:26:42,957 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 257 selfloop transitions, 36 changer transitions 4/405 dead transitions. [2025-03-04 02:26:42,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 405 transitions, 5276 flow [2025-03-04 02:26:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:26:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:26:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2025-03-04 02:26:42,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2025-03-04 02:26:42,960 INFO L175 Difference]: Start difference. First operand has 213 places, 375 transitions, 4364 flow. Second operand 11 states and 111 transitions. [2025-03-04 02:26:42,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 405 transitions, 5276 flow [2025-03-04 02:26:43,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 405 transitions, 5234 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:43,084 INFO L231 Difference]: Finished difference. Result has 219 places, 380 transitions, 4552 flow [2025-03-04 02:26:43,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4324, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4552, PETRI_PLACES=219, PETRI_TRANSITIONS=380} [2025-03-04 02:26:43,085 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 196 predicate places. [2025-03-04 02:26:43,085 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 380 transitions, 4552 flow [2025-03-04 02:26:43,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:43,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:43,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:43,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:26:43,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:43,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:43,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1865884688, now seen corresponding path program 8 times [2025-03-04 02:26:43,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:43,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74411107] [2025-03-04 02:26:43,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:43,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:43,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:26:43,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:43,091 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:26:43,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:43,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74411107] [2025-03-04 02:26:43,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74411107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:43,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:43,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:26:43,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457651620] [2025-03-04 02:26:43,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:43,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:26:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:43,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:26:43,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:26:43,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-04 02:26:43,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 380 transitions, 4552 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:43,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:43,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-04 02:26:43,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:43,530 INFO L124 PetriNetUnfolderBase]: 890/1689 cut-off events. [2025-03-04 02:26:43,531 INFO L125 PetriNetUnfolderBase]: For 29278/29304 co-relation queries the response was YES. [2025-03-04 02:26:43,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11438 conditions, 1689 events. 890/1689 cut-off events. For 29278/29304 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9521 event pairs, 45 based on Foata normal form. 3/1679 useless extension candidates. Maximal degree in co-relation 11302. Up to 1149 conditions per place. [2025-03-04 02:26:43,544 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 252 selfloop transitions, 34 changer transitions 7/401 dead transitions. [2025-03-04 02:26:43,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 401 transitions, 5368 flow [2025-03-04 02:26:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:26:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:26:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2025-03-04 02:26:43,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-04 02:26:43,545 INFO L175 Difference]: Start difference. First operand has 219 places, 380 transitions, 4552 flow. Second operand 10 states and 100 transitions. [2025-03-04 02:26:43,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 401 transitions, 5368 flow [2025-03-04 02:26:43,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 401 transitions, 5236 flow, removed 51 selfloop flow, removed 7 redundant places. [2025-03-04 02:26:43,660 INFO L231 Difference]: Finished difference. Result has 223 places, 380 transitions, 4552 flow [2025-03-04 02:26:43,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4458, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4552, PETRI_PLACES=223, PETRI_TRANSITIONS=380} [2025-03-04 02:26:43,661 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 200 predicate places. [2025-03-04 02:26:43,661 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 380 transitions, 4552 flow [2025-03-04 02:26:43,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:43,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:43,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:43,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:26:43,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:43,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:43,661 INFO L85 PathProgramCache]: Analyzing trace with hash 323302044, now seen corresponding path program 9 times [2025-03-04 02:26:43,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:43,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981500215] [2025-03-04 02:26:43,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:43,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:43,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:43,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:43,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:43,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:43,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:43,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981500215] [2025-03-04 02:26:43,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981500215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:43,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923360306] [2025-03-04 02:26:43,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:43,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:43,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:43,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:43,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:26:43,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:43,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:43,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:43,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:43,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:26:43,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:43,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:43,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923360306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:43,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:43,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 02:26:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624664746] [2025-03-04 02:26:43,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:43,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:26:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:43,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:26:43,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:26:43,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-03-04 02:26:43,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 380 transitions, 4552 flow. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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) [2025-03-04 02:26:43,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:43,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-03-04 02:26:43,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:44,074 INFO L124 PetriNetUnfolderBase]: 1056/1902 cut-off events. [2025-03-04 02:26:44,074 INFO L125 PetriNetUnfolderBase]: For 32126/32170 co-relation queries the response was YES. [2025-03-04 02:26:44,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12754 conditions, 1902 events. 1056/1902 cut-off events. For 32126/32170 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10354 event pairs, 29 based on Foata normal form. 36/1927 useless extension candidates. Maximal degree in co-relation 12641. Up to 903 conditions per place. [2025-03-04 02:26:44,087 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 228 selfloop transitions, 165 changer transitions 1/441 dead transitions. [2025-03-04 02:26:44,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 441 transitions, 6144 flow [2025-03-04 02:26:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:26:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:26:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2025-03-04 02:26:44,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2025-03-04 02:26:44,090 INFO L175 Difference]: Start difference. First operand has 223 places, 380 transitions, 4552 flow. Second operand 6 states and 64 transitions. [2025-03-04 02:26:44,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 441 transitions, 6144 flow [2025-03-04 02:26:44,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 441 transitions, 6054 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-03-04 02:26:44,226 INFO L231 Difference]: Finished difference. Result has 212 places, 401 transitions, 5474 flow [2025-03-04 02:26:44,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4348, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5474, PETRI_PLACES=212, PETRI_TRANSITIONS=401} [2025-03-04 02:26:44,227 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 189 predicate places. [2025-03-04 02:26:44,227 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 401 transitions, 5474 flow [2025-03-04 02:26:44,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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) [2025-03-04 02:26:44,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:44,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:44,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:26:44,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 02:26:44,428 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:44,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1857833524, now seen corresponding path program 10 times [2025-03-04 02:26:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:44,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237210469] [2025-03-04 02:26:44,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:44,431 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:44,434 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:44,434 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:44,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:44,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:44,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237210469] [2025-03-04 02:26:44,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237210469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:44,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860078669] [2025-03-04 02:26:44,562 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:44,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:44,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:44,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:44,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:26:44,586 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:44,595 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:44,595 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:44,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:44,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:26:44,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:44,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860078669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:45,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:45,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2025-03-04 02:26:45,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902912775] [2025-03-04 02:26:45,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:45,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:26:45,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:45,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:26:45,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:26:45,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:26:45,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 401 transitions, 5474 flow. Second operand has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 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) [2025-03-04 02:26:45,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:45,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:26:45,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:45,824 INFO L124 PetriNetUnfolderBase]: 1269/2218 cut-off events. [2025-03-04 02:26:45,824 INFO L125 PetriNetUnfolderBase]: For 34248/34248 co-relation queries the response was YES. [2025-03-04 02:26:45,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15714 conditions, 2218 events. 1269/2218 cut-off events. For 34248/34248 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11969 event pairs, 10 based on Foata normal form. 3/2221 useless extension candidates. Maximal degree in co-relation 15528. Up to 911 conditions per place. [2025-03-04 02:26:45,838 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 172 selfloop transitions, 352 changer transitions 21/546 dead transitions. [2025-03-04 02:26:45,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 546 transitions, 8248 flow [2025-03-04 02:26:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:26:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:26:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 192 transitions. [2025-03-04 02:26:45,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39751552795031053 [2025-03-04 02:26:45,840 INFO L175 Difference]: Start difference. First operand has 212 places, 401 transitions, 5474 flow. Second operand 23 states and 192 transitions. [2025-03-04 02:26:45,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 546 transitions, 8248 flow [2025-03-04 02:26:46,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 546 transitions, 8134 flow, removed 57 selfloop flow, removed 0 redundant places. [2025-03-04 02:26:46,015 INFO L231 Difference]: Finished difference. Result has 246 places, 483 transitions, 7939 flow [2025-03-04 02:26:46,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5424, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7939, PETRI_PLACES=246, PETRI_TRANSITIONS=483} [2025-03-04 02:26:46,018 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 223 predicate places. [2025-03-04 02:26:46,018 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 483 transitions, 7939 flow [2025-03-04 02:26:46,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 27 states have internal predecessors, (128), 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) [2025-03-04 02:26:46,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:46,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:46,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 02:26:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:46,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:46,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash -867281600, now seen corresponding path program 11 times [2025-03-04 02:26:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798579740] [2025-03-04 02:26:46,220 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:46,223 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:46,225 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:46,225 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:46,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:46,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:46,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798579740] [2025-03-04 02:26:46,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798579740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:46,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027813850] [2025-03-04 02:26:46,351 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:46,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:46,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:46,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:46,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:26:46,377 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 02:26:46,384 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:46,384 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:46,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:46,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 02:26:46,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:46,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:46,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027813850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:46,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:46,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2025-03-04 02:26:46,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22981298] [2025-03-04 02:26:46,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:46,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 02:26:46,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:46,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 02:26:46,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2025-03-04 02:26:46,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:26:46,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 483 transitions, 7939 flow. Second operand has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 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) [2025-03-04 02:26:46,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:46,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:26:46,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:47,897 INFO L124 PetriNetUnfolderBase]: 1402/2447 cut-off events. [2025-03-04 02:26:47,897 INFO L125 PetriNetUnfolderBase]: For 38655/38655 co-relation queries the response was YES. [2025-03-04 02:26:47,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19363 conditions, 2447 events. 1402/2447 cut-off events. For 38655/38655 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13526 event pairs, 13 based on Foata normal form. 3/2450 useless extension candidates. Maximal degree in co-relation 19228. Up to 1073 conditions per place. [2025-03-04 02:26:47,917 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 252 selfloop transitions, 387 changer transitions 12/652 dead transitions. [2025-03-04 02:26:47,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 652 transitions, 11377 flow [2025-03-04 02:26:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:26:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:26:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 283 transitions. [2025-03-04 02:26:47,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3963585434173669 [2025-03-04 02:26:47,919 INFO L175 Difference]: Start difference. First operand has 246 places, 483 transitions, 7939 flow. Second operand 34 states and 283 transitions. [2025-03-04 02:26:47,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 652 transitions, 11377 flow [2025-03-04 02:26:48,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 652 transitions, 10896 flow, removed 215 selfloop flow, removed 7 redundant places. [2025-03-04 02:26:48,192 INFO L231 Difference]: Finished difference. Result has 283 places, 583 transitions, 10579 flow [2025-03-04 02:26:48,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7671, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=10579, PETRI_PLACES=283, PETRI_TRANSITIONS=583} [2025-03-04 02:26:48,193 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 260 predicate places. [2025-03-04 02:26:48,193 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 583 transitions, 10579 flow [2025-03-04 02:26:48,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 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) [2025-03-04 02:26:48,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:48,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:48,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 02:26:48,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:48,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash 835601310, now seen corresponding path program 12 times [2025-03-04 02:26:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768005611] [2025-03-04 02:26:48,395 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:48,397 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-03-04 02:26:48,400 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 02:26:48,400 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:26:48,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:48,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768005611] [2025-03-04 02:26:48,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768005611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:26:48,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:26:48,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:26:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029067271] [2025-03-04 02:26:48,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:26:48,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:26:48,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:48,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:26:48,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:26:48,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2025-03-04 02:26:48,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 583 transitions, 10579 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:48,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:48,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2025-03-04 02:26:48,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:48,915 INFO L124 PetriNetUnfolderBase]: 1195/2215 cut-off events. [2025-03-04 02:26:48,916 INFO L125 PetriNetUnfolderBase]: For 38635/38651 co-relation queries the response was YES. [2025-03-04 02:26:48,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19631 conditions, 2215 events. 1195/2215 cut-off events. For 38635/38651 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12979 event pairs, 16 based on Foata normal form. 3/2207 useless extension candidates. Maximal degree in co-relation 19542. Up to 1557 conditions per place. [2025-03-04 02:26:48,935 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 401 selfloop transitions, 21 changer transitions 4/597 dead transitions. [2025-03-04 02:26:48,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 597 transitions, 11513 flow [2025-03-04 02:26:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:26:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:26:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2025-03-04 02:26:48,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-03-04 02:26:48,936 INFO L175 Difference]: Start difference. First operand has 283 places, 583 transitions, 10579 flow. Second operand 10 states and 93 transitions. [2025-03-04 02:26:48,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 597 transitions, 11513 flow [2025-03-04 02:26:49,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 597 transitions, 11265 flow, removed 30 selfloop flow, removed 9 redundant places. [2025-03-04 02:26:49,248 INFO L231 Difference]: Finished difference. Result has 280 places, 583 transitions, 10412 flow [2025-03-04 02:26:49,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10322, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10412, PETRI_PLACES=280, PETRI_TRANSITIONS=583} [2025-03-04 02:26:49,248 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 257 predicate places. [2025-03-04 02:26:49,248 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 583 transitions, 10412 flow [2025-03-04 02:26:49,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:49,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:49,249 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:49,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:26:49,249 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:49,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash -529752361, now seen corresponding path program 13 times [2025-03-04 02:26:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627888295] [2025-03-04 02:26:49,249 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:49,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:26:49,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:26:49,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:49,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:49,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627888295] [2025-03-04 02:26:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627888295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135406998] [2025-03-04 02:26:49,432 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:49,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:49,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:49,434 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:49,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:26:49,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:26:49,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:26:49,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:49,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:49,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:26:49,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:49,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135406998] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:50,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 02:26:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661272316] [2025-03-04 02:26:50,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:50,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 02:26:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:50,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 02:26:50,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 02:26:50,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:26:50,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 583 transitions, 10412 flow. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 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) [2025-03-04 02:26:50,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:50,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:26:50,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:53,106 INFO L124 PetriNetUnfolderBase]: 2047/3561 cut-off events. [2025-03-04 02:26:53,106 INFO L125 PetriNetUnfolderBase]: For 65774/65774 co-relation queries the response was YES. [2025-03-04 02:26:53,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31417 conditions, 3561 events. 2047/3561 cut-off events. For 65774/65774 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20839 event pairs, 37 based on Foata normal form. 6/3567 useless extension candidates. Maximal degree in co-relation 31328. Up to 1034 conditions per place. [2025-03-04 02:26:53,135 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 361 selfloop transitions, 644 changer transitions 30/1036 dead transitions. [2025-03-04 02:26:53,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1036 transitions, 19903 flow [2025-03-04 02:26:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-03-04 02:26:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2025-03-04 02:26:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 677 transitions. [2025-03-04 02:26:53,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3792717086834734 [2025-03-04 02:26:53,136 INFO L175 Difference]: Start difference. First operand has 280 places, 583 transitions, 10412 flow. Second operand 85 states and 677 transitions. [2025-03-04 02:26:53,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 1036 transitions, 19903 flow [2025-03-04 02:26:53,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 1036 transitions, 19831 flow, removed 20 selfloop flow, removed 7 redundant places. [2025-03-04 02:26:53,651 INFO L231 Difference]: Finished difference. Result has 369 places, 865 transitions, 18255 flow [2025-03-04 02:26:53,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=10348, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=18255, PETRI_PLACES=369, PETRI_TRANSITIONS=865} [2025-03-04 02:26:53,652 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 346 predicate places. [2025-03-04 02:26:53,652 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 865 transitions, 18255 flow [2025-03-04 02:26:53,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 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) [2025-03-04 02:26:53,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:53,652 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:53,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:26:53,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:26:53,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:53,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1773726905, now seen corresponding path program 14 times [2025-03-04 02:26:53,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:53,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803348978] [2025-03-04 02:26:53,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:53,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:26:53,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:26:53,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:53,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:54,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:54,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803348978] [2025-03-04 02:26:54,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803348978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:54,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715901883] [2025-03-04 02:26:54,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:54,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:54,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:54,018 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:54,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:26:54,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:26:54,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:26:54,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:54,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:54,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:26:54,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:54,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715901883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:54,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:54,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-03-04 02:26:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415125659] [2025-03-04 02:26:54,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:54,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 02:26:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:54,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 02:26:54,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 02:26:54,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:26:54,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 865 transitions, 18255 flow. Second operand has 33 states, 33 states have (on average 4.7272727272727275) internal successors, (156), 33 states have internal predecessors, (156), 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) [2025-03-04 02:26:54,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:54,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:26:54,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:57,281 INFO L124 PetriNetUnfolderBase]: 2292/4082 cut-off events. [2025-03-04 02:26:57,282 INFO L125 PetriNetUnfolderBase]: For 96459/96459 co-relation queries the response was YES. [2025-03-04 02:26:57,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39709 conditions, 4082 events. 2292/4082 cut-off events. For 96459/96459 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 25065 event pairs, 74 based on Foata normal form. 4/4086 useless extension candidates. Maximal degree in co-relation 39604. Up to 1116 conditions per place. [2025-03-04 02:26:57,317 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 375 selfloop transitions, 742 changer transitions 23/1141 dead transitions. [2025-03-04 02:26:57,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1141 transitions, 24783 flow [2025-03-04 02:26:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-04 02:26:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2025-03-04 02:26:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 553 transitions. [2025-03-04 02:26:57,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2025-03-04 02:26:57,319 INFO L175 Difference]: Start difference. First operand has 369 places, 865 transitions, 18255 flow. Second operand 66 states and 553 transitions. [2025-03-04 02:26:57,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1141 transitions, 24783 flow [2025-03-04 02:26:58,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1141 transitions, 23953 flow, removed 305 selfloop flow, removed 17 redundant places. [2025-03-04 02:26:58,341 INFO L231 Difference]: Finished difference. Result has 429 places, 977 transitions, 22375 flow [2025-03-04 02:26:58,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=17569, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=642, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=22375, PETRI_PLACES=429, PETRI_TRANSITIONS=977} [2025-03-04 02:26:58,342 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 406 predicate places. [2025-03-04 02:26:58,342 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 977 transitions, 22375 flow [2025-03-04 02:26:58,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.7272727272727275) internal successors, (156), 33 states have internal predecessors, (156), 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) [2025-03-04 02:26:58,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:58,342 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:58,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 02:26:58,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 02:26:58,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:58,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1243854769, now seen corresponding path program 15 times [2025-03-04 02:26:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:58,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049750267] [2025-03-04 02:26:58,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:58,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:26:58,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:26:58,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:26:58,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049750267] [2025-03-04 02:26:58,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049750267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859807439] [2025-03-04 02:26:58,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:58,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:58,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:58,727 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:58,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:26:58,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 02:26:58,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:26:58,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 02:26:58,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:58,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:26:58,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:58,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859807439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:59,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:59,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-03-04 02:26:59,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865887557] [2025-03-04 02:26:59,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:59,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 02:26:59,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:59,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 02:26:59,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 02:26:59,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:26:59,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 977 transitions, 22375 flow. Second operand has 33 states, 33 states have (on average 4.696969696969697) internal successors, (155), 33 states have internal predecessors, (155), 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) [2025-03-04 02:26:59,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:59,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:26:59,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:03,445 INFO L124 PetriNetUnfolderBase]: 2840/5104 cut-off events. [2025-03-04 02:27:03,445 INFO L125 PetriNetUnfolderBase]: For 166422/166422 co-relation queries the response was YES. [2025-03-04 02:27:03,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53875 conditions, 5104 events. 2840/5104 cut-off events. For 166422/166422 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 33257 event pairs, 56 based on Foata normal form. 8/5112 useless extension candidates. Maximal degree in co-relation 53761. Up to 1302 conditions per place. [2025-03-04 02:27:03,499 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 429 selfloop transitions, 981 changer transitions 27/1438 dead transitions. [2025-03-04 02:27:03,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 1438 transitions, 34096 flow [2025-03-04 02:27:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-04 02:27:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2025-03-04 02:27:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 815 transitions. [2025-03-04 02:27:03,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37679149329634765 [2025-03-04 02:27:03,501 INFO L175 Difference]: Start difference. First operand has 429 places, 977 transitions, 22375 flow. Second operand 103 states and 815 transitions. [2025-03-04 02:27:03,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 527 places, 1438 transitions, 34096 flow [2025-03-04 02:27:05,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 1438 transitions, 32989 flow, removed 234 selfloop flow, removed 32 redundant places. [2025-03-04 02:27:05,274 INFO L231 Difference]: Finished difference. Result has 525 places, 1228 transitions, 30953 flow [2025-03-04 02:27:05,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=21509, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=752, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=30953, PETRI_PLACES=525, PETRI_TRANSITIONS=1228} [2025-03-04 02:27:05,275 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 502 predicate places. [2025-03-04 02:27:05,276 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 1228 transitions, 30953 flow [2025-03-04 02:27:05,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.696969696969697) internal successors, (155), 33 states have internal predecessors, (155), 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) [2025-03-04 02:27:05,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:05,276 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:05,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 02:27:05,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 02:27:05,477 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:05,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash 558064775, now seen corresponding path program 16 times [2025-03-04 02:27:05,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:05,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103936689] [2025-03-04 02:27:05,477 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:05,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:05,479 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:27:05,482 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:05,482 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:05,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:05,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:05,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103936689] [2025-03-04 02:27:05,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103936689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:05,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464429927] [2025-03-04 02:27:05,623 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:27:05,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:05,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:05,625 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:05,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:27:05,655 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:27:05,665 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:05,666 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:27:05,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:05,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:27:05,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:05,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:06,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464429927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:06,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:06,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-03-04 02:27:06,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387253355] [2025-03-04 02:27:06,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:06,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 02:27:06,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:06,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 02:27:06,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 02:27:06,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:27:06,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 1228 transitions, 30953 flow. Second operand has 33 states, 33 states have (on average 4.7272727272727275) internal successors, (156), 33 states have internal predecessors, (156), 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) [2025-03-04 02:27:06,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:06,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:27:06,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:12,553 INFO L124 PetriNetUnfolderBase]: 3390/6062 cut-off events. [2025-03-04 02:27:12,553 INFO L125 PetriNetUnfolderBase]: For 262413/262413 co-relation queries the response was YES. [2025-03-04 02:27:12,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70182 conditions, 6062 events. 3390/6062 cut-off events. For 262413/262413 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 40864 event pairs, 51 based on Foata normal form. 11/6073 useless extension candidates. Maximal degree in co-relation 70047. Up to 1605 conditions per place. [2025-03-04 02:27:12,638 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 510 selfloop transitions, 1257 changer transitions 31/1799 dead transitions. [2025-03-04 02:27:12,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 1799 transitions, 46292 flow [2025-03-04 02:27:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-04 02:27:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2025-03-04 02:27:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 1013 transitions. [2025-03-04 02:27:12,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36822973464194836 [2025-03-04 02:27:12,647 INFO L175 Difference]: Start difference. First operand has 525 places, 1228 transitions, 30953 flow. Second operand 131 states and 1013 transitions. [2025-03-04 02:27:12,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 1799 transitions, 46292 flow [2025-03-04 02:27:16,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 1799 transitions, 44276 flow, removed 674 selfloop flow, removed 24 redundant places. [2025-03-04 02:27:16,069 INFO L231 Difference]: Finished difference. Result has 649 places, 1534 transitions, 41432 flow [2025-03-04 02:27:16,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=29550, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=969, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=131, PETRI_FLOW=41432, PETRI_PLACES=649, PETRI_TRANSITIONS=1534} [2025-03-04 02:27:16,070 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 626 predicate places. [2025-03-04 02:27:16,070 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 1534 transitions, 41432 flow [2025-03-04 02:27:16,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.7272727272727275) internal successors, (156), 33 states have internal predecessors, (156), 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) [2025-03-04 02:27:16,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:16,070 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:16,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:16,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:27:16,271 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:16,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:16,272 INFO L85 PathProgramCache]: Analyzing trace with hash 187761577, now seen corresponding path program 17 times [2025-03-04 02:27:16,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:16,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095104821] [2025-03-04 02:27:16,272 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:16,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:16,275 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:27:16,277 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:16,277 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:16,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:16,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095104821] [2025-03-04 02:27:16,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095104821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709061913] [2025-03-04 02:27:16,580 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:27:16,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:16,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:16,583 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:16,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 02:27:16,609 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:27:16,617 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:16,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:16,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:16,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:27:16,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:16,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709061913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:17,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:17,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 02:27:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462111874] [2025-03-04 02:27:17,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 02:27:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:17,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 02:27:17,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 02:27:17,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:27:17,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 1534 transitions, 41432 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 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) [2025-03-04 02:27:17,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:17,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:27:17,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:21,902 INFO L124 PetriNetUnfolderBase]: 4010/7140 cut-off events. [2025-03-04 02:27:21,902 INFO L125 PetriNetUnfolderBase]: For 332906/332906 co-relation queries the response was YES. [2025-03-04 02:27:21,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87114 conditions, 7140 events. 4010/7140 cut-off events. For 332906/332906 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 49204 event pairs, 88 based on Foata normal form. 6/7146 useless extension candidates. Maximal degree in co-relation 86968. Up to 2034 conditions per place. [2025-03-04 02:27:21,985 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 588 selfloop transitions, 1453 changer transitions 19/2061 dead transitions. [2025-03-04 02:27:21,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 2061 transitions, 58281 flow [2025-03-04 02:27:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-04 02:27:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2025-03-04 02:27:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 615 transitions. [2025-03-04 02:27:21,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39575289575289574 [2025-03-04 02:27:21,987 INFO L175 Difference]: Start difference. First operand has 649 places, 1534 transitions, 41432 flow. Second operand 74 states and 615 transitions. [2025-03-04 02:27:21,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 2061 transitions, 58281 flow [2025-03-04 02:27:27,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 2061 transitions, 56422 flow, removed 559 selfloop flow, removed 38 redundant places. [2025-03-04 02:27:27,108 INFO L231 Difference]: Finished difference. Result has 710 places, 1851 transitions, 54417 flow [2025-03-04 02:27:27,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40051, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=54417, PETRI_PLACES=710, PETRI_TRANSITIONS=1851} [2025-03-04 02:27:27,110 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 687 predicate places. [2025-03-04 02:27:27,110 INFO L471 AbstractCegarLoop]: Abstraction has has 710 places, 1851 transitions, 54417 flow [2025-03-04 02:27:27,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 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) [2025-03-04 02:27:27,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:27,110 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:27,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 02:27:27,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:27,311 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:27,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash 408112485, now seen corresponding path program 18 times [2025-03-04 02:27:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:27,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955363922] [2025-03-04 02:27:27,311 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:27:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:27,315 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:27:27,318 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:27,318 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:27:27,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:27,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955363922] [2025-03-04 02:27:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955363922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:27,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193318377] [2025-03-04 02:27:27,501 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:27:27,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:27,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:27,503 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:27,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 02:27:27,530 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:27:27,543 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:27,543 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:27:27,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:27,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:27:27,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:27,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:28,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193318377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:28,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:28,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 02:27:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711645968] [2025-03-04 02:27:28,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:28,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 02:27:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:28,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 02:27:28,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 02:27:28,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:27:28,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 1851 transitions, 54417 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 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) [2025-03-04 02:27:28,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:28,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:27:28,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:32,705 INFO L124 PetriNetUnfolderBase]: 4367/7751 cut-off events. [2025-03-04 02:27:32,705 INFO L125 PetriNetUnfolderBase]: For 364495/364495 co-relation queries the response was YES. [2025-03-04 02:27:32,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99233 conditions, 7751 events. 4367/7751 cut-off events. For 364495/364495 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 54267 event pairs, 101 based on Foata normal form. 2/7753 useless extension candidates. Maximal degree in co-relation 99070. Up to 3888 conditions per place. [2025-03-04 02:27:32,800 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 664 selfloop transitions, 1508 changer transitions 12/2185 dead transitions. [2025-03-04 02:27:32,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 2185 transitions, 66707 flow [2025-03-04 02:27:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 02:27:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-03-04 02:27:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 444 transitions. [2025-03-04 02:27:32,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38441558441558443 [2025-03-04 02:27:32,801 INFO L175 Difference]: Start difference. First operand has 710 places, 1851 transitions, 54417 flow. Second operand 55 states and 444 transitions. [2025-03-04 02:27:32,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 761 places, 2185 transitions, 66707 flow [2025-03-04 02:27:39,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 743 places, 2185 transitions, 65170 flow, removed 685 selfloop flow, removed 18 redundant places. [2025-03-04 02:27:39,889 INFO L231 Difference]: Finished difference. Result has 771 places, 2069 transitions, 65454 flow [2025-03-04 02:27:39,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=53067, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1851, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=65454, PETRI_PLACES=771, PETRI_TRANSITIONS=2069} [2025-03-04 02:27:39,891 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 748 predicate places. [2025-03-04 02:27:39,891 INFO L471 AbstractCegarLoop]: Abstraction has has 771 places, 2069 transitions, 65454 flow [2025-03-04 02:27:39,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 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) [2025-03-04 02:27:39,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:39,891 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:39,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:40,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-04 02:27:40,092 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:40,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:40,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1281853165, now seen corresponding path program 19 times [2025-03-04 02:27:40,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:40,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674983212] [2025-03-04 02:27:40,093 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:27:40,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:40,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:27:40,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:40,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:40,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:40,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674983212] [2025-03-04 02:27:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674983212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414100193] [2025-03-04 02:27:40,248 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:27:40,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:40,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:40,250 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:40,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 02:27:40,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:27:40,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:40,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:40,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:40,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:27:40,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:40,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:40,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414100193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:40,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 02:27:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991704043] [2025-03-04 02:27:40,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:40,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 02:27:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:40,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 02:27:40,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 02:27:40,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:27:40,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 771 places, 2069 transitions, 65454 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 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) [2025-03-04 02:27:40,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:40,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:27:40,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:48,125 INFO L124 PetriNetUnfolderBase]: 4807/8572 cut-off events. [2025-03-04 02:27:48,125 INFO L125 PetriNetUnfolderBase]: For 369225/369225 co-relation queries the response was YES. [2025-03-04 02:27:48,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114469 conditions, 8572 events. 4807/8572 cut-off events. For 369225/369225 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 61697 event pairs, 97 based on Foata normal form. 4/8576 useless extension candidates. Maximal degree in co-relation 114285. Up to 3654 conditions per place. [2025-03-04 02:27:48,267 INFO L140 encePairwiseOnDemand]: 9/21 looper letters, 835 selfloop transitions, 1628 changer transitions 18/2482 dead transitions. [2025-03-04 02:27:48,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 847 places, 2482 transitions, 80366 flow [2025-03-04 02:27:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-04 02:27:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2025-03-04 02:27:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 638 transitions. [2025-03-04 02:27:48,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3845690174804099 [2025-03-04 02:27:48,269 INFO L175 Difference]: Start difference. First operand has 771 places, 2069 transitions, 65454 flow. Second operand 79 states and 638 transitions. [2025-03-04 02:27:48,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 847 places, 2482 transitions, 80366 flow [2025-03-04 02:27:56,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 834 places, 2482 transitions, 79895 flow, removed 164 selfloop flow, removed 13 redundant places. [2025-03-04 02:27:56,461 INFO L231 Difference]: Finished difference. Result has 862 places, 2284 transitions, 78364 flow [2025-03-04 02:27:56,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=65003, PETRI_DIFFERENCE_MINUEND_PLACES=756, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2069, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1421, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=78364, PETRI_PLACES=862, PETRI_TRANSITIONS=2284} [2025-03-04 02:27:56,463 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 839 predicate places. [2025-03-04 02:27:56,463 INFO L471 AbstractCegarLoop]: Abstraction has has 862 places, 2284 transitions, 78364 flow [2025-03-04 02:27:56,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 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) [2025-03-04 02:27:56,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:56,463 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:56,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 02:27:56,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:56,664 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:27:56,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1343830449, now seen corresponding path program 20 times [2025-03-04 02:27:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221487664] [2025-03-04 02:27:56,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:56,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:56,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:27:56,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:56,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:56,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:56,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221487664] [2025-03-04 02:27:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221487664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:56,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231051349] [2025-03-04 02:27:56,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:56,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:56,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:56,794 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:27:56,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 02:27:56,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 02:27:56,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:56,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:56,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:56,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:27:56,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:56,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:57,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231051349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:57,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:57,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 02:27:57,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958703063] [2025-03-04 02:27:57,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:57,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 02:27:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:57,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 02:27:57,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 02:27:57,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2025-03-04 02:27:57,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 862 places, 2284 transitions, 78364 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 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) [2025-03-04 02:27:57,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:57,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2025-03-04 02:27:57,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:28:04,757 INFO L124 PetriNetUnfolderBase]: 5193/9259 cut-off events. [2025-03-04 02:28:04,758 INFO L125 PetriNetUnfolderBase]: For 457470/457470 co-relation queries the response was YES. [2025-03-04 02:28:04,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130552 conditions, 9259 events. 5193/9259 cut-off events. For 457470/457470 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 67639 event pairs, 107 based on Foata normal form. 5/9264 useless extension candidates. Maximal degree in co-relation 130343. Up to 4442 conditions per place. [2025-03-04 02:28:04,900 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 768 selfloop transitions, 1854 changer transitions 18/2641 dead transitions. [2025-03-04 02:28:04,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 2641 transitions, 91249 flow [2025-03-04 02:28:04,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-04 02:28:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2025-03-04 02:28:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 563 transitions. [2025-03-04 02:28:04,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36229086229086227 [2025-03-04 02:28:04,901 INFO L175 Difference]: Start difference. First operand has 862 places, 2284 transitions, 78364 flow. Second operand 74 states and 563 transitions. [2025-03-04 02:28:04,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 2641 transitions, 91249 flow