/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-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:52:23,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:52:23,600 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:52:23,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:52:23,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:52:23,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:52:23,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:52:23,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:52:23,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:52:23,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:52:23,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:52:23,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:52:23,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:52:23,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:52:23,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:52:23,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:52:23,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:52:23,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:52:23,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:52:23,629 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:52:23,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:52:23,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:52:23,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:52:23,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:52:23,854 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:52:23,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2025-04-14 00:52:25,148 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44121bda/decbf8bb4a964eda999d487c6e04ac0f/FLAGa6898fb42 [2025-04-14 00:52:25,353 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:52:25,353 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2025-04-14 00:52:25,361 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44121bda/decbf8bb4a964eda999d487c6e04ac0f/FLAGa6898fb42 [2025-04-14 00:52:26,148 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44121bda/decbf8bb4a964eda999d487c6e04ac0f [2025-04-14 00:52:26,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:52:26,152 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:52:26,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:52:26,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:52:26,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:52:26,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516cb22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26, skipping insertion in model container [2025-04-14 00:52:26,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:52:26,324 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-min-max-1.wvr.c[2642,2655] [2025-04-14 00:52:26,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:52:26,338 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:52:26,360 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-min-max-1.wvr.c[2642,2655] [2025-04-14 00:52:26,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:52:26,372 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:52:26,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26 WrapperNode [2025-04-14 00:52:26,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:52:26,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:52:26,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:52:26,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:52:26,377 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:52:26" (1/1) ... [2025-04-14 00:52:26,383 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:52:26" (1/1) ... [2025-04-14 00:52:26,404 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-04-14 00:52:26,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:52:26,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:52:26,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:52:26,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:52:26,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,437 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 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:52:26,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:52:26,453 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:52:26,453 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:52:26,453 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:52:26,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (1/1) ... [2025-04-14 00:52:26,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:52:26,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:26,480 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:52:26,483 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:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:52:26,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:52:26,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:52:26,498 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:52:26,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:52:26,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:52:26,499 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:52:26,585 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:52:26,587 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:52:26,790 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:52:26,791 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:52:26,792 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:52:26,941 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:52:26,944 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:52:26,948 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:52:26,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:52:26 BoogieIcfgContainer [2025-04-14 00:52:26,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:52:26,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:52:26,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:52:26,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:52:26,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:52:26" (1/3) ... [2025-04-14 00:52:26,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec2d9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:52:26, skipping insertion in model container [2025-04-14 00:52:26,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:26" (2/3) ... [2025-04-14 00:52:26,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec2d9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:52:26, skipping insertion in model container [2025-04-14 00:52:26,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:52:26" (3/3) ... [2025-04-14 00:52:26,954 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-04-14 00:52:26,965 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:52:26,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 46 locations, 51 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 00:52:26,966 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:52:27,021 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:52:27,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 129 flow [2025-04-14 00:52:27,095 INFO L116 PetriNetUnfolderBase]: 9/51 cut-off events. [2025-04-14 00:52:27,100 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:52:27,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 9/51 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2025-04-14 00:52:27,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 129 flow [2025-04-14 00:52:27,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 50 transitions, 118 flow [2025-04-14 00:52:27,113 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:52:27,121 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;@7a6102fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:52:27,121 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:52:27,137 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:52:27,137 INFO L116 PetriNetUnfolderBase]: 9/49 cut-off events. [2025-04-14 00:52:27,137 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:52:27,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:27,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:27,138 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 1 more)] === [2025-04-14 00:52:27,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1973006583, now seen corresponding path program 1 times [2025-04-14 00:52:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:27,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204431116] [2025-04-14 00:52:27,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:27,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:52:27,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:52:27,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:27,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:27,398 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:52:27,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:27,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204431116] [2025-04-14 00:52:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204431116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:27,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:52:27,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369559520] [2025-04-14 00:52:27,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:27,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:52:27,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:27,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:52:27,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:52:27,426 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 54 [2025-04-14 00:52:27,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:52:27,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:27,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 54 [2025-04-14 00:52:27,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:27,657 INFO L116 PetriNetUnfolderBase]: 1120/1592 cut-off events. [2025-04-14 00:52:27,657 INFO L117 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-04-14 00:52:27,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3302 conditions, 1592 events. 1120/1592 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5938 event pairs, 768 based on Foata normal form. 0/1223 useless extension candidates. Maximal degree in co-relation 3100. Up to 1560 conditions per place. [2025-04-14 00:52:27,667 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 44 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-04-14 00:52:27,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 204 flow [2025-04-14 00:52:27,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-14 00:52:27,676 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4012345679012346 [2025-04-14 00:52:27,677 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 118 flow. Second operand 3 states and 65 transitions. [2025-04-14 00:52:27,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 204 flow [2025-04-14 00:52:27,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 192 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:52:27,688 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 104 flow [2025-04-14 00:52:27,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2025-04-14 00:52:27,694 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2025-04-14 00:52:27,694 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 104 flow [2025-04-14 00:52:27,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:52:27,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:27,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:27,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:52:27,695 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 1 more)] === [2025-04-14 00:52:27,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1086410152, now seen corresponding path program 1 times [2025-04-14 00:52:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:27,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015434172] [2025-04-14 00:52:27,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:27,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-14 00:52:27,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 00:52:27,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:27,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:27,861 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:52:27,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:27,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015434172] [2025-04-14 00:52:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015434172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:27,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882250689] [2025-04-14 00:52:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:27,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:27,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:27,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:27,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 54 [2025-04-14 00:52:27,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:52:27,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:27,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 54 [2025-04-14 00:52:27,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:28,044 INFO L116 PetriNetUnfolderBase]: 1120/1593 cut-off events. [2025-04-14 00:52:28,044 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-14 00:52:28,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1593 events. 1120/1593 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5936 event pairs, 768 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 3203. Up to 1560 conditions per place. [2025-04-14 00:52:28,052 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 43 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-04-14 00:52:28,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 198 flow [2025-04-14 00:52:28,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:52:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:52:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-14 00:52:28,054 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3287037037037037 [2025-04-14 00:52:28,054 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 104 flow. Second operand 4 states and 71 transitions. [2025-04-14 00:52:28,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 198 flow [2025-04-14 00:52:28,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:28,056 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 117 flow [2025-04-14 00:52:28,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2025-04-14 00:52:28,057 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2025-04-14 00:52:28,057 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 117 flow [2025-04-14 00:52:28,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:52:28,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:28,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:28,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:52:28,060 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 1 more)] === [2025-04-14 00:52:28,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash 530809989, now seen corresponding path program 1 times [2025-04-14 00:52:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:28,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296793465] [2025-04-14 00:52:28,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:28,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:52:28,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:52:28,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:28,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:28,348 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:52:28,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:28,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296793465] [2025-04-14 00:52:28,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296793465] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:28,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:28,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:52:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881449300] [2025-04-14 00:52:28,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:28,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:52:28,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:28,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:52:28,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:52:28,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:28,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 117 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:52:28,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:28,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:28,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:28,913 INFO L116 PetriNetUnfolderBase]: 2001/2880 cut-off events. [2025-04-14 00:52:28,913 INFO L117 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-04-14 00:52:28,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5853 conditions, 2880 events. 2001/2880 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11875 event pairs, 283 based on Foata normal form. 1/2415 useless extension candidates. Maximal degree in co-relation 5833. Up to 868 conditions per place. [2025-04-14 00:52:28,921 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 88 selfloop transitions, 18 changer transitions 73/180 dead transitions. [2025-04-14 00:52:28,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 180 transitions, 748 flow [2025-04-14 00:52:28,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:52:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:52:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 253 transitions. [2025-04-14 00:52:28,923 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29282407407407407 [2025-04-14 00:52:28,923 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 117 flow. Second operand 16 states and 253 transitions. [2025-04-14 00:52:28,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 180 transitions, 748 flow [2025-04-14 00:52:28,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 180 transitions, 742 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:28,927 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 224 flow [2025-04-14 00:52:28,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=224, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-04-14 00:52:28,927 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2025-04-14 00:52:28,927 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 224 flow [2025-04-14 00:52:28,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:52:28,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:28,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:28,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:52:28,928 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 1 more)] === [2025-04-14 00:52:28,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1908585679, now seen corresponding path program 1 times [2025-04-14 00:52:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:28,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613842661] [2025-04-14 00:52:28,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:28,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:28,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 00:52:28,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 00:52:28,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:28,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:29,270 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:52:29,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:29,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613842661] [2025-04-14 00:52:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613842661] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:29,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:29,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:52:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83354752] [2025-04-14 00:52:29,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:29,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:52:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:29,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:52:29,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:52:29,282 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:29,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 224 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:52:29,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:29,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:29,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:30,204 INFO L116 PetriNetUnfolderBase]: 2555/3556 cut-off events. [2025-04-14 00:52:30,205 INFO L117 PetriNetUnfolderBase]: For 3623/3633 co-relation queries the response was YES. [2025-04-14 00:52:30,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9535 conditions, 3556 events. 2555/3556 cut-off events. For 3623/3633 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14235 event pairs, 203 based on Foata normal form. 9/2737 useless extension candidates. Maximal degree in co-relation 9521. Up to 1027 conditions per place. [2025-04-14 00:52:30,222 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 135 selfloop transitions, 37 changer transitions 67/240 dead transitions. [2025-04-14 00:52:30,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 240 transitions, 1289 flow [2025-04-14 00:52:30,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:52:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:52:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 312 transitions. [2025-04-14 00:52:30,225 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32098765432098764 [2025-04-14 00:52:30,225 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 224 flow. Second operand 18 states and 312 transitions. [2025-04-14 00:52:30,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 240 transitions, 1289 flow [2025-04-14 00:52:30,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 240 transitions, 1213 flow, removed 37 selfloop flow, removed 4 redundant places. [2025-04-14 00:52:30,253 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 435 flow [2025-04-14 00:52:30,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=435, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2025-04-14 00:52:30,254 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2025-04-14 00:52:30,254 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 435 flow [2025-04-14 00:52:30,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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:52:30,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:30,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:30,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:52:30,255 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 1 more)] === [2025-04-14 00:52:30,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash -996513603, now seen corresponding path program 2 times [2025-04-14 00:52:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:30,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330373468] [2025-04-14 00:52:30,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:30,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-14 00:52:30,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 41 statements. [2025-04-14 00:52:30,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:30,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:30,475 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:52:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:30,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330373468] [2025-04-14 00:52:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330373468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:30,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:30,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:52:30,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683815303] [2025-04-14 00:52:30,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:30,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:52:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:30,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:52:30,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:52:30,484 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:30,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 435 flow. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:30,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:30,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:30,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:31,485 INFO L116 PetriNetUnfolderBase]: 3180/4442 cut-off events. [2025-04-14 00:52:31,485 INFO L117 PetriNetUnfolderBase]: For 13828/13838 co-relation queries the response was YES. [2025-04-14 00:52:31,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18791 conditions, 4442 events. 3180/4442 cut-off events. For 13828/13838 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18300 event pairs, 225 based on Foata normal form. 70/3438 useless extension candidates. Maximal degree in co-relation 18767. Up to 1689 conditions per place. [2025-04-14 00:52:31,507 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 163 selfloop transitions, 67 changer transitions 133/364 dead transitions. [2025-04-14 00:52:31,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 364 transitions, 2864 flow [2025-04-14 00:52:31,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 00:52:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 00:52:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 448 transitions. [2025-04-14 00:52:31,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30727023319615915 [2025-04-14 00:52:31,509 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 435 flow. Second operand 27 states and 448 transitions. [2025-04-14 00:52:31,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 364 transitions, 2864 flow [2025-04-14 00:52:31,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 364 transitions, 2470 flow, removed 168 selfloop flow, removed 11 redundant places. [2025-04-14 00:52:31,541 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 977 flow [2025-04-14 00:52:31,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=977, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2025-04-14 00:52:31,542 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 63 predicate places. [2025-04-14 00:52:31,542 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 977 flow [2025-04-14 00:52:31,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:31,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:31,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:31,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:52:31,542 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 1 more)] === [2025-04-14 00:52:31,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash -133655206, now seen corresponding path program 1 times [2025-04-14 00:52:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:31,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355489442] [2025-04-14 00:52:31,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:31,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:31,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-14 00:52:31,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-14 00:52:31,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:31,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:31,814 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:52:31,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:31,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355489442] [2025-04-14 00:52:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355489442] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:31,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-14 00:52:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516823613] [2025-04-14 00:52:31,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:31,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:52:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:31,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:52:31,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:52:31,817 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:31,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 977 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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:52:31,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:31,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:31,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:33,200 INFO L116 PetriNetUnfolderBase]: 3528/4915 cut-off events. [2025-04-14 00:52:33,200 INFO L117 PetriNetUnfolderBase]: For 44067/44078 co-relation queries the response was YES. [2025-04-14 00:52:33,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26395 conditions, 4915 events. 3528/4915 cut-off events. For 44067/44078 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20015 event pairs, 161 based on Foata normal form. 12/4001 useless extension candidates. Maximal degree in co-relation 26357. Up to 1888 conditions per place. [2025-04-14 00:52:33,231 INFO L140 encePairwiseOnDemand]: 36/54 looper letters, 188 selfloop transitions, 113 changer transitions 160/462 dead transitions. [2025-04-14 00:52:33,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 462 transitions, 4406 flow [2025-04-14 00:52:33,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 00:52:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-14 00:52:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 545 transitions. [2025-04-14 00:52:33,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2803497942386831 [2025-04-14 00:52:33,233 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 977 flow. Second operand 36 states and 545 transitions. [2025-04-14 00:52:33,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 462 transitions, 4406 flow [2025-04-14 00:52:33,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 462 transitions, 3904 flow, removed 242 selfloop flow, removed 16 redundant places. [2025-04-14 00:52:33,368 INFO L231 Difference]: Finished difference. Result has 142 places, 166 transitions, 1658 flow [2025-04-14 00:52:33,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1658, PETRI_PLACES=142, PETRI_TRANSITIONS=166} [2025-04-14 00:52:33,369 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 91 predicate places. [2025-04-14 00:52:33,370 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 166 transitions, 1658 flow [2025-04-14 00:52:33,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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:52:33,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:33,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:33,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:52:33,370 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 1 more)] === [2025-04-14 00:52:33,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:33,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1894162414, now seen corresponding path program 1 times [2025-04-14 00:52:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:33,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425873651] [2025-04-14 00:52:33,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:33,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 00:52:33,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 00:52:33,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:33,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:33,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:33,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425873651] [2025-04-14 00:52:33,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425873651] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:52:33,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498788294] [2025-04-14 00:52:33,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:33,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:52:33,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:33,490 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:52:33,491 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:52:33,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 00:52:33,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 00:52:33,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:33,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:33,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:52:33,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:52:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:33,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:52:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:33,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498788294] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:52:33,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:52:33,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-14 00:52:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928775853] [2025-04-14 00:52:33,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:52:33,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:52:33,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:33,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:52:33,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:52:33,718 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 54 [2025-04-14 00:52:33,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 166 transitions, 1658 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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:52:33,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:33,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 54 [2025-04-14 00:52:33,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:34,187 INFO L116 PetriNetUnfolderBase]: 2621/3930 cut-off events. [2025-04-14 00:52:34,187 INFO L117 PetriNetUnfolderBase]: For 42864/42876 co-relation queries the response was YES. [2025-04-14 00:52:34,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22566 conditions, 3930 events. 2621/3930 cut-off events. For 42864/42876 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 17539 event pairs, 1191 based on Foata normal form. 155/3710 useless extension candidates. Maximal degree in co-relation 22518. Up to 3094 conditions per place. [2025-04-14 00:52:34,211 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 150 selfloop transitions, 5 changer transitions 54/221 dead transitions. [2025-04-14 00:52:34,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 221 transitions, 2504 flow [2025-04-14 00:52:34,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:52:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:52:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-04-14 00:52:34,212 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2025-04-14 00:52:34,212 INFO L175 Difference]: Start difference. First operand has 142 places, 166 transitions, 1658 flow. Second operand 6 states and 117 transitions. [2025-04-14 00:52:34,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 221 transitions, 2504 flow [2025-04-14 00:52:34,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 221 transitions, 2187 flow, removed 93 selfloop flow, removed 20 redundant places. [2025-04-14 00:52:34,349 INFO L231 Difference]: Finished difference. Result has 119 places, 167 transitions, 1486 flow [2025-04-14 00:52:34,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1486, PETRI_PLACES=119, PETRI_TRANSITIONS=167} [2025-04-14 00:52:34,350 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 68 predicate places. [2025-04-14 00:52:34,350 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 167 transitions, 1486 flow [2025-04-14 00:52:34,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 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:52:34,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:34,350 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:34,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:52:34,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:52:34,557 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 1 more)] === [2025-04-14 00:52:34,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash -806404955, now seen corresponding path program 2 times [2025-04-14 00:52:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:34,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869808236] [2025-04-14 00:52:34,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:34,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:34,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-14 00:52:34,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 44 statements. [2025-04-14 00:52:34,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:34,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:52:34,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:34,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869808236] [2025-04-14 00:52:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869808236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:34,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:34,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:52:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191498433] [2025-04-14 00:52:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:34,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:52:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:34,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:52:34,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:52:34,751 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:34,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 167 transitions, 1486 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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:52:34,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:34,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:34,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:35,299 INFO L116 PetriNetUnfolderBase]: 2193/3194 cut-off events. [2025-04-14 00:52:35,299 INFO L117 PetriNetUnfolderBase]: For 29135/29149 co-relation queries the response was YES. [2025-04-14 00:52:35,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17586 conditions, 3194 events. 2193/3194 cut-off events. For 29135/29149 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13182 event pairs, 161 based on Foata normal form. 53/2940 useless extension candidates. Maximal degree in co-relation 17529. Up to 1273 conditions per place. [2025-04-14 00:52:35,318 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 182 selfloop transitions, 45 changer transitions 2/230 dead transitions. [2025-04-14 00:52:35,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 230 transitions, 2384 flow [2025-04-14 00:52:35,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:52:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:52:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 170 transitions. [2025-04-14 00:52:35,320 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2623456790123457 [2025-04-14 00:52:35,320 INFO L175 Difference]: Start difference. First operand has 119 places, 167 transitions, 1486 flow. Second operand 12 states and 170 transitions. [2025-04-14 00:52:35,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 230 transitions, 2384 flow [2025-04-14 00:52:35,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 230 transitions, 2292 flow, removed 41 selfloop flow, removed 5 redundant places. [2025-04-14 00:52:35,392 INFO L231 Difference]: Finished difference. Result has 125 places, 167 transitions, 1521 flow [2025-04-14 00:52:35,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1521, PETRI_PLACES=125, PETRI_TRANSITIONS=167} [2025-04-14 00:52:35,392 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 74 predicate places. [2025-04-14 00:52:35,393 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 167 transitions, 1521 flow [2025-04-14 00:52:35,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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:52:35,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:35,393 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:35,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:52:35,393 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 1 more)] === [2025-04-14 00:52:35,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash 812087426, now seen corresponding path program 1 times [2025-04-14 00:52:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:35,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271782367] [2025-04-14 00:52:35,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:35,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:35,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:52:35,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:52:35,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:35,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:52:35,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:35,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271782367] [2025-04-14 00:52:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271782367] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:52:35,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292791613] [2025-04-14 00:52:35,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:35,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:52:35,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:35,501 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:52:35,503 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:52:35,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:52:35,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:52:35,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:35,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:35,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:52:35,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:52:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:52:35,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:52:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:52:35,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292791613] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:52:35,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:52:35,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 12 [2025-04-14 00:52:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897934554] [2025-04-14 00:52:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:35,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:52:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:35,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:52:35,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:52:35,723 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 54 [2025-04-14 00:52:35,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 167 transitions, 1521 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:52:35,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:35,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 54 [2025-04-14 00:52:35,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:36,013 INFO L116 PetriNetUnfolderBase]: 2491/3610 cut-off events. [2025-04-14 00:52:36,013 INFO L117 PetriNetUnfolderBase]: For 34530/34537 co-relation queries the response was YES. [2025-04-14 00:52:36,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19706 conditions, 3610 events. 2491/3610 cut-off events. For 34530/34537 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15176 event pairs, 795 based on Foata normal form. 2/3274 useless extension candidates. Maximal degree in co-relation 19652. Up to 2751 conditions per place. [2025-04-14 00:52:36,033 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 181 selfloop transitions, 16 changer transitions 1/210 dead transitions. [2025-04-14 00:52:36,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 210 transitions, 2352 flow [2025-04-14 00:52:36,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:52:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:52:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-04-14 00:52:36,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2025-04-14 00:52:36,034 INFO L175 Difference]: Start difference. First operand has 125 places, 167 transitions, 1521 flow. Second operand 6 states and 99 transitions. [2025-04-14 00:52:36,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 210 transitions, 2352 flow [2025-04-14 00:52:36,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 210 transitions, 2289 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-04-14 00:52:36,095 INFO L231 Difference]: Finished difference. Result has 122 places, 172 transitions, 1548 flow [2025-04-14 00:52:36,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1548, PETRI_PLACES=122, PETRI_TRANSITIONS=172} [2025-04-14 00:52:36,097 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 71 predicate places. [2025-04-14 00:52:36,097 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 172 transitions, 1548 flow [2025-04-14 00:52:36,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:52:36,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:36,097 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:36,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:52:36,301 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,SelfDestructingSolverStorable8 [2025-04-14 00:52:36,301 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 1 more)] === [2025-04-14 00:52:36,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1534019122, now seen corresponding path program 1 times [2025-04-14 00:52:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:36,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039777385] [2025-04-14 00:52:36,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:36,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-14 00:52:36,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:36,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:36,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:52:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:36,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039777385] [2025-04-14 00:52:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039777385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:52:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178741085] [2025-04-14 00:52:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:36,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:52:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:36,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:52:36,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:52:36,556 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:36,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 172 transitions, 1548 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:36,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:36,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:36,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:37,643 INFO L116 PetriNetUnfolderBase]: 4098/5839 cut-off events. [2025-04-14 00:52:37,644 INFO L117 PetriNetUnfolderBase]: For 59480/59494 co-relation queries the response was YES. [2025-04-14 00:52:37,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34254 conditions, 5839 events. 4098/5839 cut-off events. For 59480/59494 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 26030 event pairs, 374 based on Foata normal form. 11/5312 useless extension candidates. Maximal degree in co-relation 34200. Up to 3190 conditions per place. [2025-04-14 00:52:37,668 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 257 selfloop transitions, 95 changer transitions 71/424 dead transitions. [2025-04-14 00:52:37,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 424 transitions, 4769 flow [2025-04-14 00:52:37,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:52:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:52:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 358 transitions. [2025-04-14 00:52:37,670 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2651851851851852 [2025-04-14 00:52:37,670 INFO L175 Difference]: Start difference. First operand has 122 places, 172 transitions, 1548 flow. Second operand 25 states and 358 transitions. [2025-04-14 00:52:37,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 424 transitions, 4769 flow [2025-04-14 00:52:37,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 424 transitions, 4733 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:52:37,793 INFO L231 Difference]: Finished difference. Result has 158 places, 245 transitions, 2852 flow [2025-04-14 00:52:37,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2852, PETRI_PLACES=158, PETRI_TRANSITIONS=245} [2025-04-14 00:52:37,793 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 107 predicate places. [2025-04-14 00:52:37,794 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 245 transitions, 2852 flow [2025-04-14 00:52:37,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:37,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:37,794 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:37,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:52:37,794 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 1 more)] === [2025-04-14 00:52:37,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash 965050220, now seen corresponding path program 2 times [2025-04-14 00:52:37,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:37,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164569937] [2025-04-14 00:52:37,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:37,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:37,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-14 00:52:37,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:37,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:52:37,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:52:38,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:38,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164569937] [2025-04-14 00:52:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164569937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:38,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 00:52:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277123815] [2025-04-14 00:52:38,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:38,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:52:38,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:38,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:52:38,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:52:38,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:38,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 245 transitions, 2852 flow. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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:52:38,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:38,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:38,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:39,442 INFO L116 PetriNetUnfolderBase]: 4660/6590 cut-off events. [2025-04-14 00:52:39,443 INFO L117 PetriNetUnfolderBase]: For 114988/115000 co-relation queries the response was YES. [2025-04-14 00:52:39,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43711 conditions, 6590 events. 4660/6590 cut-off events. For 114988/115000 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 29433 event pairs, 317 based on Foata normal form. 10/6348 useless extension candidates. Maximal degree in co-relation 43656. Up to 3609 conditions per place. [2025-04-14 00:52:39,487 INFO L140 encePairwiseOnDemand]: 32/54 looper letters, 329 selfloop transitions, 148 changer transitions 58/536 dead transitions. [2025-04-14 00:52:39,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 536 transitions, 6728 flow [2025-04-14 00:52:39,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 00:52:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 00:52:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 410 transitions. [2025-04-14 00:52:39,489 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27116402116402116 [2025-04-14 00:52:39,489 INFO L175 Difference]: Start difference. First operand has 158 places, 245 transitions, 2852 flow. Second operand 28 states and 410 transitions. [2025-04-14 00:52:39,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 536 transitions, 6728 flow [2025-04-14 00:52:39,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 536 transitions, 6468 flow, removed 122 selfloop flow, removed 7 redundant places. [2025-04-14 00:52:39,725 INFO L231 Difference]: Finished difference. Result has 185 places, 328 transitions, 4250 flow [2025-04-14 00:52:39,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4250, PETRI_PLACES=185, PETRI_TRANSITIONS=328} [2025-04-14 00:52:39,726 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 134 predicate places. [2025-04-14 00:52:39,726 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 328 transitions, 4250 flow [2025-04-14 00:52:39,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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:52:39,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:39,726 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:39,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:52:39,726 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 1 more)] === [2025-04-14 00:52:39,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1929632778, now seen corresponding path program 3 times [2025-04-14 00:52:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:39,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515990150] [2025-04-14 00:52:39,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:52:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:39,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 2 equivalence classes. [2025-04-14 00:52:39,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:39,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:52:39,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:52:39,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:39,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515990150] [2025-04-14 00:52:39,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515990150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:39,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:39,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:52:39,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379661669] [2025-04-14 00:52:39,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:39,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:52:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:39,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:52:39,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:52:39,901 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:39,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 328 transitions, 4250 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:39,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:39,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:39,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:41,303 INFO L116 PetriNetUnfolderBase]: 5009/7117 cut-off events. [2025-04-14 00:52:41,303 INFO L117 PetriNetUnfolderBase]: For 160444/160455 co-relation queries the response was YES. [2025-04-14 00:52:41,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55177 conditions, 7117 events. 5009/7117 cut-off events. For 160444/160455 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 32925 event pairs, 435 based on Foata normal form. 8/6927 useless extension candidates. Maximal degree in co-relation 55110. Up to 3593 conditions per place. [2025-04-14 00:52:41,349 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 317 selfloop transitions, 146 changer transitions 75/539 dead transitions. [2025-04-14 00:52:41,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 539 transitions, 8172 flow [2025-04-14 00:52:41,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:52:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:52:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 347 transitions. [2025-04-14 00:52:41,350 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25703703703703706 [2025-04-14 00:52:41,351 INFO L175 Difference]: Start difference. First operand has 185 places, 328 transitions, 4250 flow. Second operand 25 states and 347 transitions. [2025-04-14 00:52:41,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 539 transitions, 8172 flow [2025-04-14 00:52:41,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 539 transitions, 7777 flow, removed 182 selfloop flow, removed 6 redundant places. [2025-04-14 00:52:41,671 INFO L231 Difference]: Finished difference. Result has 210 places, 363 transitions, 5093 flow [2025-04-14 00:52:41,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4027, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5093, PETRI_PLACES=210, PETRI_TRANSITIONS=363} [2025-04-14 00:52:41,672 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 159 predicate places. [2025-04-14 00:52:41,672 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 363 transitions, 5093 flow [2025-04-14 00:52:41,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:41,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:41,672 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:41,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:52:41,672 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 1 more)] === [2025-04-14 00:52:41,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:41,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1232375760, now seen corresponding path program 4 times [2025-04-14 00:52:41,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:41,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170247105] [2025-04-14 00:52:41,673 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:52:41,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:41,678 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-14 00:52:41,684 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:41,685 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:52:41,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:52:41,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:41,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170247105] [2025-04-14 00:52:41,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170247105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:41,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:41,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-14 00:52:41,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200271959] [2025-04-14 00:52:41,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:41,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:52:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:41,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:52:41,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:52:41,903 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:41,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 363 transitions, 5093 flow. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 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:52:41,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:41,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:41,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:43,533 INFO L116 PetriNetUnfolderBase]: 5643/7926 cut-off events. [2025-04-14 00:52:43,533 INFO L117 PetriNetUnfolderBase]: For 205813/205824 co-relation queries the response was YES. [2025-04-14 00:52:43,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62676 conditions, 7926 events. 5643/7926 cut-off events. For 205813/205824 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 36097 event pairs, 423 based on Foata normal form. 9/7564 useless extension candidates. Maximal degree in co-relation 62601. Up to 3759 conditions per place. [2025-04-14 00:52:43,605 INFO L140 encePairwiseOnDemand]: 35/54 looper letters, 330 selfloop transitions, 198 changer transitions 57/586 dead transitions. [2025-04-14 00:52:43,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 586 transitions, 8676 flow [2025-04-14 00:52:43,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:52:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:52:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 370 transitions. [2025-04-14 00:52:43,607 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2854938271604938 [2025-04-14 00:52:43,608 INFO L175 Difference]: Start difference. First operand has 210 places, 363 transitions, 5093 flow. Second operand 24 states and 370 transitions. [2025-04-14 00:52:43,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 586 transitions, 8676 flow [2025-04-14 00:52:44,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 586 transitions, 8351 flow, removed 98 selfloop flow, removed 13 redundant places. [2025-04-14 00:52:44,095 INFO L231 Difference]: Finished difference. Result has 225 places, 407 transitions, 6040 flow [2025-04-14 00:52:44,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4847, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6040, PETRI_PLACES=225, PETRI_TRANSITIONS=407} [2025-04-14 00:52:44,096 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 174 predicate places. [2025-04-14 00:52:44,096 INFO L485 AbstractCegarLoop]: Abstraction has has 225 places, 407 transitions, 6040 flow [2025-04-14 00:52:44,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 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:52:44,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:44,097 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:44,097 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:52:44,097 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 1 more)] === [2025-04-14 00:52:44,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1916722766, now seen corresponding path program 5 times [2025-04-14 00:52:44,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:44,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723266137] [2025-04-14 00:52:44,098 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:52:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:44,104 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-14 00:52:44,113 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:44,113 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:52:44,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 00:52:44,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:44,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723266137] [2025-04-14 00:52:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723266137] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:52:44,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576689811] [2025-04-14 00:52:44,304 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:52:44,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:52:44,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:44,307 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:52:44,308 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:52:44,352 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-14 00:52:44,376 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:44,376 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:52:44,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:44,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 00:52:44,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:52:44,563 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:52:44,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2025-04-14 00:52:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:52:44,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:52:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576689811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:52:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-04-14 00:52:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227628161] [2025-04-14 00:52:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:44,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:52:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:44,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:52:44,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:52:44,625 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:44,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 407 transitions, 6040 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:44,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:44,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:44,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:46,333 INFO L116 PetriNetUnfolderBase]: 6544/9261 cut-off events. [2025-04-14 00:52:46,334 INFO L117 PetriNetUnfolderBase]: For 250640/250651 co-relation queries the response was YES. [2025-04-14 00:52:46,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79276 conditions, 9261 events. 6544/9261 cut-off events. For 250640/250651 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 44232 event pairs, 617 based on Foata normal form. 9/8887 useless extension candidates. Maximal degree in co-relation 79191. Up to 3375 conditions per place. [2025-04-14 00:52:46,398 INFO L140 encePairwiseOnDemand]: 40/54 looper letters, 385 selfloop transitions, 148 changer transitions 97/631 dead transitions. [2025-04-14 00:52:46,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 631 transitions, 10522 flow [2025-04-14 00:52:46,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:52:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:52:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 293 transitions. [2025-04-14 00:52:46,399 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2855750487329435 [2025-04-14 00:52:46,399 INFO L175 Difference]: Start difference. First operand has 225 places, 407 transitions, 6040 flow. Second operand 19 states and 293 transitions. [2025-04-14 00:52:46,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 631 transitions, 10522 flow [2025-04-14 00:52:47,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 631 transitions, 10265 flow, removed 89 selfloop flow, removed 10 redundant places. [2025-04-14 00:52:47,122 INFO L231 Difference]: Finished difference. Result has 240 places, 432 transitions, 6718 flow [2025-04-14 00:52:47,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=5884, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6718, PETRI_PLACES=240, PETRI_TRANSITIONS=432} [2025-04-14 00:52:47,123 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 189 predicate places. [2025-04-14 00:52:47,123 INFO L485 AbstractCegarLoop]: Abstraction has has 240 places, 432 transitions, 6718 flow [2025-04-14 00:52:47,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:47,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:47,123 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:47,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:52:47,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:52:47,324 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 1 more)] === [2025-04-14 00:52:47,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1747403698, now seen corresponding path program 6 times [2025-04-14 00:52:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:47,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607911266] [2025-04-14 00:52:47,325 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:52:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:47,330 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 46 statements into 2 equivalence classes. [2025-04-14 00:52:47,341 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:47,341 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:52:47,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:52:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:47,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607911266] [2025-04-14 00:52:47,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607911266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:47,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:47,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:52:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67620313] [2025-04-14 00:52:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:47,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:52:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:47,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:52:47,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:52:47,569 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:47,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 432 transitions, 6718 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:47,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:47,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:47,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:49,879 INFO L116 PetriNetUnfolderBase]: 8769/12303 cut-off events. [2025-04-14 00:52:49,879 INFO L117 PetriNetUnfolderBase]: For 342778/342780 co-relation queries the response was YES. [2025-04-14 00:52:49,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107513 conditions, 12303 events. 8769/12303 cut-off events. For 342778/342780 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 61144 event pairs, 534 based on Foata normal form. 3/11841 useless extension candidates. Maximal degree in co-relation 107420. Up to 4549 conditions per place. [2025-04-14 00:52:49,994 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 479 selfloop transitions, 277 changer transitions 92/849 dead transitions. [2025-04-14 00:52:49,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 849 transitions, 14641 flow [2025-04-14 00:52:49,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 00:52:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 00:52:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 422 transitions. [2025-04-14 00:52:49,996 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125925925925926 [2025-04-14 00:52:49,996 INFO L175 Difference]: Start difference. First operand has 240 places, 432 transitions, 6718 flow. Second operand 25 states and 422 transitions. [2025-04-14 00:52:49,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 849 transitions, 14641 flow [2025-04-14 00:52:51,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 849 transitions, 14320 flow, removed 128 selfloop flow, removed 9 redundant places. [2025-04-14 00:52:51,205 INFO L231 Difference]: Finished difference. Result has 266 places, 555 transitions, 9612 flow [2025-04-14 00:52:51,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=6504, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=9612, PETRI_PLACES=266, PETRI_TRANSITIONS=555} [2025-04-14 00:52:51,206 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 215 predicate places. [2025-04-14 00:52:51,206 INFO L485 AbstractCegarLoop]: Abstraction has has 266 places, 555 transitions, 9612 flow [2025-04-14 00:52:51,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:51,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:51,206 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:51,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:52:51,207 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 1 more)] === [2025-04-14 00:52:51,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1991626920, now seen corresponding path program 7 times [2025-04-14 00:52:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:51,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326724832] [2025-04-14 00:52:51,207 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:52:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:51,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-14 00:52:51,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:51,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:51,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:52:51,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:51,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326724832] [2025-04-14 00:52:51,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326724832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:51,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:51,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:52:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021658308] [2025-04-14 00:52:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:51,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:52:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:51,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:52:51,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:52:51,398 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:51,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 555 transitions, 9612 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:51,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:51,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:51,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:54,335 INFO L116 PetriNetUnfolderBase]: 10007/13931 cut-off events. [2025-04-14 00:52:54,335 INFO L117 PetriNetUnfolderBase]: For 527471/527482 co-relation queries the response was YES. [2025-04-14 00:52:54,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137702 conditions, 13931 events. 10007/13931 cut-off events. For 527471/527482 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 69687 event pairs, 282 based on Foata normal form. 6/13466 useless extension candidates. Maximal degree in co-relation 137598. Up to 5349 conditions per place. [2025-04-14 00:52:54,508 INFO L140 encePairwiseOnDemand]: 38/54 looper letters, 374 selfloop transitions, 478 changer transitions 110/963 dead transitions. [2025-04-14 00:52:54,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 963 transitions, 18686 flow [2025-04-14 00:52:54,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 00:52:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-14 00:52:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 498 transitions. [2025-04-14 00:52:54,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25617283950617287 [2025-04-14 00:52:54,509 INFO L175 Difference]: Start difference. First operand has 266 places, 555 transitions, 9612 flow. Second operand 36 states and 498 transitions. [2025-04-14 00:52:54,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 963 transitions, 18686 flow [2025-04-14 00:52:56,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 963 transitions, 18078 flow, removed 281 selfloop flow, removed 8 redundant places. [2025-04-14 00:52:56,539 INFO L231 Difference]: Finished difference. Result has 304 places, 663 transitions, 13163 flow [2025-04-14 00:52:56,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=9268, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=13163, PETRI_PLACES=304, PETRI_TRANSITIONS=663} [2025-04-14 00:52:56,539 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 253 predicate places. [2025-04-14 00:52:56,539 INFO L485 AbstractCegarLoop]: Abstraction has has 304 places, 663 transitions, 13163 flow [2025-04-14 00:52:56,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:56,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:56,540 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:56,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:52:56,540 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 1 more)] === [2025-04-14 00:52:56,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1349932964, now seen corresponding path program 8 times [2025-04-14 00:52:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:56,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014531914] [2025-04-14 00:52:56,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:56,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:56,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-14 00:52:56,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:56,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:52:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 00:52:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:56,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014531914] [2025-04-14 00:52:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014531914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:52:56,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979363236] [2025-04-14 00:52:56,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:56,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:52:56,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:56,751 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:52:56,752 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:52:56,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-14 00:52:56,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-14 00:52:56,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:52:56,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:56,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 00:52:56,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:52:56,975 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:52:56,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2025-04-14 00:52:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-14 00:52:57,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:52:57,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979363236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:57,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:52:57,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2025-04-14 00:52:57,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110474638] [2025-04-14 00:52:57,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:57,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:52:57,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:57,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:52:57,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-04-14 00:52:57,020 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:52:57,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 663 transitions, 13163 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:52:57,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:57,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:52:57,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:00,890 INFO L116 PetriNetUnfolderBase]: 11502/15963 cut-off events. [2025-04-14 00:53:00,890 INFO L117 PetriNetUnfolderBase]: For 726191/726201 co-relation queries the response was YES. [2025-04-14 00:53:00,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168942 conditions, 15963 events. 11502/15963 cut-off events. For 726191/726201 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 80363 event pairs, 415 based on Foata normal form. 7/15346 useless extension candidates. Maximal degree in co-relation 168826. Up to 6070 conditions per place. [2025-04-14 00:53:01,084 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 601 selfloop transitions, 297 changer transitions 136/1035 dead transitions. [2025-04-14 00:53:01,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 1035 transitions, 22455 flow [2025-04-14 00:53:01,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 00:53:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 00:53:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 323 transitions. [2025-04-14 00:53:01,086 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26006441223832527 [2025-04-14 00:53:01,086 INFO L175 Difference]: Start difference. First operand has 304 places, 663 transitions, 13163 flow. Second operand 23 states and 323 transitions. [2025-04-14 00:53:01,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 1035 transitions, 22455 flow [2025-04-14 00:53:04,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 1035 transitions, 21446 flow, removed 344 selfloop flow, removed 20 redundant places. [2025-04-14 00:53:04,648 INFO L231 Difference]: Finished difference. Result has 304 places, 708 transitions, 14301 flow [2025-04-14 00:53:04,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=12413, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=14301, PETRI_PLACES=304, PETRI_TRANSITIONS=708} [2025-04-14 00:53:04,649 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 253 predicate places. [2025-04-14 00:53:04,649 INFO L485 AbstractCegarLoop]: Abstraction has has 304 places, 708 transitions, 14301 flow [2025-04-14 00:53:04,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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:53:04,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:04,649 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:04,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:53:04,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 00:53:04,850 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 1 more)] === [2025-04-14 00:53:04,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1306523259, now seen corresponding path program 1 times [2025-04-14 00:53:04,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:04,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746065713] [2025-04-14 00:53:04,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:04,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 00:53:04,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 00:53:04,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:04,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:53:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:05,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746065713] [2025-04-14 00:53:05,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746065713] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:05,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250273194] [2025-04-14 00:53:05,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:05,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:05,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:05,272 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:53:05,273 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:53:05,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 00:53:05,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 00:53:05,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:05,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:05,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 00:53:05,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:05,383 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 00:53:05,489 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:53:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:53:05,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 00:53:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250273194] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:05,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:05,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 8] total 26 [2025-04-14 00:53:05,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857996980] [2025-04-14 00:53:05,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:05,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 00:53:05,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:05,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 00:53:05,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-04-14 00:53:05,678 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:53:05,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 708 transitions, 14301 flow. Second operand has 27 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 27 states have internal predecessors, (209), 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:53:05,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:05,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:53:05,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:16,684 INFO L116 PetriNetUnfolderBase]: 27402/37674 cut-off events. [2025-04-14 00:53:16,684 INFO L117 PetriNetUnfolderBase]: For 1640417/1640427 co-relation queries the response was YES. [2025-04-14 00:53:17,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406005 conditions, 37674 events. 27402/37674 cut-off events. For 1640417/1640427 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 211475 event pairs, 585 based on Foata normal form. 12/35576 useless extension candidates. Maximal degree in co-relation 405861. Up to 13893 conditions per place. [2025-04-14 00:53:17,333 INFO L140 encePairwiseOnDemand]: 32/54 looper letters, 1103 selfloop transitions, 1244 changer transitions 344/2692 dead transitions. [2025-04-14 00:53:17,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 2692 transitions, 57054 flow [2025-04-14 00:53:17,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2025-04-14 00:53:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2025-04-14 00:53:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 1616 transitions. [2025-04-14 00:53:17,337 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2394074074074074 [2025-04-14 00:53:17,337 INFO L175 Difference]: Start difference. First operand has 304 places, 708 transitions, 14301 flow. Second operand 125 states and 1616 transitions. [2025-04-14 00:53:17,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 2692 transitions, 57054 flow [2025-04-14 00:53:29,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 2692 transitions, 55998 flow, removed 407 selfloop flow, removed 14 redundant places. [2025-04-14 00:53:29,654 INFO L231 Difference]: Finished difference. Result has 478 places, 1671 transitions, 38678 flow [2025-04-14 00:53:29,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=14056, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=125, PETRI_FLOW=38678, PETRI_PLACES=478, PETRI_TRANSITIONS=1671} [2025-04-14 00:53:29,655 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 427 predicate places. [2025-04-14 00:53:29,655 INFO L485 AbstractCegarLoop]: Abstraction has has 478 places, 1671 transitions, 38678 flow [2025-04-14 00:53:29,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 27 states have internal predecessors, (209), 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:53:29,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:29,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:29,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 00:53:29,855 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,SelfDestructingSolverStorable17 [2025-04-14 00:53:29,856 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 1 more)] === [2025-04-14 00:53:29,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1994522591, now seen corresponding path program 2 times [2025-04-14 00:53:29,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:29,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023850552] [2025-04-14 00:53:29,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:29,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:29,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-14 00:53:29,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 00:53:29,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:53:29,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:53:30,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:30,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023850552] [2025-04-14 00:53:30,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023850552] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:30,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145312231] [2025-04-14 00:53:30,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:30,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:30,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:30,163 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:53:30,167 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:53:30,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-14 00:53:30,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 00:53:30,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:53:30,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:30,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:53:30,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:30,525 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:53:30,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 37 [2025-04-14 00:53:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:53:30,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 00:53:30,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145312231] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:30,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:53:30,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 11] total 29 [2025-04-14 00:53:30,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892362365] [2025-04-14 00:53:30,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:30,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:53:30,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:30,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:53:30,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-04-14 00:53:30,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:53:30,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1671 transitions, 38678 flow. Second operand has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 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:53:30,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:30,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:53:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:57,790 INFO L116 PetriNetUnfolderBase]: 50910/69926 cut-off events. [2025-04-14 00:53:57,790 INFO L117 PetriNetUnfolderBase]: For 4709904/4709912 co-relation queries the response was YES. [2025-04-14 00:53:59,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956089 conditions, 69926 events. 50910/69926 cut-off events. For 4709904/4709912 co-relation queries the response was YES. Maximal size of possible extension queue 2444. Compared 417683 event pairs, 2525 based on Foata normal form. 23/65793 useless extension candidates. Maximal degree in co-relation 955876. Up to 35324 conditions per place. [2025-04-14 00:54:00,247 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 2742 selfloop transitions, 827 changer transitions 554/4124 dead transitions. [2025-04-14 00:54:00,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 4124 transitions, 108993 flow [2025-04-14 00:54:00,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 00:54:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 00:54:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 444 transitions. [2025-04-14 00:54:00,249 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2740740740740741 [2025-04-14 00:54:00,250 INFO L175 Difference]: Start difference. First operand has 478 places, 1671 transitions, 38678 flow. Second operand 30 states and 444 transitions. [2025-04-14 00:54:00,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 4124 transitions, 108993 flow [2025-04-14 00:56:29,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 4124 transitions, 90821 flow, removed 8981 selfloop flow, removed 32 redundant places. [2025-04-14 00:56:29,887 INFO L231 Difference]: Finished difference. Result has 466 places, 2455 transitions, 56204 flow [2025-04-14 00:56:29,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=34965, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=56204, PETRI_PLACES=466, PETRI_TRANSITIONS=2455} [2025-04-14 00:56:29,889 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 415 predicate places. [2025-04-14 00:56:29,889 INFO L485 AbstractCegarLoop]: Abstraction has has 466 places, 2455 transitions, 56204 flow [2025-04-14 00:56:29,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 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:29,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:29,890 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:56:29,898 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:30,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:30,090 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 1 more)] === [2025-04-14 00:56:30,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:30,091 INFO L85 PathProgramCache]: Analyzing trace with hash 879578981, now seen corresponding path program 3 times [2025-04-14 00:56:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:30,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499803793] [2025-04-14 00:56:30,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:56:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:30,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 2 equivalence classes. [2025-04-14 00:56:30,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 00:56:30,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:56:30,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:56:30,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:30,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499803793] [2025-04-14 00:56:30,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499803793] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:30,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958262952] [2025-04-14 00:56:30,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:56:30,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:30,330 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:30,332 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:30,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 2 equivalence classes. [2025-04-14 00:56:30,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 00:56:30,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:56:30,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:30,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:56:30,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:56:30,613 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:56:30,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 37 [2025-04-14 00:56:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 00:56:30,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:56:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 00:56:31,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958262952] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:31,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:56:31,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 11] total 28 [2025-04-14 00:56:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091034117] [2025-04-14 00:56:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:31,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:56:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:31,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:56:31,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:56:31,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 00:56:31,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 2455 transitions, 56204 flow. Second operand has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 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:31,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:31,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 00:56:31,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:14,560 INFO L116 PetriNetUnfolderBase]: 70790/96647 cut-off events. [2025-04-14 00:57:14,560 INFO L117 PetriNetUnfolderBase]: For 5816235/5816237 co-relation queries the response was YES. [2025-04-14 00:57:17,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220691 conditions, 96647 events. 70790/96647 cut-off events. For 5816235/5816237 co-relation queries the response was YES. Maximal size of possible extension queue 3367. Compared 598454 event pairs, 3240 based on Foata normal form. 27/90990 useless extension candidates. Maximal degree in co-relation 1220477. Up to 42327 conditions per place. [2025-04-14 00:57:17,971 INFO L140 encePairwiseOnDemand]: 37/54 looper letters, 2448 selfloop transitions, 1387 changer transitions 590/4426 dead transitions. [2025-04-14 00:57:17,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 4426 transitions, 107440 flow [2025-04-14 00:57:17,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:57:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:57:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 345 transitions. [2025-04-14 00:57:17,972 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30423280423280424 [2025-04-14 00:57:17,972 INFO L175 Difference]: Start difference. First operand has 466 places, 2455 transitions, 56204 flow. Second operand 21 states and 345 transitions. [2025-04-14 00:57:17,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 4426 transitions, 107440 flow [2025-04-14 01:00:33,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 4426 transitions, 104991 flow, removed 1220 selfloop flow, removed 8 redundant places. [2025-04-14 01:00:33,195 INFO L231 Difference]: Finished difference. Result has 485 places, 3190 transitions, 78012 flow [2025-04-14 01:00:33,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=55237, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=737, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=78012, PETRI_PLACES=485, PETRI_TRANSITIONS=3190} [2025-04-14 01:00:33,201 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 434 predicate places. [2025-04-14 01:00:33,201 INFO L485 AbstractCegarLoop]: Abstraction has has 485 places, 3190 transitions, 78012 flow [2025-04-14 01:00:33,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 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 01:00:33,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:33,202 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:33,209 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 01:00:33,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:00:33,404 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 1 more)] === [2025-04-14 01:00:33,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash -986471759, now seen corresponding path program 4 times [2025-04-14 01:00:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:33,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388688128] [2025-04-14 01:00:33,405 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:00:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:33,420 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-14 01:00:33,434 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 01:00:33,434 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:00:33,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:00:33,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:33,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388688128] [2025-04-14 01:00:33,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388688128] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:00:33,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717862471] [2025-04-14 01:00:33,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:00:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:00:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:00:33,864 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 01:00:33,865 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 01:00:33,921 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-04-14 01:00:33,945 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 01:00:33,946 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:00:33,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:33,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 01:00:33,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:00:34,031 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:00:34,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2025-04-14 01:00:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:00:34,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:00:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:00:34,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717862471] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:00:34,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:00:34,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 27 [2025-04-14 01:00:34,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107374588] [2025-04-14 01:00:34,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:00:34,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 01:00:34,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:00:34,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 01:00:34,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2025-04-14 01:00:34,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 54 [2025-04-14 01:00:34,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 3190 transitions, 78012 flow. Second operand has 28 states, 28 states have (on average 7.178571428571429) internal successors, (201), 28 states have internal predecessors, (201), 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 01:00:34,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:00:34,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 54 [2025-04-14 01:00:34,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand