/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:55:09,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:55:09,403 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-14 00:55:09,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:55:09,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:55:09,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:55:09,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:55:09,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:55:09,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:55:09,428 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:55:09,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:55:09,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:55:09,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:55:09,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:55:09,429 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:55:09,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:55:09,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:55:09,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:55:09,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:55:09,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:55:09,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:55:09,432 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:55:09,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:55:09,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:55:09,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:55:09,653 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:55:09,654 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:55:09,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-04-14 00:55:10,900 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bffb141/488b8ebaa445437fb56660ea48da6958/FLAG4a20b75a9 [2025-04-14 00:55:11,086 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:55:11,086 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-04-14 00:55:11,091 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bffb141/488b8ebaa445437fb56660ea48da6958/FLAG4a20b75a9 [2025-04-14 00:55:12,102 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bffb141/488b8ebaa445437fb56660ea48da6958 [2025-04-14 00:55:12,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:55:12,105 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:55:12,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:55:12,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:55:12,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:55:12,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb1e70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12, skipping insertion in model container [2025-04-14 00:55:12,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:55:12,296 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/parallel-parallel-sum-1.wvr.c[3694,3707] [2025-04-14 00:55:12,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:55:12,309 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:55:12,339 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/parallel-parallel-sum-1.wvr.c[3694,3707] [2025-04-14 00:55:12,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:55:12,352 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:55:12,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12 WrapperNode [2025-04-14 00:55:12,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:55:12,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:55:12,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:55:12,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:55:12,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,393 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 288 [2025-04-14 00:55:12,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:55:12,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:55:12,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:55:12,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:55:12,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,414 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-14 00:55:12,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:55:12,431 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:55:12,431 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:55:12,431 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:55:12,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (1/1) ... [2025-04-14 00:55:12,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:55:12,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:12,457 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-14 00:55:12,459 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-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:55:12,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:55:12,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:55:12,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 00:55:12,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:55:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:55:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:55:12,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:55:12,476 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:55:12,560 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:55:12,561 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:55:12,850 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:55:12,852 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:55:12,852 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:55:13,171 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:55:13,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:55:13 BoogieIcfgContainer [2025-04-14 00:55:13,171 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:55:13,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:55:13,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:55:13,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:55:13,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:55:12" (1/3) ... [2025-04-14 00:55:13,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260bd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:55:13, skipping insertion in model container [2025-04-14 00:55:13,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:12" (2/3) ... [2025-04-14 00:55:13,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260bd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:55:13, skipping insertion in model container [2025-04-14 00:55:13,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:55:13" (3/3) ... [2025-04-14 00:55:13,177 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-04-14 00:55:13,187 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:55:13,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 37 locations, 37 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-14 00:55:13,188 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:55:13,234 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 00:55:13,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 110 flow [2025-04-14 00:55:13,276 INFO L116 PetriNetUnfolderBase]: 5/37 cut-off events. [2025-04-14 00:55:13,277 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:55:13,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 37 events. 5/37 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-14 00:55:13,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 41 transitions, 110 flow [2025-04-14 00:55:13,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 36 transitions, 96 flow [2025-04-14 00:55:13,291 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:55:13,299 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;@2b5bfb81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:55:13,299 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:55:13,335 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:55:13,335 INFO L116 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-04-14 00:55:13,335 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:55:13,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:13,336 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] [2025-04-14 00:55:13,336 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-14 00:55:13,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1282485827, now seen corresponding path program 1 times [2025-04-14 00:55:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:13,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611390562] [2025-04-14 00:55:13,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:13,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:55:13,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:55:13,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:13,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:13,625 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-14 00:55:13,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:13,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611390562] [2025-04-14 00:55:13,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611390562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:13,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:13,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:55:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110975978] [2025-04-14 00:55:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:13,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:55:13,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:13,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:55:13,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:55:13,652 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:13,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-14 00:55:13,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:13,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:13,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:14,565 INFO L116 PetriNetUnfolderBase]: 9362/11902 cut-off events. [2025-04-14 00:55:14,566 INFO L117 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2025-04-14 00:55:14,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24461 conditions, 11902 events. 9362/11902 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 56371 event pairs, 1833 based on Foata normal form. 1/8651 useless extension candidates. Maximal degree in co-relation 22232. Up to 9279 conditions per place. [2025-04-14 00:55:14,629 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 53 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2025-04-14 00:55:14,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 289 flow [2025-04-14 00:55:14,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:55:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:55:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-04-14 00:55:14,638 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2025-04-14 00:55:14,641 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 96 flow. Second operand 3 states and 84 transitions. [2025-04-14 00:55:14,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 289 flow [2025-04-14 00:55:14,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 63 transitions, 259 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 00:55:14,664 INFO L231 Difference]: Finished difference. Result has 39 places, 40 transitions, 113 flow [2025-04-14 00:55:14,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=39, PETRI_TRANSITIONS=40} [2025-04-14 00:55:14,669 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2025-04-14 00:55:14,669 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 40 transitions, 113 flow [2025-04-14 00:55:14,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-14 00:55:14,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:14,669 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-14 00:55:14,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:55:14,670 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-14 00:55:14,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1624436884, now seen corresponding path program 1 times [2025-04-14 00:55:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:14,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206942077] [2025-04-14 00:55:14,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:14,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:55:14,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:55:14,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:14,872 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-14 00:55:14,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:14,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206942077] [2025-04-14 00:55:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206942077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:14,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:14,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:55:14,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813173920] [2025-04-14 00:55:14,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:14,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:55:14,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:14,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:55:14,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:55:14,874 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:14,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 40 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-14 00:55:14,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:14,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:14,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:15,707 INFO L116 PetriNetUnfolderBase]: 11942/15583 cut-off events. [2025-04-14 00:55:15,708 INFO L117 PetriNetUnfolderBase]: For 1349/1349 co-relation queries the response was YES. [2025-04-14 00:55:15,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34530 conditions, 15583 events. 11942/15583 cut-off events. For 1349/1349 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 80954 event pairs, 8090 based on Foata normal form. 631/11917 useless extension candidates. Maximal degree in co-relation 5267. Up to 11347 conditions per place. [2025-04-14 00:55:15,769 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 35 selfloop transitions, 2 changer transitions 27/68 dead transitions. [2025-04-14 00:55:15,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 318 flow [2025-04-14 00:55:15,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:55:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:55:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-14 00:55:15,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5670731707317073 [2025-04-14 00:55:15,770 INFO L175 Difference]: Start difference. First operand has 39 places, 40 transitions, 113 flow. Second operand 4 states and 93 transitions. [2025-04-14 00:55:15,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 318 flow [2025-04-14 00:55:15,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 68 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:15,774 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 126 flow [2025-04-14 00:55:15,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-04-14 00:55:15,774 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-04-14 00:55:15,774 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 126 flow [2025-04-14 00:55:15,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-14 00:55:15,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:15,775 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, 1] [2025-04-14 00:55:15,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:55:15,775 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-14 00:55:15,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:15,775 INFO L85 PathProgramCache]: Analyzing trace with hash 239068070, now seen corresponding path program 1 times [2025-04-14 00:55:15,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:15,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721521106] [2025-04-14 00:55:15,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:15,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:15,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:55:15,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:55:15,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:15,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:15,963 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-14 00:55:15,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:15,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721521106] [2025-04-14 00:55:15,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721521106] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:15,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775418191] [2025-04-14 00:55:15,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:15,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:15,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:15,966 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-14 00:55:15,967 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-14 00:55:16,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:55:16,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:55:16,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:16,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:16,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:55:16,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:16,145 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-14 00:55:16,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:55:16,200 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-14 00:55:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775418191] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:55:16,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:55:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-14 00:55:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235972232] [2025-04-14 00:55:16,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:55:16,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:55:16,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:16,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:55:16,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:55:16,202 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:16,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 126 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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-14 00:55:16,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:16,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:16,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:16,996 INFO L116 PetriNetUnfolderBase]: 11942/15585 cut-off events. [2025-04-14 00:55:16,996 INFO L117 PetriNetUnfolderBase]: For 2906/2906 co-relation queries the response was YES. [2025-04-14 00:55:17,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34632 conditions, 15585 events. 11942/15585 cut-off events. For 2906/2906 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 81321 event pairs, 8090 based on Foata normal form. 630/11918 useless extension candidates. Maximal degree in co-relation 34619. Up to 11346 conditions per place. [2025-04-14 00:55:17,055 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 59 selfloop transitions, 5 changer transitions 2/70 dead transitions. [2025-04-14 00:55:17,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 342 flow [2025-04-14 00:55:17,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:55:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:55:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-04-14 00:55:17,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2025-04-14 00:55:17,056 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 126 flow. Second operand 6 states and 110 transitions. [2025-04-14 00:55:17,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 342 flow [2025-04-14 00:55:17,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 334 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:17,060 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 161 flow [2025-04-14 00:55:17,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2025-04-14 00:55:17,060 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-04-14 00:55:17,060 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 161 flow [2025-04-14 00:55:17,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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-14 00:55:17,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:17,061 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, 1] [2025-04-14 00:55:17,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:55:17,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:17,265 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-14 00:55:17,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:17,266 INFO L85 PathProgramCache]: Analyzing trace with hash 893712434, now seen corresponding path program 1 times [2025-04-14 00:55:17,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:17,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093453439] [2025-04-14 00:55:17,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:17,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:17,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:55:17,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:55:17,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:17,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:17,468 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-14 00:55:17,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:17,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093453439] [2025-04-14 00:55:17,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093453439] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:17,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781096417] [2025-04-14 00:55:17,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:17,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:17,471 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-14 00:55:17,472 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-14 00:55:17,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:55:17,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:55:17,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:17,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:17,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 00:55:17,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:17,689 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-14 00:55:17,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:55:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781096417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:55:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-04-14 00:55:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695292805] [2025-04-14 00:55:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:17,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:55:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:17,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:55:17,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:55:17,690 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:17,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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-14 00:55:17,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:17,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:17,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:18,364 INFO L116 PetriNetUnfolderBase]: 14207/18375 cut-off events. [2025-04-14 00:55:18,364 INFO L117 PetriNetUnfolderBase]: For 4523/4523 co-relation queries the response was YES. [2025-04-14 00:55:18,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42365 conditions, 18375 events. 14207/18375 cut-off events. For 4523/4523 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 95881 event pairs, 2390 based on Foata normal form. 2/13274 useless extension candidates. Maximal degree in co-relation 33674. Up to 10194 conditions per place. [2025-04-14 00:55:18,499 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 71 selfloop transitions, 7 changer transitions 7/89 dead transitions. [2025-04-14 00:55:18,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 453 flow [2025-04-14 00:55:18,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:55:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:55:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-14 00:55:18,500 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2025-04-14 00:55:18,500 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 161 flow. Second operand 4 states and 109 transitions. [2025-04-14 00:55:18,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 453 flow [2025-04-14 00:55:18,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 430 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-14 00:55:18,504 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 185 flow [2025-04-14 00:55:18,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-04-14 00:55:18,504 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2025-04-14 00:55:18,504 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 185 flow [2025-04-14 00:55:18,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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-14 00:55:18,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:18,505 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-14 00:55:18,515 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-14 00:55:18,705 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,SelfDestructingSolverStorable3 [2025-04-14 00:55:18,705 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-14 00:55:18,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash 227181836, now seen corresponding path program 2 times [2025-04-14 00:55:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:18,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303930212] [2025-04-14 00:55:18,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:18,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:55:18,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 28 statements. [2025-04-14 00:55:18,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:55:18,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:18,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303930212] [2025-04-14 00:55:18,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303930212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:18,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:18,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:55:18,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774340549] [2025-04-14 00:55:18,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:18,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:55:18,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:18,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:55:18,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:55:18,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:18,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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-14 00:55:18,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:18,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:18,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:20,306 INFO L116 PetriNetUnfolderBase]: 23350/29533 cut-off events. [2025-04-14 00:55:20,306 INFO L117 PetriNetUnfolderBase]: For 10213/10213 co-relation queries the response was YES. [2025-04-14 00:55:20,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72475 conditions, 29533 events. 23350/29533 cut-off events. For 10213/10213 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 151493 event pairs, 4388 based on Foata normal form. 1/21491 useless extension candidates. Maximal degree in co-relation 72446. Up to 12246 conditions per place. [2025-04-14 00:55:20,455 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 90 selfloop transitions, 12 changer transitions 1/107 dead transitions. [2025-04-14 00:55:20,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 107 transitions, 583 flow [2025-04-14 00:55:20,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:55:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:55:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-04-14 00:55:20,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2025-04-14 00:55:20,457 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 185 flow. Second operand 4 states and 116 transitions. [2025-04-14 00:55:20,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 107 transitions, 583 flow [2025-04-14 00:55:20,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 107 transitions, 559 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-14 00:55:20,477 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 261 flow [2025-04-14 00:55:20,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2025-04-14 00:55:20,480 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2025-04-14 00:55:20,480 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 261 flow [2025-04-14 00:55:20,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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-14 00:55:20,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:20,480 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, 1, 1, 1] [2025-04-14 00:55:20,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:55:20,480 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-14 00:55:20,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:20,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1229919931, now seen corresponding path program 1 times [2025-04-14 00:55:20,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:20,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507883921] [2025-04-14 00:55:20,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:20,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:20,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 00:55:20,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:55:20,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:20,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:21,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507883921] [2025-04-14 00:55:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507883921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:21,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074394646] [2025-04-14 00:55:21,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:21,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:21,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:21,160 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-14 00:55:21,161 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-14 00:55:21,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 00:55:21,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:55:21,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:21,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:21,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 00:55:21,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:21,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:55:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:55:21,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:55:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:21,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074394646] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:21,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:55:21,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 17 [2025-04-14 00:55:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001464041] [2025-04-14 00:55:21,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:21,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:55:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:21,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:55:21,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:55:21,601 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:21,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:55:21,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:21,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:21,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:23,419 INFO L116 PetriNetUnfolderBase]: 29075/36951 cut-off events. [2025-04-14 00:55:23,419 INFO L117 PetriNetUnfolderBase]: For 23624/23624 co-relation queries the response was YES. [2025-04-14 00:55:23,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96430 conditions, 36951 events. 29075/36951 cut-off events. For 23624/23624 co-relation queries the response was YES. Maximal size of possible extension queue 1880. Compared 197173 event pairs, 2199 based on Foata normal form. 1/26933 useless extension candidates. Maximal degree in co-relation 96399. Up to 29557 conditions per place. [2025-04-14 00:55:23,614 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 117 selfloop transitions, 42 changer transitions 4/167 dead transitions. [2025-04-14 00:55:23,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 167 transitions, 996 flow [2025-04-14 00:55:23,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:55:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:55:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2025-04-14 00:55:23,616 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5945121951219512 [2025-04-14 00:55:23,616 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 261 flow. Second operand 8 states and 195 transitions. [2025-04-14 00:55:23,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 167 transitions, 996 flow [2025-04-14 00:55:23,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 167 transitions, 962 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-04-14 00:55:23,702 INFO L231 Difference]: Finished difference. Result has 64 places, 90 transitions, 611 flow [2025-04-14 00:55:23,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=64, PETRI_TRANSITIONS=90} [2025-04-14 00:55:23,702 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2025-04-14 00:55:23,702 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 90 transitions, 611 flow [2025-04-14 00:55:23,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:55:23,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:23,703 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, 1, 1, 1] [2025-04-14 00:55:23,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 00:55:23,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:23,907 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-14 00:55:23,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash -608736496, now seen corresponding path program 1 times [2025-04-14 00:55:23,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:23,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318154128] [2025-04-14 00:55:23,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:23,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:23,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 00:55:23,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:55:23,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:23,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:24,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:24,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318154128] [2025-04-14 00:55:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318154128] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:24,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791300064] [2025-04-14 00:55:24,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:24,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:24,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:24,419 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-14 00:55:24,420 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-14 00:55:24,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 00:55:24,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:55:24,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:24,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:24,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 00:55:24,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:24,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:55:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:55:24,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:55:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:24,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791300064] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:24,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:55:24,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-14 00:55:24,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225841402] [2025-04-14 00:55:24,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:24,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:55:24,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:24,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:55:24,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:55:24,918 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:24,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 90 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:55:24,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:24,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:24,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:27,397 INFO L116 PetriNetUnfolderBase]: 33716/43016 cut-off events. [2025-04-14 00:55:27,397 INFO L117 PetriNetUnfolderBase]: For 47615/47615 co-relation queries the response was YES. [2025-04-14 00:55:27,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122974 conditions, 43016 events. 33716/43016 cut-off events. For 47615/47615 co-relation queries the response was YES. Maximal size of possible extension queue 2190. Compared 237197 event pairs, 3035 based on Foata normal form. 2/31369 useless extension candidates. Maximal degree in co-relation 122938. Up to 36351 conditions per place. [2025-04-14 00:55:27,659 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 146 selfloop transitions, 50 changer transitions 4/204 dead transitions. [2025-04-14 00:55:27,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 204 transitions, 1498 flow [2025-04-14 00:55:27,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:55:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:55:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2025-04-14 00:55:27,661 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-04-14 00:55:27,661 INFO L175 Difference]: Start difference. First operand has 64 places, 90 transitions, 611 flow. Second operand 8 states and 192 transitions. [2025-04-14 00:55:27,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 204 transitions, 1498 flow [2025-04-14 00:55:27,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 204 transitions, 1457 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:27,787 INFO L231 Difference]: Finished difference. Result has 74 places, 130 transitions, 1082 flow [2025-04-14 00:55:27,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1082, PETRI_PLACES=74, PETRI_TRANSITIONS=130} [2025-04-14 00:55:27,788 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2025-04-14 00:55:27,788 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 130 transitions, 1082 flow [2025-04-14 00:55:27,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:55:27,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:27,788 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, 1, 1, 1] [2025-04-14 00:55:27,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 00:55:27,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:27,992 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-14 00:55:27,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash 690390833, now seen corresponding path program 2 times [2025-04-14 00:55:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:27,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733963266] [2025-04-14 00:55:27,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:28,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:55:28,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:55:28,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:55:28,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:28,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733963266] [2025-04-14 00:55:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733963266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:28,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:28,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:55:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679462704] [2025-04-14 00:55:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:28,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:55:28,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:28,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:55:28,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:55:28,128 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:28,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 130 transitions, 1082 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:28,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:28,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:28,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:31,054 INFO L116 PetriNetUnfolderBase]: 35891/45859 cut-off events. [2025-04-14 00:55:31,054 INFO L117 PetriNetUnfolderBase]: For 81211/81211 co-relation queries the response was YES. [2025-04-14 00:55:31,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143253 conditions, 45859 events. 35891/45859 cut-off events. For 81211/81211 co-relation queries the response was YES. Maximal size of possible extension queue 2367. Compared 255282 event pairs, 5166 based on Foata normal form. 1/33602 useless extension candidates. Maximal degree in co-relation 143212. Up to 41203 conditions per place. [2025-04-14 00:55:31,399 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 183 selfloop transitions, 49 changer transitions 4/240 dead transitions. [2025-04-14 00:55:31,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 240 transitions, 2119 flow [2025-04-14 00:55:31,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:55:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:55:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-04-14 00:55:31,401 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6445993031358885 [2025-04-14 00:55:31,401 INFO L175 Difference]: Start difference. First operand has 74 places, 130 transitions, 1082 flow. Second operand 7 states and 185 transitions. [2025-04-14 00:55:31,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 240 transitions, 2119 flow [2025-04-14 00:55:31,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 240 transitions, 2054 flow, removed 30 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:31,873 INFO L231 Difference]: Finished difference. Result has 83 places, 169 transitions, 1556 flow [2025-04-14 00:55:31,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1556, PETRI_PLACES=83, PETRI_TRANSITIONS=169} [2025-04-14 00:55:31,873 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2025-04-14 00:55:31,873 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 169 transitions, 1556 flow [2025-04-14 00:55:31,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:31,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:31,873 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, 1, 1, 1] [2025-04-14 00:55:31,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:55:31,874 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-14 00:55:31,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:31,874 INFO L85 PathProgramCache]: Analyzing trace with hash 159555189, now seen corresponding path program 3 times [2025-04-14 00:55:31,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:31,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849508823] [2025-04-14 00:55:31,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:55:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:31,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:55:31,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:55:31,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:55:31,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:31,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849508823] [2025-04-14 00:55:31,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849508823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:31,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:31,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:55:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993887363] [2025-04-14 00:55:31,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:31,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:55:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:31,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:55:31,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:55:31,988 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:31,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 169 transitions, 1556 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:31,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:31,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:31,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:35,117 INFO L116 PetriNetUnfolderBase]: 37847/48408 cut-off events. [2025-04-14 00:55:35,118 INFO L117 PetriNetUnfolderBase]: For 111773/111773 co-relation queries the response was YES. [2025-04-14 00:55:35,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162069 conditions, 48408 events. 37847/48408 cut-off events. For 111773/111773 co-relation queries the response was YES. Maximal size of possible extension queue 2506. Compared 272343 event pairs, 5707 based on Foata normal form. 1/35583 useless extension candidates. Maximal degree in co-relation 162023. Up to 43692 conditions per place. [2025-04-14 00:55:35,539 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 202 selfloop transitions, 49 changer transitions 4/259 dead transitions. [2025-04-14 00:55:35,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 259 transitions, 2476 flow [2025-04-14 00:55:35,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:55:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:55:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2025-04-14 00:55:35,540 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6515679442508711 [2025-04-14 00:55:35,540 INFO L175 Difference]: Start difference. First operand has 83 places, 169 transitions, 1556 flow. Second operand 7 states and 187 transitions. [2025-04-14 00:55:35,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 259 transitions, 2476 flow [2025-04-14 00:55:36,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 259 transitions, 2322 flow, removed 69 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:36,013 INFO L231 Difference]: Finished difference. Result has 90 places, 186 transitions, 1731 flow [2025-04-14 00:55:36,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1731, PETRI_PLACES=90, PETRI_TRANSITIONS=186} [2025-04-14 00:55:36,015 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places. [2025-04-14 00:55:36,015 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 186 transitions, 1731 flow [2025-04-14 00:55:36,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:36,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:36,015 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, 1, 1, 1] [2025-04-14 00:55:36,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:55:36,015 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-14 00:55:36,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1050344044, now seen corresponding path program 2 times [2025-04-14 00:55:36,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:36,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102904817] [2025-04-14 00:55:36,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:36,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:36,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:55:36,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:55:36,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:55:36,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:36,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:36,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102904817] [2025-04-14 00:55:36,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102904817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:36,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:36,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:55:36,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263795785] [2025-04-14 00:55:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:36,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:55:36,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:36,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:55:36,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:55:36,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:36,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 186 transitions, 1731 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:36,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:36,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:36,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:39,478 INFO L116 PetriNetUnfolderBase]: 39483/50527 cut-off events. [2025-04-14 00:55:39,479 INFO L117 PetriNetUnfolderBase]: For 133580/133580 co-relation queries the response was YES. [2025-04-14 00:55:39,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176245 conditions, 50527 events. 39483/50527 cut-off events. For 133580/133580 co-relation queries the response was YES. Maximal size of possible extension queue 2639. Compared 286115 event pairs, 5880 based on Foata normal form. 1/37221 useless extension candidates. Maximal degree in co-relation 176196. Up to 46150 conditions per place. [2025-04-14 00:55:39,814 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 211 selfloop transitions, 54 changer transitions 4/273 dead transitions. [2025-04-14 00:55:39,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 273 transitions, 2720 flow [2025-04-14 00:55:39,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:55:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:55:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2025-04-14 00:55:39,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6236933797909407 [2025-04-14 00:55:39,815 INFO L175 Difference]: Start difference. First operand has 90 places, 186 transitions, 1731 flow. Second operand 7 states and 179 transitions. [2025-04-14 00:55:39,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 273 transitions, 2720 flow [2025-04-14 00:55:40,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 273 transitions, 2554 flow, removed 56 selfloop flow, removed 3 redundant places. [2025-04-14 00:55:40,221 INFO L231 Difference]: Finished difference. Result has 96 places, 211 transitions, 2020 flow [2025-04-14 00:55:40,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2020, PETRI_PLACES=96, PETRI_TRANSITIONS=211} [2025-04-14 00:55:40,222 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2025-04-14 00:55:40,222 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 211 transitions, 2020 flow [2025-04-14 00:55:40,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:40,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:40,222 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, 1, 1, 1] [2025-04-14 00:55:40,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:55:40,222 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-14 00:55:40,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:40,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1081131476, now seen corresponding path program 3 times [2025-04-14 00:55:40,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:40,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080260049] [2025-04-14 00:55:40,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:55:40,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:40,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:55:40,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:55:40,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:55:40,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:40,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080260049] [2025-04-14 00:55:40,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080260049] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:40,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:40,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:55:40,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199872816] [2025-04-14 00:55:40,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:40,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:55:40,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:40,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:55:40,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:55:40,451 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:40,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 211 transitions, 2020 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:40,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:40,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:40,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:44,075 INFO L116 PetriNetUnfolderBase]: 41151/52692 cut-off events. [2025-04-14 00:55:44,075 INFO L117 PetriNetUnfolderBase]: For 167697/167697 co-relation queries the response was YES. [2025-04-14 00:55:44,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192091 conditions, 52692 events. 41151/52692 cut-off events. For 167697/167697 co-relation queries the response was YES. Maximal size of possible extension queue 2794. Compared 300763 event pairs, 6343 based on Foata normal form. 1/38898 useless extension candidates. Maximal degree in co-relation 192038. Up to 48253 conditions per place. [2025-04-14 00:55:44,564 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 231 selfloop transitions, 54 changer transitions 4/293 dead transitions. [2025-04-14 00:55:44,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 293 transitions, 3026 flow [2025-04-14 00:55:44,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:55:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:55:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2025-04-14 00:55:44,566 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-04-14 00:55:44,566 INFO L175 Difference]: Start difference. First operand has 96 places, 211 transitions, 2020 flow. Second operand 7 states and 182 transitions. [2025-04-14 00:55:44,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 293 transitions, 3026 flow [2025-04-14 00:55:45,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 293 transitions, 2882 flow, removed 72 selfloop flow, removed 0 redundant places. [2025-04-14 00:55:45,682 INFO L231 Difference]: Finished difference. Result has 104 places, 228 transitions, 2269 flow [2025-04-14 00:55:45,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1876, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2269, PETRI_PLACES=104, PETRI_TRANSITIONS=228} [2025-04-14 00:55:45,683 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2025-04-14 00:55:45,683 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 228 transitions, 2269 flow [2025-04-14 00:55:45,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:45,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:45,683 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, 1, 1, 1] [2025-04-14 00:55:45,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:55:45,683 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-14 00:55:45,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1213999089, now seen corresponding path program 4 times [2025-04-14 00:55:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:45,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646193106] [2025-04-14 00:55:45,684 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:55:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:45,691 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:55:45,699 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:55:45,699 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:55:45,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:45,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:45,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646193106] [2025-04-14 00:55:45,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646193106] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:45,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:45,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:55:45,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829513416] [2025-04-14 00:55:45,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:45,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:55:45,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:45,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:55:45,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:55:45,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:45,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 228 transitions, 2269 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:45,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:45,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:45,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:49,718 INFO L116 PetriNetUnfolderBase]: 43446/55685 cut-off events. [2025-04-14 00:55:49,719 INFO L117 PetriNetUnfolderBase]: For 208352/208352 co-relation queries the response was YES. [2025-04-14 00:55:50,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211121 conditions, 55685 events. 43446/55685 cut-off events. For 208352/208352 co-relation queries the response was YES. Maximal size of possible extension queue 2946. Compared 320543 event pairs, 6645 based on Foata normal form. 1/41247 useless extension candidates. Maximal degree in co-relation 211064. Up to 50718 conditions per place. [2025-04-14 00:55:50,221 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 251 selfloop transitions, 65 changer transitions 5/325 dead transitions. [2025-04-14 00:55:50,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 325 transitions, 3516 flow [2025-04-14 00:55:50,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:55:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:55:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2025-04-14 00:55:50,222 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6376306620209059 [2025-04-14 00:55:50,222 INFO L175 Difference]: Start difference. First operand has 104 places, 228 transitions, 2269 flow. Second operand 7 states and 183 transitions. [2025-04-14 00:55:50,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 325 transitions, 3516 flow [2025-04-14 00:55:51,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 325 transitions, 3272 flow, removed 86 selfloop flow, removed 3 redundant places. [2025-04-14 00:55:51,316 INFO L231 Difference]: Finished difference. Result has 112 places, 262 transitions, 2727 flow [2025-04-14 00:55:51,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2727, PETRI_PLACES=112, PETRI_TRANSITIONS=262} [2025-04-14 00:55:51,317 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 68 predicate places. [2025-04-14 00:55:51,317 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 262 transitions, 2727 flow [2025-04-14 00:55:51,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:51,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:51,317 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, 1, 1, 1] [2025-04-14 00:55:51,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:55:51,317 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-14 00:55:51,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1335045833, now seen corresponding path program 5 times [2025-04-14 00:55:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:51,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158097702] [2025-04-14 00:55:51,318 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:55:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:51,324 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:55:51,330 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:55:51,330 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:55:51,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:51,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158097702] [2025-04-14 00:55:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158097702] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:51,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264084239] [2025-04-14 00:55:51,669 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:55:51,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:51,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:51,671 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-14 00:55:51,673 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-14 00:55:51,724 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:55:51,744 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:55:51,745 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:55:51,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:51,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-14 00:55:51,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:51,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 00:55:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:55:51,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:55:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264084239] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:55:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 20 [2025-04-14 00:55:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096518960] [2025-04-14 00:55:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:52,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:55:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:52,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:55:52,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:55:52,096 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:52,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 262 transitions, 2727 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:55:52,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:52,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:52,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:56,273 INFO L116 PetriNetUnfolderBase]: 44910/57576 cut-off events. [2025-04-14 00:55:56,274 INFO L117 PetriNetUnfolderBase]: For 231926/231926 co-relation queries the response was YES. [2025-04-14 00:55:56,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226144 conditions, 57576 events. 44910/57576 cut-off events. For 231926/231926 co-relation queries the response was YES. Maximal size of possible extension queue 3126. Compared 334450 event pairs, 5259 based on Foata normal form. 1/42696 useless extension candidates. Maximal degree in co-relation 226081. Up to 53685 conditions per place. [2025-04-14 00:55:56,885 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 308 selfloop transitions, 42 changer transitions 5/359 dead transitions. [2025-04-14 00:55:56,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 359 transitions, 3941 flow [2025-04-14 00:55:56,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:55:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:55:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2025-04-14 00:55:56,887 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6550522648083623 [2025-04-14 00:55:56,887 INFO L175 Difference]: Start difference. First operand has 112 places, 262 transitions, 2727 flow. Second operand 7 states and 188 transitions. [2025-04-14 00:55:56,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 359 transitions, 3941 flow [2025-04-14 00:55:58,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 359 transitions, 3749 flow, removed 96 selfloop flow, removed 0 redundant places. [2025-04-14 00:55:58,429 INFO L231 Difference]: Finished difference. Result has 120 places, 282 transitions, 2984 flow [2025-04-14 00:55:58,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2547, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2984, PETRI_PLACES=120, PETRI_TRANSITIONS=282} [2025-04-14 00:55:58,430 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 76 predicate places. [2025-04-14 00:55:58,430 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 282 transitions, 2984 flow [2025-04-14 00:55:58,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:55:58,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:58,430 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, 1, 1, 1] [2025-04-14 00:55:58,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 00:55:58,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 00:55:58,631 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-14 00:55:58,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1481387286, now seen corresponding path program 4 times [2025-04-14 00:55:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:58,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006002887] [2025-04-14 00:55:58,632 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:55:58,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:58,639 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:55:58,645 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:55:58,646 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:55:58,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:58,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006002887] [2025-04-14 00:55:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006002887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:55:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444669303] [2025-04-14 00:55:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:58,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:55:58,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:58,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:55:58,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:55:58,782 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:55:58,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 282 transitions, 2984 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:55:58,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:58,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:55:58,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:03,484 INFO L116 PetriNetUnfolderBase]: 46704/59920 cut-off events. [2025-04-14 00:56:03,485 INFO L117 PetriNetUnfolderBase]: For 266389/266389 co-relation queries the response was YES. [2025-04-14 00:56:03,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237263 conditions, 59920 events. 46704/59920 cut-off events. For 266389/266389 co-relation queries the response was YES. Maximal size of possible extension queue 3285. Compared 349764 event pairs, 7485 based on Foata normal form. 1/44473 useless extension candidates. Maximal degree in co-relation 237196. Up to 55302 conditions per place. [2025-04-14 00:56:04,137 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 277 selfloop transitions, 74 changer transitions 6/361 dead transitions. [2025-04-14 00:56:04,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 361 transitions, 4196 flow [2025-04-14 00:56:04,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:56:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:56:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-04-14 00:56:04,138 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6132404181184669 [2025-04-14 00:56:04,138 INFO L175 Difference]: Start difference. First operand has 120 places, 282 transitions, 2984 flow. Second operand 7 states and 176 transitions. [2025-04-14 00:56:04,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 361 transitions, 4196 flow [2025-04-14 00:56:05,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 361 transitions, 4056 flow, removed 65 selfloop flow, removed 2 redundant places. [2025-04-14 00:56:05,568 INFO L231 Difference]: Finished difference. Result has 128 places, 305 transitions, 3436 flow [2025-04-14 00:56:05,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2844, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3436, PETRI_PLACES=128, PETRI_TRANSITIONS=305} [2025-04-14 00:56:05,568 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places. [2025-04-14 00:56:05,568 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 305 transitions, 3436 flow [2025-04-14 00:56:05,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:56:05,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:05,569 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, 1, 1, 1] [2025-04-14 00:56:05,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:56:05,569 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-14 00:56:05,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1407934678, now seen corresponding path program 5 times [2025-04-14 00:56:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:05,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842864904] [2025-04-14 00:56:05,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:56:05,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:05,577 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:56:05,583 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:56:05,583 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:56:05,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:06,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842864904] [2025-04-14 00:56:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842864904] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:06,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747268835] [2025-04-14 00:56:06,040 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:56:06,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:06,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:06,042 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-14 00:56:06,044 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-14 00:56:06,100 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:56:06,122 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:56:06,123 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:56:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:06,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 00:56:06,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:56:06,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:56:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:56:06,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:56:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:06,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747268835] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:06,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:56:06,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 17 [2025-04-14 00:56:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326035221] [2025-04-14 00:56:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:06,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:56:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:06,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:56:06,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:56:06,407 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:56:06,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 305 transitions, 3436 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:56:06,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:06,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:56:06,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:11,483 INFO L116 PetriNetUnfolderBase]: 46703/59898 cut-off events. [2025-04-14 00:56:11,484 INFO L117 PetriNetUnfolderBase]: For 288381/288381 co-relation queries the response was YES. [2025-04-14 00:56:11,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243181 conditions, 59898 events. 46703/59898 cut-off events. For 288381/288381 co-relation queries the response was YES. Maximal size of possible extension queue 3307. Compared 350518 event pairs, 5271 based on Foata normal form. 1/44479 useless extension candidates. Maximal degree in co-relation 243110. Up to 53234 conditions per place. [2025-04-14 00:56:12,232 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 319 selfloop transitions, 50 changer transitions 5/378 dead transitions. [2025-04-14 00:56:12,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 378 transitions, 4342 flow [2025-04-14 00:56:12,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:56:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:56:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-04-14 00:56:12,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5823170731707317 [2025-04-14 00:56:12,233 INFO L175 Difference]: Start difference. First operand has 128 places, 305 transitions, 3436 flow. Second operand 8 states and 191 transitions. [2025-04-14 00:56:12,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 378 transitions, 4342 flow [2025-04-14 00:56:13,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 378 transitions, 4124 flow, removed 109 selfloop flow, removed 0 redundant places. [2025-04-14 00:56:13,540 INFO L231 Difference]: Finished difference. Result has 135 places, 304 transitions, 3304 flow [2025-04-14 00:56:13,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3204, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3304, PETRI_PLACES=135, PETRI_TRANSITIONS=304} [2025-04-14 00:56:13,541 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places. [2025-04-14 00:56:13,541 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 304 transitions, 3304 flow [2025-04-14 00:56:13,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:56:13,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:13,541 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, 1, 1, 1] [2025-04-14 00:56:13,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 00:56:13,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 00:56:13,742 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-14 00:56:13,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash 682104490, now seen corresponding path program 6 times [2025-04-14 00:56:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:13,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663145514] [2025-04-14 00:56:13,743 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:56:13,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:13,751 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:56:13,762 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:56:13,762 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:56:13,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:13,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:13,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663145514] [2025-04-14 00:56:13,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663145514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:13,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:13,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:56:13,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855064497] [2025-04-14 00:56:13,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:13,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:56:13,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:13,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:56:13,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:56:13,865 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:56:13,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 304 transitions, 3304 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:56:13,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:13,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:56:13,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:18,896 INFO L116 PetriNetUnfolderBase]: 48563/62332 cut-off events. [2025-04-14 00:56:18,896 INFO L117 PetriNetUnfolderBase]: For 304938/304938 co-relation queries the response was YES. [2025-04-14 00:56:19,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252092 conditions, 62332 events. 48563/62332 cut-off events. For 304938/304938 co-relation queries the response was YES. Maximal size of possible extension queue 3461. Compared 366896 event pairs, 7747 based on Foata normal form. 1/46339 useless extension candidates. Maximal degree in co-relation 252019. Up to 57646 conditions per place. [2025-04-14 00:56:19,571 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 295 selfloop transitions, 73 changer transitions 6/378 dead transitions. [2025-04-14 00:56:19,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 378 transitions, 4471 flow [2025-04-14 00:56:19,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:56:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:56:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2025-04-14 00:56:19,572 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6236933797909407 [2025-04-14 00:56:19,572 INFO L175 Difference]: Start difference. First operand has 135 places, 304 transitions, 3304 flow. Second operand 7 states and 179 transitions. [2025-04-14 00:56:19,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 378 transitions, 4471 flow [2025-04-14 00:56:20,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 378 transitions, 4375 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:56:20,911 INFO L231 Difference]: Finished difference. Result has 137 places, 319 transitions, 3661 flow [2025-04-14 00:56:20,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3208, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3661, PETRI_PLACES=137, PETRI_TRANSITIONS=319} [2025-04-14 00:56:20,911 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places. [2025-04-14 00:56:20,911 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 319 transitions, 3661 flow [2025-04-14 00:56:20,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:56:20,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:20,911 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, 1, 1, 1] [2025-04-14 00:56:20,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:56:20,912 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-14 00:56:20,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1472633392, now seen corresponding path program 1 times [2025-04-14 00:56:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:20,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891562062] [2025-04-14 00:56:20,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:20,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 00:56:20,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:56:20,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:20,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:21,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:21,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891562062] [2025-04-14 00:56:21,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891562062] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:21,340 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837555597] [2025-04-14 00:56:21,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:21,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:21,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:21,342 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:56:21,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 00:56:21,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 00:56:21,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:56:21,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:21,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:21,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 00:56:21,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:56:21,585 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:56:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:56:21,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:56:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:21,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837555597] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:21,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:56:21,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-14 00:56:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218055016] [2025-04-14 00:56:21,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:21,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:56:21,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:21,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:56:21,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:56:21,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:56:21,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 319 transitions, 3661 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:56:21,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:21,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:56:21,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:27,252 INFO L116 PetriNetUnfolderBase]: 53376/68580 cut-off events. [2025-04-14 00:56:27,253 INFO L117 PetriNetUnfolderBase]: For 416170/416170 co-relation queries the response was YES. [2025-04-14 00:56:27,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289548 conditions, 68580 events. 53376/68580 cut-off events. For 416170/416170 co-relation queries the response was YES. Maximal size of possible extension queue 3868. Compared 411606 event pairs, 6900 based on Foata normal form. 2/50944 useless extension candidates. Maximal degree in co-relation 289473. Up to 61075 conditions per place. [2025-04-14 00:56:28,027 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 369 selfloop transitions, 49 changer transitions 4/426 dead transitions. [2025-04-14 00:56:28,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 426 transitions, 5325 flow [2025-04-14 00:56:28,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:56:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:56:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2025-04-14 00:56:28,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-04-14 00:56:28,028 INFO L175 Difference]: Start difference. First operand has 137 places, 319 transitions, 3661 flow. Second operand 8 states and 192 transitions. [2025-04-14 00:56:28,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 426 transitions, 5325 flow [2025-04-14 00:56:30,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 426 transitions, 5018 flow, removed 111 selfloop flow, removed 3 redundant places. [2025-04-14 00:56:30,091 INFO L231 Difference]: Finished difference. Result has 144 places, 352 transitions, 4176 flow [2025-04-14 00:56:30,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3357, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4176, PETRI_PLACES=144, PETRI_TRANSITIONS=352} [2025-04-14 00:56:30,092 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places. [2025-04-14 00:56:30,092 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 352 transitions, 4176 flow [2025-04-14 00:56:30,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:56:30,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:30,092 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, 1, 1, 1] [2025-04-14 00:56:30,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 00:56:30,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:30,293 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-14 00:56:30,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1662984815, now seen corresponding path program 1 times [2025-04-14 00:56:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:30,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54907192] [2025-04-14 00:56:30,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:30,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 00:56:30,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:56:30,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:30,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:30,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:30,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54907192] [2025-04-14 00:56:30,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54907192] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:30,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935099399] [2025-04-14 00:56:30,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:30,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:30,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:30,508 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:56:30,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 00:56:30,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 00:56:30,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:56:30,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:30,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:30,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 00:56:30,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:56:30,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:56:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:56:30,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:56:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:30,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935099399] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:30,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:56:30,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-14 00:56:30,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526280440] [2025-04-14 00:56:30,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:30,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:56:30,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:30,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:56:30,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:56:30,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:56:30,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 352 transitions, 4176 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:56:30,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:30,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:56:30,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:37,138 INFO L116 PetriNetUnfolderBase]: 57402/73846 cut-off events. [2025-04-14 00:56:37,138 INFO L117 PetriNetUnfolderBase]: For 521596/521596 co-relation queries the response was YES. [2025-04-14 00:56:37,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320464 conditions, 73846 events. 57402/73846 cut-off events. For 521596/521596 co-relation queries the response was YES. Maximal size of possible extension queue 4114. Compared 448134 event pairs, 7647 based on Foata normal form. 2/54818 useless extension candidates. Maximal degree in co-relation 320385. Up to 67070 conditions per place. [2025-04-14 00:56:38,105 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 395 selfloop transitions, 54 changer transitions 4/457 dead transitions. [2025-04-14 00:56:38,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 457 transitions, 5986 flow [2025-04-14 00:56:38,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:56:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:56:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2025-04-14 00:56:38,106 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5762195121951219 [2025-04-14 00:56:38,106 INFO L175 Difference]: Start difference. First operand has 144 places, 352 transitions, 4176 flow. Second operand 8 states and 189 transitions. [2025-04-14 00:56:38,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 457 transitions, 5986 flow [2025-04-14 00:56:41,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 457 transitions, 5601 flow, removed 190 selfloop flow, removed 1 redundant places. [2025-04-14 00:56:41,992 INFO L231 Difference]: Finished difference. Result has 154 places, 386 transitions, 4730 flow [2025-04-14 00:56:41,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3859, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4730, PETRI_PLACES=154, PETRI_TRANSITIONS=386} [2025-04-14 00:56:41,996 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places. [2025-04-14 00:56:41,996 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 386 transitions, 4730 flow [2025-04-14 00:56:41,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:56:41,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:41,996 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, 1, 1, 1] [2025-04-14 00:56:42,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 00:56:42,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 00:56:42,197 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-14 00:56:42,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1452860804, now seen corresponding path program 2 times [2025-04-14 00:56:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:42,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434868753] [2025-04-14 00:56:42,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:42,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:56:42,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:56:42,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:42,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:42,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434868753] [2025-04-14 00:56:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434868753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:42,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:56:42,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254456110] [2025-04-14 00:56:42,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:42,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:56:42,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:42,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:56:42,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:56:42,286 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:56:42,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 386 transitions, 4730 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:56:42,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:42,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:56:42,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:48,773 INFO L116 PetriNetUnfolderBase]: 59321/76359 cut-off events. [2025-04-14 00:56:48,773 INFO L117 PetriNetUnfolderBase]: For 565100/565100 co-relation queries the response was YES. [2025-04-14 00:56:49,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332963 conditions, 76359 events. 59321/76359 cut-off events. For 565100/565100 co-relation queries the response was YES. Maximal size of possible extension queue 4298. Compared 464475 event pairs, 9598 based on Foata normal form. 1/56750 useless extension candidates. Maximal degree in co-relation 332879. Up to 71595 conditions per place. [2025-04-14 00:56:49,988 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 385 selfloop transitions, 84 changer transitions 4/477 dead transitions. [2025-04-14 00:56:49,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 477 transitions, 6381 flow [2025-04-14 00:56:49,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:56:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:56:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2025-04-14 00:56:49,991 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6480836236933798 [2025-04-14 00:56:49,991 INFO L175 Difference]: Start difference. First operand has 154 places, 386 transitions, 4730 flow. Second operand 7 states and 186 transitions. [2025-04-14 00:56:49,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 477 transitions, 6381 flow [2025-04-14 00:56:53,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 477 transitions, 6056 flow, removed 160 selfloop flow, removed 1 redundant places. [2025-04-14 00:56:53,466 INFO L231 Difference]: Finished difference. Result has 162 places, 413 transitions, 5220 flow [2025-04-14 00:56:53,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4405, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5220, PETRI_PLACES=162, PETRI_TRANSITIONS=413} [2025-04-14 00:56:53,466 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 118 predicate places. [2025-04-14 00:56:53,466 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 413 transitions, 5220 flow [2025-04-14 00:56:53,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:56:53,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:53,467 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, 1, 1, 1] [2025-04-14 00:56:53,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:56:53,467 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-14 00:56:53,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:53,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1571765636, now seen corresponding path program 3 times [2025-04-14 00:56:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:53,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288159456] [2025-04-14 00:56:53,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:56:53,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:53,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:56:53,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:56:53,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:56:53,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:53,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:53,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288159456] [2025-04-14 00:56:53,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288159456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:53,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:53,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:56:53,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072239999] [2025-04-14 00:56:53,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:53,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:56:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:53,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:56:53,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:56:53,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:56:53,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 413 transitions, 5220 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:56:53,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:53,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:56:53,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:01,313 INFO L116 PetriNetUnfolderBase]: 61217/78828 cut-off events. [2025-04-14 00:57:01,314 INFO L117 PetriNetUnfolderBase]: For 614851/614851 co-relation queries the response was YES. [2025-04-14 00:57:02,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349284 conditions, 78828 events. 61217/78828 cut-off events. For 614851/614851 co-relation queries the response was YES. Maximal size of possible extension queue 4430. Compared 481449 event pairs, 9936 based on Foata normal form. 1/58660 useless extension candidates. Maximal degree in co-relation 349196. Up to 74054 conditions per place. [2025-04-14 00:57:02,451 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 403 selfloop transitions, 84 changer transitions 4/495 dead transitions. [2025-04-14 00:57:02,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 495 transitions, 6782 flow [2025-04-14 00:57:02,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:57:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:57:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2025-04-14 00:57:02,452 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6515679442508711 [2025-04-14 00:57:02,452 INFO L175 Difference]: Start difference. First operand has 162 places, 413 transitions, 5220 flow. Second operand 7 states and 187 transitions. [2025-04-14 00:57:02,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 495 transitions, 6782 flow [2025-04-14 00:57:05,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 495 transitions, 6386 flow, removed 178 selfloop flow, removed 1 redundant places. [2025-04-14 00:57:05,913 INFO L231 Difference]: Finished difference. Result has 169 places, 430 transitions, 5463 flow [2025-04-14 00:57:05,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4824, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5463, PETRI_PLACES=169, PETRI_TRANSITIONS=430} [2025-04-14 00:57:05,913 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 125 predicate places. [2025-04-14 00:57:05,913 INFO L485 AbstractCegarLoop]: Abstraction has has 169 places, 430 transitions, 5463 flow [2025-04-14 00:57:05,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:57:05,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:05,914 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, 1, 1, 1] [2025-04-14 00:57:05,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 00:57:05,914 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:57:05,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1455064421, now seen corresponding path program 2 times [2025-04-14 00:57:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:05,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507009495] [2025-04-14 00:57:05,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:57:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:05,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:57:05,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:57:05,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:57:05,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:06,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:06,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507009495] [2025-04-14 00:57:06,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507009495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:06,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:06,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:57:06,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185607096] [2025-04-14 00:57:06,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:06,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:06,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:06,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:06,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:06,006 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:57:06,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 430 transitions, 5463 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:57:06,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:06,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:57:06,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:13,599 INFO L116 PetriNetUnfolderBase]: 62847/80939 cut-off events. [2025-04-14 00:57:13,599 INFO L117 PetriNetUnfolderBase]: For 687407/687407 co-relation queries the response was YES. [2025-04-14 00:57:14,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363714 conditions, 80939 events. 62847/80939 cut-off events. For 687407/687407 co-relation queries the response was YES. Maximal size of possible extension queue 4592. Compared 496130 event pairs, 10508 based on Foata normal form. 1/60291 useless extension candidates. Maximal degree in co-relation 363623. Up to 76453 conditions per place. [2025-04-14 00:57:14,929 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 413 selfloop transitions, 89 changer transitions 4/510 dead transitions. [2025-04-14 00:57:14,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 510 transitions, 7164 flow [2025-04-14 00:57:14,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:57:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:57:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-04-14 00:57:14,930 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.627177700348432 [2025-04-14 00:57:14,930 INFO L175 Difference]: Start difference. First operand has 169 places, 430 transitions, 5463 flow. Second operand 7 states and 180 transitions. [2025-04-14 00:57:14,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 510 transitions, 7164 flow [2025-04-14 00:57:18,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 510 transitions, 6663 flow, removed 179 selfloop flow, removed 4 redundant places. [2025-04-14 00:57:18,802 INFO L231 Difference]: Finished difference. Result has 173 places, 452 transitions, 5738 flow [2025-04-14 00:57:18,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4973, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5738, PETRI_PLACES=173, PETRI_TRANSITIONS=452} [2025-04-14 00:57:18,802 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 129 predicate places. [2025-04-14 00:57:18,802 INFO L485 AbstractCegarLoop]: Abstraction has has 173 places, 452 transitions, 5738 flow [2025-04-14 00:57:18,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:57:18,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:18,803 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, 1, 1, 1] [2025-04-14 00:57:18,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 00:57:18,803 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:57:18,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash -224627295, now seen corresponding path program 3 times [2025-04-14 00:57:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:18,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314278197] [2025-04-14 00:57:18,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:57:18,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:18,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:57:18,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:57:18,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:57:18,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:18,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:18,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314278197] [2025-04-14 00:57:18,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314278197] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:18,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:18,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:57:18,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681818297] [2025-04-14 00:57:18,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:18,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:18,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:18,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:18,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:18,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:57:18,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 452 transitions, 5738 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:57:18,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:18,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:57:18,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:26,967 INFO L116 PetriNetUnfolderBase]: 64455/83024 cut-off events. [2025-04-14 00:57:26,968 INFO L117 PetriNetUnfolderBase]: For 746894/746894 co-relation queries the response was YES. [2025-04-14 00:57:27,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377763 conditions, 83024 events. 64455/83024 cut-off events. For 746894/746894 co-relation queries the response was YES. Maximal size of possible extension queue 4659. Compared 510738 event pairs, 10701 based on Foata normal form. 1/61897 useless extension candidates. Maximal degree in co-relation 377670. Up to 78526 conditions per place. [2025-04-14 00:57:28,209 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 432 selfloop transitions, 89 changer transitions 4/529 dead transitions. [2025-04-14 00:57:28,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 529 transitions, 7418 flow [2025-04-14 00:57:28,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:57:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:57:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2025-04-14 00:57:28,211 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-04-14 00:57:28,211 INFO L175 Difference]: Start difference. First operand has 173 places, 452 transitions, 5738 flow. Second operand 7 states and 182 transitions. [2025-04-14 00:57:28,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 529 transitions, 7418 flow [2025-04-14 00:57:32,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 529 transitions, 6935 flow, removed 197 selfloop flow, removed 2 redundant places. [2025-04-14 00:57:32,777 INFO L231 Difference]: Finished difference. Result has 179 places, 469 transitions, 5966 flow [2025-04-14 00:57:32,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5255, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5966, PETRI_PLACES=179, PETRI_TRANSITIONS=469} [2025-04-14 00:57:32,778 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places. [2025-04-14 00:57:32,778 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 469 transitions, 5966 flow [2025-04-14 00:57:32,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:57:32,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:32,778 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, 1, 1, 1] [2025-04-14 00:57:32,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 00:57:32,778 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:57:32,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:32,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1564580732, now seen corresponding path program 4 times [2025-04-14 00:57:32,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:32,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46320028] [2025-04-14 00:57:32,778 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:57:32,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:32,784 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:57:32,788 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:57:32,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:57:32,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:32,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46320028] [2025-04-14 00:57:32,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46320028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:32,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:57:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141010230] [2025-04-14 00:57:32,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:32,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:32,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:32,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:32,868 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:57:32,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 469 transitions, 5966 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:57:32,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:32,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:57:32,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:41,292 INFO L116 PetriNetUnfolderBase]: 67637/87165 cut-off events. [2025-04-14 00:57:41,293 INFO L117 PetriNetUnfolderBase]: For 850632/850632 co-relation queries the response was YES. [2025-04-14 00:57:42,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402280 conditions, 87165 events. 67637/87165 cut-off events. For 850632/850632 co-relation queries the response was YES. Maximal size of possible extension queue 4886. Compared 537617 event pairs, 10884 based on Foata normal form. 1/65161 useless extension candidates. Maximal degree in co-relation 402185. Up to 79220 conditions per place. [2025-04-14 00:57:42,618 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 438 selfloop transitions, 129 changer transitions 8/579 dead transitions. [2025-04-14 00:57:42,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 579 transitions, 8110 flow [2025-04-14 00:57:42,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:57:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:57:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2025-04-14 00:57:42,619 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6724738675958188 [2025-04-14 00:57:42,619 INFO L175 Difference]: Start difference. First operand has 179 places, 469 transitions, 5966 flow. Second operand 7 states and 193 transitions. [2025-04-14 00:57:42,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 579 transitions, 8110 flow [2025-04-14 00:57:47,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 579 transitions, 7591 flow, removed 210 selfloop flow, removed 3 redundant places. [2025-04-14 00:57:47,253 INFO L231 Difference]: Finished difference. Result has 185 places, 506 transitions, 6603 flow [2025-04-14 00:57:47,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5449, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6603, PETRI_PLACES=185, PETRI_TRANSITIONS=506} [2025-04-14 00:57:47,254 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2025-04-14 00:57:47,254 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 506 transitions, 6603 flow [2025-04-14 00:57:47,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:57:47,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:47,254 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, 1, 1, 1] [2025-04-14 00:57:47,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 00:57:47,254 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:57:47,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2106995438, now seen corresponding path program 5 times [2025-04-14 00:57:47,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:47,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866640733] [2025-04-14 00:57:47,255 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:47,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:47,262 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:57:47,271 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:57:47,271 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:57:47,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:47,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:47,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866640733] [2025-04-14 00:57:47,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866640733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:57:47,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669024846] [2025-04-14 00:57:47,520 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:47,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:57:47,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:57:47,522 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:57:47,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 00:57:47,581 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:57:47,600 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:57:47,600 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:57:47,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:47,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 00:57:47,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:57:47,735 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:57:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:57:47,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:57:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:47,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669024846] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:57:47,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:57:47,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-14 00:57:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138565281] [2025-04-14 00:57:47,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:47,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:57:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:47,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:57:47,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:57:47,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:57:47,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 506 transitions, 6603 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:57:47,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:47,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:57:47,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:57,728 INFO L116 PetriNetUnfolderBase]: 69110/89068 cut-off events. [2025-04-14 00:57:57,729 INFO L117 PetriNetUnfolderBase]: For 912521/912521 co-relation queries the response was YES. [2025-04-14 00:57:58,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421249 conditions, 89068 events. 69110/89068 cut-off events. For 912521/912521 co-relation queries the response was YES. Maximal size of possible extension queue 4991. Compared 553324 event pairs, 10516 based on Foata normal form. 1/66621 useless extension candidates. Maximal degree in co-relation 421150. Up to 85131 conditions per place. [2025-04-14 00:57:59,146 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 548 selfloop transitions, 43 changer transitions 5/600 dead transitions. [2025-04-14 00:57:59,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 600 transitions, 8597 flow [2025-04-14 00:57:59,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:57:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:57:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-04-14 00:57:59,148 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6445993031358885 [2025-04-14 00:57:59,148 INFO L175 Difference]: Start difference. First operand has 185 places, 506 transitions, 6603 flow. Second operand 7 states and 185 transitions. [2025-04-14 00:57:59,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 600 transitions, 8597 flow [2025-04-14 00:58:06,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 600 transitions, 8032 flow, removed 237 selfloop flow, removed 2 redundant places. [2025-04-14 00:58:06,620 INFO L231 Difference]: Finished difference. Result has 191 places, 526 transitions, 6794 flow [2025-04-14 00:58:06,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6044, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6794, PETRI_PLACES=191, PETRI_TRANSITIONS=526} [2025-04-14 00:58:06,621 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 147 predicate places. [2025-04-14 00:58:06,621 INFO L485 AbstractCegarLoop]: Abstraction has has 191 places, 526 transitions, 6794 flow [2025-04-14 00:58:06,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:58:06,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:06,621 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, 1, 1, 1] [2025-04-14 00:58:06,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 00:58:06,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-14 00:58:06,822 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:58:06,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1988090606, now seen corresponding path program 6 times [2025-04-14 00:58:06,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:06,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722683669] [2025-04-14 00:58:06,822 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:58:06,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:06,830 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:58:06,837 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:58:06,837 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:58:06,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:58:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:06,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722683669] [2025-04-14 00:58:06,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722683669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:58:06,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:58:06,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:58:06,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179151873] [2025-04-14 00:58:06,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:58:06,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:58:06,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:58:06,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:58:06,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:58:06,940 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:58:06,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 526 transitions, 6794 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:58:06,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:58:06,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:58:06,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:58:16,563 INFO L116 PetriNetUnfolderBase]: 70896/91414 cut-off events. [2025-04-14 00:58:16,563 INFO L117 PetriNetUnfolderBase]: For 969070/969070 co-relation queries the response was YES. [2025-04-14 00:58:17,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430974 conditions, 91414 events. 70896/91414 cut-off events. For 969070/969070 co-relation queries the response was YES. Maximal size of possible extension queue 5206. Compared 568954 event pairs, 12119 based on Foata normal form. 1/68406 useless extension candidates. Maximal degree in co-relation 430872. Up to 86430 conditions per place. [2025-04-14 00:58:18,132 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 503 selfloop transitions, 94 changer transitions 5/606 dead transitions. [2025-04-14 00:58:18,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 606 transitions, 8579 flow [2025-04-14 00:58:18,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:58:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:58:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-04-14 00:58:18,133 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6445993031358885 [2025-04-14 00:58:18,133 INFO L175 Difference]: Start difference. First operand has 191 places, 526 transitions, 6794 flow. Second operand 7 states and 185 transitions. [2025-04-14 00:58:18,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 606 transitions, 8579 flow [2025-04-14 00:58:22,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 606 transitions, 8246 flow, removed 164 selfloop flow, removed 1 redundant places. [2025-04-14 00:58:22,951 INFO L231 Difference]: Finished difference. Result has 199 places, 543 transitions, 7181 flow [2025-04-14 00:58:22,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6461, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7181, PETRI_PLACES=199, PETRI_TRANSITIONS=543} [2025-04-14 00:58:22,952 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 155 predicate places. [2025-04-14 00:58:22,952 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 543 transitions, 7181 flow [2025-04-14 00:58:22,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:58:22,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:22,952 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, 1, 1, 1] [2025-04-14 00:58:22,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 00:58:22,952 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:58:22,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -284539561, now seen corresponding path program 4 times [2025-04-14 00:58:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:22,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245236075] [2025-04-14 00:58:22,952 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:58:22,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:22,958 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:58:22,963 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:58:22,963 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:58:22,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:58:23,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:23,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245236075] [2025-04-14 00:58:23,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245236075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:58:23,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:58:23,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:58:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580286346] [2025-04-14 00:58:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:58:23,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:58:23,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:58:23,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:58:23,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:58:23,053 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:58:23,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 543 transitions, 7181 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:58:23,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:58:23,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:58:23,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:58:32,984 INFO L116 PetriNetUnfolderBase]: 72663/93701 cut-off events. [2025-04-14 00:58:32,984 INFO L117 PetriNetUnfolderBase]: For 1087481/1087481 co-relation queries the response was YES. [2025-04-14 00:58:34,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451357 conditions, 93701 events. 72663/93701 cut-off events. For 1087481/1087481 co-relation queries the response was YES. Maximal size of possible extension queue 5353. Compared 585219 event pairs, 12279 based on Foata normal form. 1/70154 useless extension candidates. Maximal degree in co-relation 451251. Up to 89066 conditions per place. [2025-04-14 00:58:34,616 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 513 selfloop transitions, 92 changer transitions 6/615 dead transitions. [2025-04-14 00:58:34,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 615 transitions, 9035 flow [2025-04-14 00:58:34,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:58:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:58:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2025-04-14 00:58:34,617 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6202090592334495 [2025-04-14 00:58:34,617 INFO L175 Difference]: Start difference. First operand has 199 places, 543 transitions, 7181 flow. Second operand 7 states and 178 transitions. [2025-04-14 00:58:34,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 615 transitions, 9035 flow [2025-04-14 00:58:43,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 615 transitions, 8628 flow, removed 180 selfloop flow, removed 1 redundant places. [2025-04-14 00:58:43,653 INFO L231 Difference]: Finished difference. Result has 206 places, 559 transitions, 7500 flow [2025-04-14 00:58:43,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6774, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7500, PETRI_PLACES=206, PETRI_TRANSITIONS=559} [2025-04-14 00:58:43,653 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 162 predicate places. [2025-04-14 00:58:43,653 INFO L485 AbstractCegarLoop]: Abstraction has has 206 places, 559 transitions, 7500 flow [2025-04-14 00:58:43,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:58:43,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:43,654 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, 1, 1, 1] [2025-04-14 00:58:43,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 00:58:43,654 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:58:43,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:43,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1947308241, now seen corresponding path program 5 times [2025-04-14 00:58:43,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:43,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529378814] [2025-04-14 00:58:43,654 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:58:43,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:43,659 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:58:43,666 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:58:43,666 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:58:43,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:58:43,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:43,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529378814] [2025-04-14 00:58:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529378814] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:58:43,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394684925] [2025-04-14 00:58:43,884 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:58:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:58:43,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:58:43,885 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:58:43,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 00:58:43,944 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:58:43,962 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 00:58:43,962 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:58:43,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:43,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 00:58:43,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:58:44,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:58:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:58:44,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:58:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:58:44,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394684925] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:58:44,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:58:44,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 19 [2025-04-14 00:58:44,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946175110] [2025-04-14 00:58:44,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:58:44,224 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:58:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:58:44,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:58:44,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:58:44,225 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:58:44,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 559 transitions, 7500 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:58:44,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:58:44,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:58:44,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:58:55,121 INFO L116 PetriNetUnfolderBase]: 72662/93679 cut-off events. [2025-04-14 00:58:55,122 INFO L117 PetriNetUnfolderBase]: For 1047367/1047367 co-relation queries the response was YES. [2025-04-14 00:58:56,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446392 conditions, 93679 events. 72662/93679 cut-off events. For 1047367/1047367 co-relation queries the response was YES. Maximal size of possible extension queue 5409. Compared 587055 event pairs, 11020 based on Foata normal form. 1/70160 useless extension candidates. Maximal degree in co-relation 446283. Up to 86904 conditions per place. [2025-04-14 00:58:56,973 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 567 selfloop transitions, 53 changer transitions 5/629 dead transitions. [2025-04-14 00:58:56,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 629 transitions, 8894 flow [2025-04-14 00:58:56,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:58:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:58:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-04-14 00:58:56,974 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.573170731707317 [2025-04-14 00:58:56,974 INFO L175 Difference]: Start difference. First operand has 206 places, 559 transitions, 7500 flow. Second operand 8 states and 188 transitions. [2025-04-14 00:58:56,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 629 transitions, 8894 flow [2025-04-14 00:59:04,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 629 transitions, 8290 flow, removed 255 selfloop flow, removed 2 redundant places. [2025-04-14 00:59:04,775 INFO L231 Difference]: Finished difference. Result has 211 places, 558 transitions, 6981 flow [2025-04-14 00:59:04,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6875, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6981, PETRI_PLACES=211, PETRI_TRANSITIONS=558} [2025-04-14 00:59:04,776 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 167 predicate places. [2025-04-14 00:59:04,776 INFO L485 AbstractCegarLoop]: Abstraction has has 211 places, 558 transitions, 6981 flow [2025-04-14 00:59:04,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-14 00:59:04,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:04,776 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, 1, 1, 1] [2025-04-14 00:59:04,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-14 00:59:04,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-14 00:59:04,977 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:04,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:04,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1295086899, now seen corresponding path program 6 times [2025-04-14 00:59:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:04,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481979956] [2025-04-14 00:59:04,978 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:59:04,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:04,983 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:59:04,988 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:59:04,988 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:59:04,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:59:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:05,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481979956] [2025-04-14 00:59:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481979956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:05,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:05,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:59:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086549187] [2025-04-14 00:59:05,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:05,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:59:05,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:05,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:59:05,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:59:05,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:59:05,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 558 transitions, 6981 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:59:05,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:05,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:59:05,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:15,262 INFO L116 PetriNetUnfolderBase]: 74438/96001 cut-off events. [2025-04-14 00:59:15,263 INFO L117 PetriNetUnfolderBase]: For 1058796/1058796 co-relation queries the response was YES. [2025-04-14 00:59:16,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453791 conditions, 96001 events. 74438/96001 cut-off events. For 1058796/1058796 co-relation queries the response was YES. Maximal size of possible extension queue 5516. Compared 601732 event pairs, 12671 based on Foata normal form. 1/71923 useless extension candidates. Maximal degree in co-relation 453682. Up to 91354 conditions per place. [2025-04-14 00:59:17,142 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 530 selfloop transitions, 91 changer transitions 6/631 dead transitions. [2025-04-14 00:59:17,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 631 transitions, 8887 flow [2025-04-14 00:59:17,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:59:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:59:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-04-14 00:59:17,143 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.627177700348432 [2025-04-14 00:59:17,143 INFO L175 Difference]: Start difference. First operand has 211 places, 558 transitions, 6981 flow. Second operand 7 states and 180 transitions. [2025-04-14 00:59:17,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 631 transitions, 8887 flow [2025-04-14 00:59:23,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 631 transitions, 8800 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-14 00:59:23,010 INFO L231 Difference]: Finished difference. Result has 214 places, 573 transitions, 7631 flow [2025-04-14 00:59:23,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6894, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7631, PETRI_PLACES=214, PETRI_TRANSITIONS=573} [2025-04-14 00:59:23,010 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 170 predicate places. [2025-04-14 00:59:23,010 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 573 transitions, 7631 flow [2025-04-14 00:59:23,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:59:23,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:23,011 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, 1, 1, 1] [2025-04-14 00:59:23,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 00:59:23,011 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:59:23,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1607631245, now seen corresponding path program 6 times [2025-04-14 00:59:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:23,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037422810] [2025-04-14 00:59:23,011 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:59:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:23,016 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-04-14 00:59:23,020 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-04-14 00:59:23,020 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:59:23,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:59:23,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:23,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037422810] [2025-04-14 00:59:23,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037422810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:23,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:23,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:59:23,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429925556] [2025-04-14 00:59:23,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:23,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:59:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:23,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:59:23,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:59:23,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-04-14 00:59:23,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 573 transitions, 7631 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-14 00:59:23,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:23,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-04-14 00:59:23,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand