/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:25:26,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:25:27,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:25:27,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:25:27,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:25:27,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:25:27,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:25:27,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:25:27,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:25:27,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:25:27,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:25:27,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:25:27,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:25:27,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:25:27,051 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:25:27,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:25:27,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:25:27,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:25:27,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:25:27,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:25:27,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:25:27,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:25:27,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:25:27,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:25:27,054 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:25:27,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:25:27,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:25:27,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:25:27,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:25:27,271 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:25:27,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2025-04-13 20:25:28,565 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c8e0ccf/7370451e84a64583940bb7e8dace7f4e/FLAGf88451b50 [2025-04-13 20:25:28,772 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:25:28,774 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2025-04-13 20:25:28,781 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c8e0ccf/7370451e84a64583940bb7e8dace7f4e/FLAGf88451b50 [2025-04-13 20:25:29,616 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23c8e0ccf/7370451e84a64583940bb7e8dace7f4e [2025-04-13 20:25:29,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:25:29,619 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:25:29,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:25:29,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:25:29,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:25:29,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178f3bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29, skipping insertion in model container [2025-04-13 20:25:29,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:25:29,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2218,2231] [2025-04-13 20:25:29,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:25:29,815 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:25:29,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2218,2231] [2025-04-13 20:25:29,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:25:29,858 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:25:29,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29 WrapperNode [2025-04-13 20:25:29,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:25:29,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:25:29,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:25:29,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:25:29,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,889 INFO L138 Inliner]: procedures = 20, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 88 [2025-04-13 20:25:29,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:25:29,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:25:29,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:25:29,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:25:29,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,910 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-04-13 20:25:29,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:25:29,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:25:29,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:25:29,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:25:29,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (1/1) ... [2025-04-13 20:25:29,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:25:29,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:25:29,950 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-04-13 20:25:29,951 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-04-13 20:25:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:25:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:25:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:25:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:25:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:25:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:25:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:25:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:25:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:25:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:25:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:25:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:25:29,969 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:25:30,033 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:25:30,035 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:25:30,175 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:25:30,175 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:25:30,175 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:25:30,294 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:25:30,299 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:25:30,301 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:25:30,304 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:25:30,307 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:25:30,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:25:30 BoogieIcfgContainer [2025-04-13 20:25:30,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:25:30,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:25:30,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:25:30,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:25:30,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:25:29" (1/3) ... [2025-04-13 20:25:30,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1a2899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:25:30, skipping insertion in model container [2025-04-13 20:25:30,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:25:29" (2/3) ... [2025-04-13 20:25:30,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1a2899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:25:30, skipping insertion in model container [2025-04-13 20:25:30,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:25:30" (3/3) ... [2025-04-13 20:25:30,313 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-04-13 20:25:30,321 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:25:30,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-determinism.wvr.c that has 5 procedures, 32 locations, 35 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:25:30,322 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:25:30,366 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 20:25:30,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-13 20:25:30,415 INFO L116 PetriNetUnfolderBase]: 8/35 cut-off events. [2025-04-13 20:25:30,423 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:25:30,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 35 events. 8/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-13 20:25:30,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-13 20:25:30,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 92 flow [2025-04-13 20:25:30,435 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:25:30,445 INFO L340 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;@565e8ae0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:25:30,445 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 20:25:30,456 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:25:30,457 INFO L116 PetriNetUnfolderBase]: 8/33 cut-off events. [2025-04-13 20:25:30,457 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:25:30,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:30,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-04-13 20:25:30,458 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:30,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1613703410, now seen corresponding path program 1 times [2025-04-13 20:25:30,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:30,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752352408] [2025-04-13 20:25:30,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:25:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:30,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:25:30,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:25:30,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:25:30,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:30,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:30,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752352408] [2025-04-13 20:25:30,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752352408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:30,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:30,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:25:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241673233] [2025-04-13 20:25:30,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:30,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:25:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:30,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:25:30,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:25:30,777 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:30,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04-13 20:25:30,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:30,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:30,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:31,132 INFO L116 PetriNetUnfolderBase]: 3224/4088 cut-off events. [2025-04-13 20:25:31,132 INFO L117 PetriNetUnfolderBase]: For 355/355 co-relation queries the response was YES. [2025-04-13 20:25:31,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8494 conditions, 4088 events. 3224/4088 cut-off events. For 355/355 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13955 event pairs, 685 based on Foata normal form. 1/2769 useless extension candidates. Maximal degree in co-relation 7524. Up to 3696 conditions per place. [2025-04-13 20:25:31,158 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 48 selfloop transitions, 3 changer transitions 2/53 dead transitions. [2025-04-13 20:25:31,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 257 flow [2025-04-13 20:25:31,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:25:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:25:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-13 20:25:31,169 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812 [2025-04-13 20:25:31,170 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 92 flow. Second operand 3 states and 68 transitions. [2025-04-13 20:25:31,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 257 flow [2025-04-13 20:25:31,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 227 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:25:31,181 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 99 flow [2025-04-13 20:25:31,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2025-04-13 20:25:31,185 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2025-04-13 20:25:31,185 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 99 flow [2025-04-13 20:25:31,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04-13 20:25:31,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:31,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:31,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:25:31,185 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:31,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1576540869, now seen corresponding path program 1 times [2025-04-13 20:25:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:31,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59847630] [2025-04-13 20:25:31,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:25:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:31,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:25:31,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:25:31,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:25:31,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:31,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59847630] [2025-04-13 20:25:31,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59847630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:31,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:31,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:25:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171944189] [2025-04-13 20:25:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:31,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:25:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:31,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:25:31,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:25:31,262 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:31,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-04-13 20:25:31,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:31,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:31,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:31,592 INFO L116 PetriNetUnfolderBase]: 4355/5662 cut-off events. [2025-04-13 20:25:31,592 INFO L117 PetriNetUnfolderBase]: For 1010/1010 co-relation queries the response was YES. [2025-04-13 20:25:31,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12496 conditions, 5662 events. 4355/5662 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21630 event pairs, 1616 based on Foata normal form. 161/4521 useless extension candidates. Maximal degree in co-relation 7141. Up to 3101 conditions per place. [2025-04-13 20:25:31,610 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 60 selfloop transitions, 4 changer transitions 2/66 dead transitions. [2025-04-13 20:25:31,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 66 transitions, 310 flow [2025-04-13 20:25:31,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:25:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:25:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-04-13 20:25:31,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-13 20:25:31,611 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 99 flow. Second operand 3 states and 78 transitions. [2025-04-13 20:25:31,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 66 transitions, 310 flow [2025-04-13 20:25:31,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 66 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:25:31,613 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 136 flow [2025-04-13 20:25:31,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-04-13 20:25:31,613 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-04-13 20:25:31,613 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 136 flow [2025-04-13 20:25:31,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-04-13 20:25:31,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:31,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:31,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:25:31,614 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:31,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:31,614 INFO L85 PathProgramCache]: Analyzing trace with hash 443049547, now seen corresponding path program 2 times [2025-04-13 20:25:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:31,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611453952] [2025-04-13 20:25:31,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:25:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:31,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:25:31,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:25:31,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:25:31,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:31,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:31,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611453952] [2025-04-13 20:25:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611453952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:31,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:31,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:25:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499782074] [2025-04-13 20:25:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:31,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:25:31,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:31,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:25:31,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:25:31,683 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:31,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-04-13 20:25:31,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:31,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:31,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:31,919 INFO L116 PetriNetUnfolderBase]: 2459/3267 cut-off events. [2025-04-13 20:25:31,919 INFO L117 PetriNetUnfolderBase]: For 2745/2745 co-relation queries the response was YES. [2025-04-13 20:25:31,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8047 conditions, 3267 events. 2459/3267 cut-off events. For 2745/2745 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11401 event pairs, 1117 based on Foata normal form. 601/3205 useless extension candidates. Maximal degree in co-relation 7562. Up to 3091 conditions per place. [2025-04-13 20:25:31,933 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 39 selfloop transitions, 2 changer transitions 12/53 dead transitions. [2025-04-13 20:25:31,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 279 flow [2025-04-13 20:25:31,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:25:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:25:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-13 20:25:31,935 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-13 20:25:31,935 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 136 flow. Second operand 3 states and 63 transitions. [2025-04-13 20:25:31,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 279 flow [2025-04-13 20:25:31,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:25:31,940 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2025-04-13 20:25:31,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-04-13 20:25:31,941 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2025-04-13 20:25:31,941 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 114 flow [2025-04-13 20:25:31,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-04-13 20:25:31,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:31,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:31,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:25:31,942 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:31,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash 68453698, now seen corresponding path program 1 times [2025-04-13 20:25:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:31,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580063420] [2025-04-13 20:25:31,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:25:31,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:31,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:25:31,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:31,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:25:31,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:32,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:32,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580063420] [2025-04-13 20:25:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580063420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:32,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:25:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146215798] [2025-04-13 20:25:32,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:32,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:25:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:32,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:25:32,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:25:32,206 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:32,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 114 flow. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 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-04-13 20:25:32,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:32,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:32,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:32,964 INFO L116 PetriNetUnfolderBase]: 7613/10172 cut-off events. [2025-04-13 20:25:32,964 INFO L117 PetriNetUnfolderBase]: For 4550/4550 co-relation queries the response was YES. [2025-04-13 20:25:32,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24561 conditions, 10172 events. 7613/10172 cut-off events. For 4550/4550 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 44844 event pairs, 824 based on Foata normal form. 174/8115 useless extension candidates. Maximal degree in co-relation 22562. Up to 3860 conditions per place. [2025-04-13 20:25:32,998 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 152 selfloop transitions, 26 changer transitions 3/181 dead transitions. [2025-04-13 20:25:32,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 181 transitions, 900 flow [2025-04-13 20:25:32,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:25:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:25:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 236 transitions. [2025-04-13 20:25:32,999 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5501165501165501 [2025-04-13 20:25:32,999 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 114 flow. Second operand 11 states and 236 transitions. [2025-04-13 20:25:32,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 181 transitions, 900 flow [2025-04-13 20:25:33,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 181 transitions, 884 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-04-13 20:25:33,004 INFO L231 Difference]: Finished difference. Result has 53 places, 57 transitions, 310 flow [2025-04-13 20:25:33,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=310, PETRI_PLACES=53, PETRI_TRANSITIONS=57} [2025-04-13 20:25:33,005 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2025-04-13 20:25:33,005 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 310 flow [2025-04-13 20:25:33,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 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-04-13 20:25:33,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:33,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:33,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:25:33,006 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:33,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:33,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1323683894, now seen corresponding path program 2 times [2025-04-13 20:25:33,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:33,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085049700] [2025-04-13 20:25:33,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:25:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:33,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:25:33,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:33,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:25:33,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:33,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:33,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085049700] [2025-04-13 20:25:33,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085049700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:33,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:33,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:25:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610773955] [2025-04-13 20:25:33,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:33,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:25:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:33,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:25:33,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:25:33,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:33,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 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-04-13 20:25:33,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:33,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:33,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:34,394 INFO L116 PetriNetUnfolderBase]: 15246/20317 cut-off events. [2025-04-13 20:25:34,395 INFO L117 PetriNetUnfolderBase]: For 44440/44440 co-relation queries the response was YES. [2025-04-13 20:25:34,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64961 conditions, 20317 events. 15246/20317 cut-off events. For 44440/44440 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 98731 event pairs, 1393 based on Foata normal form. 601/18054 useless extension candidates. Maximal degree in co-relation 62434. Up to 4620 conditions per place. [2025-04-13 20:25:34,470 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 183 selfloop transitions, 68 changer transitions 4/255 dead transitions. [2025-04-13 20:25:34,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 255 transitions, 1642 flow [2025-04-13 20:25:34,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:25:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:25:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 283 transitions. [2025-04-13 20:25:34,474 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5581854043392505 [2025-04-13 20:25:34,474 INFO L175 Difference]: Start difference. First operand has 53 places, 57 transitions, 310 flow. Second operand 13 states and 283 transitions. [2025-04-13 20:25:34,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 255 transitions, 1642 flow [2025-04-13 20:25:34,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 255 transitions, 1623 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-13 20:25:34,492 INFO L231 Difference]: Finished difference. Result has 72 places, 99 transitions, 824 flow [2025-04-13 20:25:34,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=824, PETRI_PLACES=72, PETRI_TRANSITIONS=99} [2025-04-13 20:25:34,493 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2025-04-13 20:25:34,493 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 99 transitions, 824 flow [2025-04-13 20:25:34,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 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-04-13 20:25:34,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:34,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:34,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:25:34,493 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:34,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash 686955812, now seen corresponding path program 3 times [2025-04-13 20:25:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:34,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277062334] [2025-04-13 20:25:34,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:25:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:34,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:25:34,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:34,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:25:34,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:34,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:34,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277062334] [2025-04-13 20:25:34,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277062334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:34,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:34,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:25:34,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269971607] [2025-04-13 20:25:34,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:34,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:25:34,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:34,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:25:34,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:25:34,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:34,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 99 transitions, 824 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-04-13 20:25:34,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:34,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:34,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:36,045 INFO L116 PetriNetUnfolderBase]: 20024/26603 cut-off events. [2025-04-13 20:25:36,046 INFO L117 PetriNetUnfolderBase]: For 141189/141189 co-relation queries the response was YES. [2025-04-13 20:25:36,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106797 conditions, 26603 events. 20024/26603 cut-off events. For 141189/141189 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 134911 event pairs, 6230 based on Foata normal form. 3/22827 useless extension candidates. Maximal degree in co-relation 103793. Up to 20266 conditions per place. [2025-04-13 20:25:36,208 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 167 selfloop transitions, 28 changer transitions 1/196 dead transitions. [2025-04-13 20:25:36,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 196 transitions, 1790 flow [2025-04-13 20:25:36,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:25:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:25:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2025-04-13 20:25:36,209 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5274725274725275 [2025-04-13 20:25:36,210 INFO L175 Difference]: Start difference. First operand has 72 places, 99 transitions, 824 flow. Second operand 7 states and 144 transitions. [2025-04-13 20:25:36,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 196 transitions, 1790 flow [2025-04-13 20:25:36,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 196 transitions, 1709 flow, removed 39 selfloop flow, removed 1 redundant places. [2025-04-13 20:25:36,358 INFO L231 Difference]: Finished difference. Result has 81 places, 124 transitions, 1104 flow [2025-04-13 20:25:36,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1104, PETRI_PLACES=81, PETRI_TRANSITIONS=124} [2025-04-13 20:25:36,358 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 42 predicate places. [2025-04-13 20:25:36,358 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 124 transitions, 1104 flow [2025-04-13 20:25:36,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-04-13 20:25:36,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:36,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:36,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:25:36,359 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:36,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash -509486924, now seen corresponding path program 4 times [2025-04-13 20:25:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:36,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656107325] [2025-04-13 20:25:36,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:25:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:36,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:25:36,371 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:36,371 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:25:36,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:36,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:36,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656107325] [2025-04-13 20:25:36,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656107325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:36,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:36,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:25:36,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805279202] [2025-04-13 20:25:36,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:36,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:25:36,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:36,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:25:36,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:25:36,514 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:36,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 124 transitions, 1104 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-04-13 20:25:36,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:36,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:36,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:38,424 INFO L116 PetriNetUnfolderBase]: 24111/32031 cut-off events. [2025-04-13 20:25:38,425 INFO L117 PetriNetUnfolderBase]: For 168903/168903 co-relation queries the response was YES. [2025-04-13 20:25:38,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130091 conditions, 32031 events. 24111/32031 cut-off events. For 168903/168903 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 167637 event pairs, 5772 based on Foata normal form. 3/27463 useless extension candidates. Maximal degree in co-relation 126875. Up to 20098 conditions per place. [2025-04-13 20:25:38,568 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 184 selfloop transitions, 67 changer transitions 3/254 dead transitions. [2025-04-13 20:25:38,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 254 transitions, 2410 flow [2025-04-13 20:25:38,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:25:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:25:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2025-04-13 20:25:38,570 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2025-04-13 20:25:38,570 INFO L175 Difference]: Start difference. First operand has 81 places, 124 transitions, 1104 flow. Second operand 8 states and 174 transitions. [2025-04-13 20:25:38,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 254 transitions, 2410 flow [2025-04-13 20:25:38,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 254 transitions, 2389 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-13 20:25:38,758 INFO L231 Difference]: Finished difference. Result has 92 places, 163 transitions, 1756 flow [2025-04-13 20:25:38,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1756, PETRI_PLACES=92, PETRI_TRANSITIONS=163} [2025-04-13 20:25:38,759 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2025-04-13 20:25:38,759 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 163 transitions, 1756 flow [2025-04-13 20:25:38,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-04-13 20:25:38,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:38,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:38,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:25:38,759 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:38,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1856500988, now seen corresponding path program 5 times [2025-04-13 20:25:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:38,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641544476] [2025-04-13 20:25:38,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:25:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:38,765 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:25:38,768 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:25:38,769 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:25:38,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:38,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641544476] [2025-04-13 20:25:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641544476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:25:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228486503] [2025-04-13 20:25:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:38,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:25:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:38,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:25:38,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:25:38,874 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:38,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 163 transitions, 1756 flow. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 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-04-13 20:25:38,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:38,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:38,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:42,300 INFO L116 PetriNetUnfolderBase]: 35658/47480 cut-off events. [2025-04-13 20:25:42,300 INFO L117 PetriNetUnfolderBase]: For 301807/301807 co-relation queries the response was YES. [2025-04-13 20:25:42,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205596 conditions, 47480 events. 35658/47480 cut-off events. For 301807/301807 co-relation queries the response was YES. Maximal size of possible extension queue 1368. Compared 257135 event pairs, 7873 based on Foata normal form. 4/40586 useless extension candidates. Maximal degree in co-relation 202164. Up to 25522 conditions per place. [2025-04-13 20:25:42,578 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 266 selfloop transitions, 118 changer transitions 6/390 dead transitions. [2025-04-13 20:25:42,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 390 transitions, 4243 flow [2025-04-13 20:25:42,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:25:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:25:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 241 transitions. [2025-04-13 20:25:42,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5617715617715617 [2025-04-13 20:25:42,579 INFO L175 Difference]: Start difference. First operand has 92 places, 163 transitions, 1756 flow. Second operand 11 states and 241 transitions. [2025-04-13 20:25:42,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 390 transitions, 4243 flow [2025-04-13 20:25:42,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 390 transitions, 4148 flow, removed 46 selfloop flow, removed 1 redundant places. [2025-04-13 20:25:42,980 INFO L231 Difference]: Finished difference. Result has 108 places, 248 transitions, 3218 flow [2025-04-13 20:25:42,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3218, PETRI_PLACES=108, PETRI_TRANSITIONS=248} [2025-04-13 20:25:42,981 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 69 predicate places. [2025-04-13 20:25:42,981 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 248 transitions, 3218 flow [2025-04-13 20:25:42,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 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-04-13 20:25:42,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:42,981 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:42,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:25:42,981 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:42,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1696195839, now seen corresponding path program 1 times [2025-04-13 20:25:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:42,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091260618] [2025-04-13 20:25:42,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:25:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:42,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:25:42,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:25:42,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:25:42,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:43,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:43,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091260618] [2025-04-13 20:25:43,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091260618] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:25:43,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675627630] [2025-04-13 20:25:43,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:25:43,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:25:43,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:25:43,032 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-04-13 20:25:43,033 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-04-13 20:25:43,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:25:43,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:25:43,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:25:43,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:43,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:25:43,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:25:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:43,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:25:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:43,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675627630] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:25:43,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:25:43,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 20:25:43,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369559520] [2025-04-13 20:25:43,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:25:43,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:25:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:43,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:25:43,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:25:43,229 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:43,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 248 transitions, 3218 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-04-13 20:25:43,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:43,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:43,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:48,234 INFO L116 PetriNetUnfolderBase]: 50023/65907 cut-off events. [2025-04-13 20:25:48,235 INFO L117 PetriNetUnfolderBase]: For 466317/466317 co-relation queries the response was YES. [2025-04-13 20:25:48,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291350 conditions, 65907 events. 50023/65907 cut-off events. For 466317/466317 co-relation queries the response was YES. Maximal size of possible extension queue 1840. Compared 366083 event pairs, 9293 based on Foata normal form. 0/56089 useless extension candidates. Maximal degree in co-relation 262721. Up to 28399 conditions per place. [2025-04-13 20:25:48,698 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 752 selfloop transitions, 18 changer transitions 0/770 dead transitions. [2025-04-13 20:25:48,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 770 transitions, 11404 flow [2025-04-13 20:25:48,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:25:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:25:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2025-04-13 20:25:48,699 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-13 20:25:48,699 INFO L175 Difference]: Start difference. First operand has 108 places, 248 transitions, 3218 flow. Second operand 8 states and 168 transitions. [2025-04-13 20:25:48,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 770 transitions, 11404 flow [2025-04-13 20:25:49,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 770 transitions, 11226 flow, removed 89 selfloop flow, removed 0 redundant places. [2025-04-13 20:25:49,683 INFO L231 Difference]: Finished difference. Result has 119 places, 266 transitions, 3276 flow [2025-04-13 20:25:49,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3160, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3276, PETRI_PLACES=119, PETRI_TRANSITIONS=266} [2025-04-13 20:25:49,683 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 80 predicate places. [2025-04-13 20:25:49,683 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 266 transitions, 3276 flow [2025-04-13 20:25:49,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-04-13 20:25:49,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:49,684 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:49,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:25:49,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:25:49,884 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:49,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1514730275, now seen corresponding path program 2 times [2025-04-13 20:25:49,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:49,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63860421] [2025-04-13 20:25:49,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:25:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:49,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:25:49,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 20:25:49,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:25:49,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:25:49,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:49,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63860421] [2025-04-13 20:25:49,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63860421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:49,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:49,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:25:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501102724] [2025-04-13 20:25:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:49,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:25:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:49,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:25:49,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:25:49,923 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:49,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 266 transitions, 3276 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-04-13 20:25:49,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:49,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:49,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:25:55,111 INFO L116 PetriNetUnfolderBase]: 49310/65025 cut-off events. [2025-04-13 20:25:55,112 INFO L117 PetriNetUnfolderBase]: For 474407/474407 co-relation queries the response was YES. [2025-04-13 20:25:55,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322463 conditions, 65025 events. 49310/65025 cut-off events. For 474407/474407 co-relation queries the response was YES. Maximal size of possible extension queue 1833. Compared 357026 event pairs, 15491 based on Foata normal form. 103/60520 useless extension candidates. Maximal degree in co-relation 290387. Up to 63229 conditions per place. [2025-04-13 20:25:55,745 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 283 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-04-13 20:25:55,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 288 transitions, 3983 flow [2025-04-13 20:25:55,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:25:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:25:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-04-13 20:25:55,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-04-13 20:25:55,746 INFO L175 Difference]: Start difference. First operand has 119 places, 266 transitions, 3276 flow. Second operand 3 states and 57 transitions. [2025-04-13 20:25:55,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 288 transitions, 3983 flow [2025-04-13 20:25:57,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 288 transitions, 3979 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-13 20:25:57,079 INFO L231 Difference]: Finished difference. Result has 122 places, 267 transitions, 3301 flow [2025-04-13 20:25:57,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3272, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3301, PETRI_PLACES=122, PETRI_TRANSITIONS=267} [2025-04-13 20:25:57,079 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 83 predicate places. [2025-04-13 20:25:57,079 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 267 transitions, 3301 flow [2025-04-13 20:25:57,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-04-13 20:25:57,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:25:57,080 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:25:57,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:25:57,080 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:25:57,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:25:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1218878749, now seen corresponding path program 3 times [2025-04-13 20:25:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:25:57,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874243156] [2025-04-13 20:25:57,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:25:57,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:25:57,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:25:57,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:25:57,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:25:57,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:25:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:25:57,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:25:57,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874243156] [2025-04-13 20:25:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874243156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:25:57,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:25:57,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:25:57,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437485033] [2025-04-13 20:25:57,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:25:57,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:25:57,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:25:57,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:25:57,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:25:57,124 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:25:57,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 267 transitions, 3301 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:25:57,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:25:57,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:25:57,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:26:04,444 INFO L116 PetriNetUnfolderBase]: 65690/86922 cut-off events. [2025-04-13 20:26:04,445 INFO L117 PetriNetUnfolderBase]: For 720251/720251 co-relation queries the response was YES. [2025-04-13 20:26:04,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449910 conditions, 86922 events. 65690/86922 cut-off events. For 720251/720251 co-relation queries the response was YES. Maximal size of possible extension queue 2429. Compared 504228 event pairs, 13872 based on Foata normal form. 2620/83944 useless extension candidates. Maximal degree in co-relation 403930. Up to 57604 conditions per place. [2025-04-13 20:26:05,236 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 618 selfloop transitions, 10 changer transitions 0/628 dead transitions. [2025-04-13 20:26:05,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 628 transitions, 9103 flow [2025-04-13 20:26:05,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:26:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:26:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-04-13 20:26:05,237 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5948717948717949 [2025-04-13 20:26:05,237 INFO L175 Difference]: Start difference. First operand has 122 places, 267 transitions, 3301 flow. Second operand 5 states and 116 transitions. [2025-04-13 20:26:05,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 628 transitions, 9103 flow [2025-04-13 20:26:07,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 628 transitions, 9090 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:26:07,866 INFO L231 Difference]: Finished difference. Result has 127 places, 271 transitions, 3396 flow [2025-04-13 20:26:07,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3296, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3396, PETRI_PLACES=127, PETRI_TRANSITIONS=271} [2025-04-13 20:26:07,867 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 88 predicate places. [2025-04-13 20:26:07,867 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 271 transitions, 3396 flow [2025-04-13 20:26:07,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:26:07,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:26:07,867 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:26:07,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:26:07,867 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:26:07,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:26:07,868 INFO L85 PathProgramCache]: Analyzing trace with hash 42657583, now seen corresponding path program 4 times [2025-04-13 20:26:07,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:26:07,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418283577] [2025-04-13 20:26:07,868 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:26:07,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:26:07,873 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:26:07,876 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 28 statements. [2025-04-13 20:26:07,876 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:26:07,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:26:07,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:26:07,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418283577] [2025-04-13 20:26:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418283577] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:26:07,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757920485] [2025-04-13 20:26:07,906 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:26:07,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:26:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:26:07,908 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-04-13 20:26:07,909 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-04-13 20:26:07,945 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:26:07,959 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 28 statements. [2025-04-13 20:26:07,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:26:07,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:07,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:26:07,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:26:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:26:07,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:26:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:26:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757920485] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:26:08,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:26:08,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-13 20:26:08,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733731236] [2025-04-13 20:26:08,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:26:08,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:26:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:26:08,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:26:08,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:26:08,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:26:08,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 271 transitions, 3396 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-04-13 20:26:08,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:26:08,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:26:08,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:26:17,940 INFO L116 PetriNetUnfolderBase]: 86324/113711 cut-off events. [2025-04-13 20:26:17,940 INFO L117 PetriNetUnfolderBase]: For 1178516/1178516 co-relation queries the response was YES. [2025-04-13 20:26:18,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627330 conditions, 113711 events. 86324/113711 cut-off events. For 1178516/1178516 co-relation queries the response was YES. Maximal size of possible extension queue 3083. Compared 671338 event pairs, 17361 based on Foata normal form. 2488/110173 useless extension candidates. Maximal degree in co-relation 573487. Up to 39664 conditions per place. [2025-04-13 20:26:19,120 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 805 selfloop transitions, 35 changer transitions 0/840 dead transitions. [2025-04-13 20:26:19,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 840 transitions, 12195 flow [2025-04-13 20:26:19,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:26:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:26:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2025-04-13 20:26:19,121 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5470085470085471 [2025-04-13 20:26:19,121 INFO L175 Difference]: Start difference. First operand has 127 places, 271 transitions, 3396 flow. Second operand 6 states and 128 transitions. [2025-04-13 20:26:19,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 840 transitions, 12195 flow [2025-04-13 20:26:23,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 840 transitions, 12179 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:26:23,340 INFO L231 Difference]: Finished difference. Result has 134 places, 299 transitions, 3896 flow [2025-04-13 20:26:23,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3386, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3896, PETRI_PLACES=134, PETRI_TRANSITIONS=299} [2025-04-13 20:26:23,341 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 95 predicate places. [2025-04-13 20:26:23,341 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 299 transitions, 3896 flow [2025-04-13 20:26:23,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-04-13 20:26:23,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:26:23,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:26:23,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:26:23,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 20:26:23,541 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:26:23,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:26:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 517973613, now seen corresponding path program 5 times [2025-04-13 20:26:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:26:23,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846873107] [2025-04-13 20:26:23,542 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:26:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:26:23,546 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:26:23,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:26:23,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:26:23,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:26:23,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:26:23,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846873107] [2025-04-13 20:26:23,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846873107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:26:23,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:26:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:26:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989637972] [2025-04-13 20:26:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:26:23,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:26:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:26:23,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:26:23,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:26:23,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:26:23,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 299 transitions, 3896 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:26:23,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:26:23,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:26:23,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:26:33,967 INFO L116 PetriNetUnfolderBase]: 86215/113664 cut-off events. [2025-04-13 20:26:33,967 INFO L117 PetriNetUnfolderBase]: For 1375568/1375568 co-relation queries the response was YES. [2025-04-13 20:26:34,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683649 conditions, 113664 events. 86215/113664 cut-off events. For 1375568/1375568 co-relation queries the response was YES. Maximal size of possible extension queue 2908. Compared 668087 event pairs, 22871 based on Foata normal form. 378/113174 useless extension candidates. Maximal degree in co-relation 626896. Up to 46269 conditions per place. [2025-04-13 20:26:35,211 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 627 selfloop transitions, 29 changer transitions 1/657 dead transitions. [2025-04-13 20:26:35,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 657 transitions, 9614 flow [2025-04-13 20:26:35,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:26:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:26:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-04-13 20:26:35,212 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-13 20:26:35,212 INFO L175 Difference]: Start difference. First operand has 134 places, 299 transitions, 3896 flow. Second operand 5 states and 104 transitions. [2025-04-13 20:26:35,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 657 transitions, 9614 flow [2025-04-13 20:26:40,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 657 transitions, 9606 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-13 20:26:40,735 INFO L231 Difference]: Finished difference. Result has 139 places, 301 transitions, 3968 flow [2025-04-13 20:26:40,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3968, PETRI_PLACES=139, PETRI_TRANSITIONS=301} [2025-04-13 20:26:40,736 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 100 predicate places. [2025-04-13 20:26:40,736 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 301 transitions, 3968 flow [2025-04-13 20:26:40,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:26:40,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:26:40,736 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:26:40,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:26:40,736 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:26:40,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:26:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1115064991, now seen corresponding path program 1 times [2025-04-13 20:26:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:26:40,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706400657] [2025-04-13 20:26:40,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:26:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:26:40,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:26:40,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:26:40,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:26:40,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:26:40,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:26:40,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706400657] [2025-04-13 20:26:40,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706400657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:26:40,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126944322] [2025-04-13 20:26:40,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:26:40,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:26:40,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:26:40,774 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-04-13 20:26:40,776 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-04-13 20:26:40,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:26:40,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:26:40,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:26:40,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:40,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:26:40,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:26:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:26:40,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:26:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:26:40,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126944322] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:26:40,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:26:40,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-13 20:26:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339047941] [2025-04-13 20:26:40,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:26:40,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:26:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:26:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:26:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:26:40,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:26:40,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 301 transitions, 3968 flow. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 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-04-13 20:26:40,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:26:40,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:26:40,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:26:51,656 INFO L116 PetriNetUnfolderBase]: 91039/120066 cut-off events. [2025-04-13 20:26:51,656 INFO L117 PetriNetUnfolderBase]: For 1516118/1516118 co-relation queries the response was YES. [2025-04-13 20:26:52,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733302 conditions, 120066 events. 91039/120066 cut-off events. For 1516118/1516118 co-relation queries the response was YES. Maximal size of possible extension queue 3078. Compared 711491 event pairs, 39442 based on Foata normal form. 1328/120526 useless extension candidates. Maximal degree in co-relation 673744. Up to 108002 conditions per place. [2025-04-13 20:26:52,849 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 550 selfloop transitions, 20 changer transitions 2/572 dead transitions. [2025-04-13 20:26:52,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 572 transitions, 8715 flow [2025-04-13 20:26:52,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:26:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:26:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-04-13 20:26:52,850 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5213675213675214 [2025-04-13 20:26:52,850 INFO L175 Difference]: Start difference. First operand has 139 places, 301 transitions, 3968 flow. Second operand 6 states and 122 transitions. [2025-04-13 20:26:52,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 572 transitions, 8715 flow [2025-04-13 20:26:57,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 572 transitions, 8668 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:26:57,933 INFO L231 Difference]: Finished difference. Result has 143 places, 306 transitions, 4027 flow [2025-04-13 20:26:57,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3931, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4027, PETRI_PLACES=143, PETRI_TRANSITIONS=306} [2025-04-13 20:26:57,934 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 104 predicate places. [2025-04-13 20:26:57,934 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 306 transitions, 4027 flow [2025-04-13 20:26:57,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 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-04-13 20:26:57,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:26:57,934 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:26:57,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:26:58,134 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:26:58,135 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:26:58,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:26:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1212943489, now seen corresponding path program 2 times [2025-04-13 20:26:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:26:58,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457908746] [2025-04-13 20:26:58,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:26:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:26:58,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:26:58,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:26:58,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:26:58,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:26:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:26:58,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:26:58,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457908746] [2025-04-13 20:26:58,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457908746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:26:58,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:26:58,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:26:58,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764732997] [2025-04-13 20:26:58,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:26:58,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:26:58,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:26:58,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:26:58,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:26:58,172 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:26:58,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 306 transitions, 4027 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:26:58,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:26:58,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:26:58,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:09,796 INFO L116 PetriNetUnfolderBase]: 91278/120432 cut-off events. [2025-04-13 20:27:09,796 INFO L117 PetriNetUnfolderBase]: For 1510175/1510175 co-relation queries the response was YES. [2025-04-13 20:27:10,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739448 conditions, 120432 events. 91278/120432 cut-off events. For 1510175/1510175 co-relation queries the response was YES. Maximal size of possible extension queue 3080. Compared 713376 event pairs, 39207 based on Foata normal form. 106/119824 useless extension candidates. Maximal degree in co-relation 679977. Up to 100230 conditions per place. [2025-04-13 20:27:11,068 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 473 selfloop transitions, 16 changer transitions 26/515 dead transitions. [2025-04-13 20:27:11,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 515 transitions, 7714 flow [2025-04-13 20:27:11,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:27:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:27:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-13 20:27:11,072 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2025-04-13 20:27:11,072 INFO L175 Difference]: Start difference. First operand has 143 places, 306 transitions, 4027 flow. Second operand 5 states and 110 transitions. [2025-04-13 20:27:11,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 515 transitions, 7714 flow [2025-04-13 20:27:16,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 515 transitions, 7682 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 20:27:16,472 INFO L231 Difference]: Finished difference. Result has 147 places, 306 transitions, 4039 flow [2025-04-13 20:27:16,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3995, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4039, PETRI_PLACES=147, PETRI_TRANSITIONS=306} [2025-04-13 20:27:16,473 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 108 predicate places. [2025-04-13 20:27:16,473 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 306 transitions, 4039 flow [2025-04-13 20:27:16,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:27:16,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:16,473 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:16,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:27:16,473 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:27:16,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:16,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2057368077, now seen corresponding path program 3 times [2025-04-13 20:27:16,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:16,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274776630] [2025-04-13 20:27:16,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:27:16,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:16,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:27:16,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:27:16,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:27:16,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:16,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:16,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274776630] [2025-04-13 20:27:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274776630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:16,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:16,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:27:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157803828] [2025-04-13 20:27:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:16,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:27:16,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:16,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:27:16,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:27:16,515 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:27:16,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 306 transitions, 4039 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:27:16,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:16,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:27:16,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:27,716 INFO L116 PetriNetUnfolderBase]: 91490/120764 cut-off events. [2025-04-13 20:27:27,716 INFO L117 PetriNetUnfolderBase]: For 1577594/1577594 co-relation queries the response was YES. [2025-04-13 20:27:28,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750280 conditions, 120764 events. 91490/120764 cut-off events. For 1577594/1577594 co-relation queries the response was YES. Maximal size of possible extension queue 3107. Compared 717452 event pairs, 39639 based on Foata normal form. 226/120276 useless extension candidates. Maximal degree in co-relation 690629. Up to 108047 conditions per place. [2025-04-13 20:27:29,054 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 479 selfloop transitions, 16 changer transitions 34/529 dead transitions. [2025-04-13 20:27:29,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 529 transitions, 8097 flow [2025-04-13 20:27:29,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:27:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:27:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-13 20:27:29,055 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5282051282051282 [2025-04-13 20:27:29,055 INFO L175 Difference]: Start difference. First operand has 147 places, 306 transitions, 4039 flow. Second operand 5 states and 103 transitions. [2025-04-13 20:27:29,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 529 transitions, 8097 flow [2025-04-13 20:27:40,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 529 transitions, 8063 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 20:27:40,160 INFO L231 Difference]: Finished difference. Result has 148 places, 303 transitions, 4012 flow [2025-04-13 20:27:40,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4009, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4012, PETRI_PLACES=148, PETRI_TRANSITIONS=303} [2025-04-13 20:27:40,160 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 109 predicate places. [2025-04-13 20:27:40,160 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 303 transitions, 4012 flow [2025-04-13 20:27:40,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:27:40,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:27:40,160 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:27:40,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:27:40,161 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:27:40,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:27:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1805182591, now seen corresponding path program 4 times [2025-04-13 20:27:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:27:40,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061852867] [2025-04-13 20:27:40,161 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:27:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:27:40,164 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:27:40,166 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 28 statements. [2025-04-13 20:27:40,166 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:27:40,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:27:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:27:40,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:27:40,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061852867] [2025-04-13 20:27:40,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061852867] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:27:40,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:27:40,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:27:40,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244550751] [2025-04-13 20:27:40,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:27:40,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:27:40,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:27:40,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:27:40,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:27:40,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:27:40,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 303 transitions, 4012 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:27:40,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:27:40,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:27:40,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:27:51,465 INFO L116 PetriNetUnfolderBase]: 90258/119285 cut-off events. [2025-04-13 20:27:51,465 INFO L117 PetriNetUnfolderBase]: For 1575103/1575103 co-relation queries the response was YES. [2025-04-13 20:27:52,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744487 conditions, 119285 events. 90258/119285 cut-off events. For 1575103/1575103 co-relation queries the response was YES. Maximal size of possible extension queue 3103. Compared 711855 event pairs, 22580 based on Foata normal form. 600/119171 useless extension candidates. Maximal degree in co-relation 682251. Up to 76001 conditions per place. [2025-04-13 20:27:52,715 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 653 selfloop transitions, 16 changer transitions 7/676 dead transitions. [2025-04-13 20:27:52,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 676 transitions, 10520 flow [2025-04-13 20:27:52,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:27:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:27:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-13 20:27:52,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2025-04-13 20:27:52,716 INFO L175 Difference]: Start difference. First operand has 148 places, 303 transitions, 4012 flow. Second operand 5 states and 100 transitions. [2025-04-13 20:27:52,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 676 transitions, 10520 flow [2025-04-13 20:28:01,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 676 transitions, 10468 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 20:28:01,694 INFO L231 Difference]: Finished difference. Result has 150 places, 311 transitions, 4136 flow [2025-04-13 20:28:01,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3976, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4136, PETRI_PLACES=150, PETRI_TRANSITIONS=311} [2025-04-13 20:28:01,694 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 111 predicate places. [2025-04-13 20:28:01,694 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 311 transitions, 4136 flow [2025-04-13 20:28:01,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-04-13 20:28:01,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:01,695 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:01,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:28:01,695 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:28:01,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash -551639031, now seen corresponding path program 5 times [2025-04-13 20:28:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:01,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404085975] [2025-04-13 20:28:01,695 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:28:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:01,698 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:28:01,701 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:28:01,701 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:01,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:01,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:01,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404085975] [2025-04-13 20:28:01,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404085975] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:01,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807647557] [2025-04-13 20:28:01,723 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:28:01,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:01,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:01,725 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-04-13 20:28:01,726 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-04-13 20:28:01,760 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:28:01,773 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:28:01,773 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:28:01,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:01,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:28:01,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:01,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:01,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807647557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:01,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:01,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-13 20:28:01,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173742260] [2025-04-13 20:28:01,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:01,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:28:01,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:01,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:28:01,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:28:01,805 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:28:01,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 311 transitions, 4136 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-13 20:28:01,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:01,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:28:01,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:28:19,545 INFO L116 PetriNetUnfolderBase]: 134131/177315 cut-off events. [2025-04-13 20:28:19,546 INFO L117 PetriNetUnfolderBase]: For 2485160/2485160 co-relation queries the response was YES. [2025-04-13 20:28:20,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139847 conditions, 177315 events. 134131/177315 cut-off events. For 2485160/2485160 co-relation queries the response was YES. Maximal size of possible extension queue 4560. Compared 1106539 event pairs, 17046 based on Foata normal form. 5166/182481 useless extension candidates. Maximal degree in co-relation 1043239. Up to 70945 conditions per place. [2025-04-13 20:28:21,459 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 1033 selfloop transitions, 36 changer transitions 14/1083 dead transitions. [2025-04-13 20:28:21,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 1083 transitions, 16876 flow [2025-04-13 20:28:21,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:28:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:28:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-04-13 20:28:21,460 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-13 20:28:21,460 INFO L175 Difference]: Start difference. First operand has 150 places, 311 transitions, 4136 flow. Second operand 7 states and 147 transitions. [2025-04-13 20:28:21,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 1083 transitions, 16876 flow [2025-04-13 20:28:44,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 1083 transitions, 16793 flow, removed 33 selfloop flow, removed 1 redundant places. [2025-04-13 20:28:44,547 INFO L231 Difference]: Finished difference. Result has 160 places, 333 transitions, 4515 flow [2025-04-13 20:28:44,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4104, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4515, PETRI_PLACES=160, PETRI_TRANSITIONS=333} [2025-04-13 20:28:44,547 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 121 predicate places. [2025-04-13 20:28:44,548 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 333 transitions, 4515 flow [2025-04-13 20:28:44,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-13 20:28:44,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:28:44,548 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:28:44,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:28:44,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 20:28:44,748 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:28:44,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:28:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1666185885, now seen corresponding path program 6 times [2025-04-13 20:28:44,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:28:44,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358614545] [2025-04-13 20:28:44,749 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:28:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:28:44,754 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:28:44,757 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:28:44,757 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:28:44,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:44,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:28:44,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358614545] [2025-04-13 20:28:44,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358614545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:28:44,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083744158] [2025-04-13 20:28:44,795 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:28:44,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:28:44,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:28:44,798 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-04-13 20:28:44,799 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-04-13 20:28:44,830 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:28:44,844 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:28:44,844 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:28:44,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:28:44,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:28:44,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:28:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:44,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:28:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:28:44,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083744158] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:28:44,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:28:44,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 20:28:44,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059976948] [2025-04-13 20:28:44,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:28:44,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:28:44,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:28:44,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:28:44,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:28:44,916 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:28:44,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 333 transitions, 4515 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-04-13 20:28:44,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:28:44,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:28:44,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:29:03,226 INFO L116 PetriNetUnfolderBase]: 135292/178876 cut-off events. [2025-04-13 20:29:03,226 INFO L117 PetriNetUnfolderBase]: For 2934416/2934416 co-relation queries the response was YES. [2025-04-13 20:29:04,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227283 conditions, 178876 events. 135292/178876 cut-off events. For 2934416/2934416 co-relation queries the response was YES. Maximal size of possible extension queue 4523. Compared 1112155 event pairs, 31820 based on Foata normal form. 1684/180560 useless extension candidates. Maximal degree in co-relation 1152729. Up to 112247 conditions per place. [2025-04-13 20:29:05,410 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 715 selfloop transitions, 30 changer transitions 6/751 dead transitions. [2025-04-13 20:29:05,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 751 transitions, 11961 flow [2025-04-13 20:29:05,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:29:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:29:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-04-13 20:29:05,411 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5085470085470085 [2025-04-13 20:29:05,411 INFO L175 Difference]: Start difference. First operand has 160 places, 333 transitions, 4515 flow. Second operand 6 states and 119 transitions. [2025-04-13 20:29:05,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 751 transitions, 11961 flow [2025-04-13 20:29:35,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 751 transitions, 11923 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-13 20:29:35,585 INFO L231 Difference]: Finished difference. Result has 166 places, 340 transitions, 4648 flow [2025-04-13 20:29:35,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4483, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4648, PETRI_PLACES=166, PETRI_TRANSITIONS=340} [2025-04-13 20:29:35,585 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 127 predicate places. [2025-04-13 20:29:35,585 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 340 transitions, 4648 flow [2025-04-13 20:29:35,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-04-13 20:29:35,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:29:35,586 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:29:35,591 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-04-13 20:29:35,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:35,786 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 20:29:35,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:29:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash -147409685, now seen corresponding path program 7 times [2025-04-13 20:29:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:29:35,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25325718] [2025-04-13 20:29:35,787 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:29:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:29:35,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:29:35,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:29:35,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:29:35,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:35,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:29:35,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25325718] [2025-04-13 20:29:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25325718] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:29:35,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820150880] [2025-04-13 20:29:35,830 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:29:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:29:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:29:35,832 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-04-13 20:29:35,834 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-04-13 20:29:35,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:29:35,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:29:35,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:29:35,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:29:35,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:29:35,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:29:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:35,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:29:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:29:35,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820150880] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:29:35,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:29:35,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-13 20:29:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19725722] [2025-04-13 20:29:35,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:29:35,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:29:35,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:29:35,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:29:35,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:29:35,924 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-13 20:29:35,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 340 transitions, 4648 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-04-13 20:29:35,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:29:35,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-13 20:29:35,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand