/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:55:30,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:55:30,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:55:31,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:55:31,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:55:31,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:55:31,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:55:31,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:55:31,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:55:31,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:55:31,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:55:31,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:55:31,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:55:31,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:55:31,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:55:31,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:55:31,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:55:31,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:55:31,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:55:31,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:55:31,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:55:31,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:55:31,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:55:31,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:55:31,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:55:31,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:55:31,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:55:31,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:55:31,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:55:31,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:55:31,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:55:31,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:55:31,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:55:31,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:55:31,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:55:31,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:55:31,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:55:31,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:55:31,026 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:55:31,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:55:31,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:55:31,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:55:31,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:55:31,276 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:55:31,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-04-14 00:55:32,568 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd451dbcc/612a92e3d93d42849b69654211947d34/FLAG9071a1565 [2025-04-14 00:55:32,801 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:55:32,801 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-04-14 00:55:32,813 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd451dbcc/612a92e3d93d42849b69654211947d34/FLAG9071a1565 [2025-04-14 00:55:33,719 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd451dbcc/612a92e3d93d42849b69654211947d34 [2025-04-14 00:55:33,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:55:33,722 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:55:33,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:55:33,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:55:33,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:55:33,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:33,727 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:55:33, skipping insertion in model container [2025-04-14 00:55:33,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:33,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:55:33,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-04-14 00:55:33,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:55:33,939 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:55:33,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3822,3835] [2025-04-14 00:55:33,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:55:33,988 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:55:33,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33 WrapperNode [2025-04-14 00:55:33,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:55:33,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:55:33,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:55:33,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:55:33,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,028 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2025-04-14 00:55:34,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:55:34,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:55:34,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:55:34,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:55:34,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,057 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-14 00:55:34,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:55:34,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:55:34,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:55:34,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:55:34,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (1/1) ... [2025-04-14 00:55:34,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:55:34,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:34,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:55:34,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:55:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:55:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:55:34,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:55:34,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:55:34,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 00:55:34,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:55:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:55:34,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:55:34,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:55:34,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:55:34,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:55:34,124 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:55:34,213 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:55:34,215 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:55:34,529 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:55:34,529 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:55:34,530 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:55:34,813 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:55:34,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:55:34 BoogieIcfgContainer [2025-04-14 00:55:34,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:55:34,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:55:34,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:55:34,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:55:34,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:55:33" (1/3) ... [2025-04-14 00:55:34,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcb75bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:55:34, skipping insertion in model container [2025-04-14 00:55:34,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:55:33" (2/3) ... [2025-04-14 00:55:34,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcb75bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:55:34, skipping insertion in model container [2025-04-14 00:55:34,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:55:34" (3/3) ... [2025-04-14 00:55:34,822 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-04-14 00:55:34,832 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:55:34,833 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 44 locations, 43 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 00:55:34,834 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:55:34,897 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-04-14 00:55:34,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 144 flow [2025-04-14 00:55:34,955 INFO L116 PetriNetUnfolderBase]: 6/45 cut-off events. [2025-04-14 00:55:34,956 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:55:34,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 45 events. 6/45 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-04-14 00:55:34,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 52 transitions, 144 flow [2025-04-14 00:55:34,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 44 transitions, 118 flow [2025-04-14 00:55:34,971 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:55:34,981 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;@1827096, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:55:34,981 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-14 00:55:34,995 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:55:34,995 INFO L116 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-04-14 00:55:34,996 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:55:34,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:34,996 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] [2025-04-14 00:55:34,996 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:35,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash -939406146, now seen corresponding path program 1 times [2025-04-14 00:55:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:35,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918398942] [2025-04-14 00:55:35,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:35,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:35,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 00:55:35,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:55:35,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:35,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:35,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:35,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918398942] [2025-04-14 00:55:35,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918398942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:35,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:35,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:55:35,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986005271] [2025-04-14 00:55:35,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:35,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:55:35,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:35,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:55:35,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:55:35,354 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:35,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:35,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:35,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:35,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:36,692 INFO L116 PetriNetUnfolderBase]: 14118/18822 cut-off events. [2025-04-14 00:55:36,692 INFO L117 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2025-04-14 00:55:36,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39074 conditions, 18822 events. 14118/18822 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 98817 event pairs, 5976 based on Foata normal form. 1/15788 useless extension candidates. Maximal degree in co-relation 38950. Up to 8269 conditions per place. [2025-04-14 00:55:36,791 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 99 selfloop transitions, 6 changer transitions 1/109 dead transitions. [2025-04-14 00:55:36,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 508 flow [2025-04-14 00:55:36,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:55:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:55:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-04-14 00:55:36,803 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-14 00:55:36,804 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 118 flow. Second operand 4 states and 135 transitions. [2025-04-14 00:55:36,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 508 flow [2025-04-14 00:55:36,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 109 transitions, 456 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 00:55:36,828 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 139 flow [2025-04-14 00:55:36,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2025-04-14 00:55:36,833 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-04-14 00:55:36,833 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 139 flow [2025-04-14 00:55:36,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:36,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:36,833 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] [2025-04-14 00:55:36,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:55:36,834 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:36,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash 873528648, now seen corresponding path program 2 times [2025-04-14 00:55:36,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:36,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012792817] [2025-04-14 00:55:36,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:36,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:36,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-04-14 00:55:36,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:55:36,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:55:36,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:36,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012792817] [2025-04-14 00:55:36,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012792817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:36,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:36,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:55:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799747376] [2025-04-14 00:55:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:36,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:55:36,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:36,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:55:36,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:55:36,962 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:36,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:36,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:36,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:36,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:38,427 INFO L116 PetriNetUnfolderBase]: 21267/28515 cut-off events. [2025-04-14 00:55:38,428 INFO L117 PetriNetUnfolderBase]: For 3716/3718 co-relation queries the response was YES. [2025-04-14 00:55:38,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61988 conditions, 28515 events. 21267/28515 cut-off events. For 3716/3718 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 159805 event pairs, 7102 based on Foata normal form. 1/24262 useless extension candidates. Maximal degree in co-relation 25827. Up to 14786 conditions per place. [2025-04-14 00:55:38,533 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 99 selfloop transitions, 10 changer transitions 1/113 dead transitions. [2025-04-14 00:55:38,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 113 transitions, 521 flow [2025-04-14 00:55:38,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:55:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:55:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-14 00:55:38,537 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2025-04-14 00:55:38,538 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 139 flow. Second operand 4 states and 134 transitions. [2025-04-14 00:55:38,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 113 transitions, 521 flow [2025-04-14 00:55:38,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 113 transitions, 521 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:55:38,541 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 207 flow [2025-04-14 00:55:38,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2025-04-14 00:55:38,541 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-04-14 00:55:38,541 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 207 flow [2025-04-14 00:55:38,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:38,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:38,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] [2025-04-14 00:55:38,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:55:38,542 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:38,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:38,542 INFO L85 PathProgramCache]: Analyzing trace with hash 816316008, now seen corresponding path program 1 times [2025-04-14 00:55:38,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:38,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692465944] [2025-04-14 00:55:38,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:38,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:55:38,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:55:38,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:38,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:38,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692465944] [2025-04-14 00:55:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692465944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:55:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172941349] [2025-04-14 00:55:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:38,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:55:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:38,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:55:38,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:55:38,709 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:38,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:38,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:38,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:38,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:40,490 INFO L116 PetriNetUnfolderBase]: 32274/43527 cut-off events. [2025-04-14 00:55:40,490 INFO L117 PetriNetUnfolderBase]: For 16493/16501 co-relation queries the response was YES. [2025-04-14 00:55:40,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100881 conditions, 43527 events. 32274/43527 cut-off events. For 16493/16501 co-relation queries the response was YES. Maximal size of possible extension queue 1778. Compared 259950 event pairs, 20432 based on Foata normal form. 617/37608 useless extension candidates. Maximal degree in co-relation 56104. Up to 28402 conditions per place. [2025-04-14 00:55:40,676 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 117 selfloop transitions, 5 changer transitions 1/126 dead transitions. [2025-04-14 00:55:40,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 690 flow [2025-04-14 00:55:40,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:55:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:55:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-04-14 00:55:40,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-04-14 00:55:40,680 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 207 flow. Second operand 5 states and 141 transitions. [2025-04-14 00:55:40,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 126 transitions, 690 flow [2025-04-14 00:55:40,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 682 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-14 00:55:40,734 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 251 flow [2025-04-14 00:55:40,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-04-14 00:55:40,735 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-04-14 00:55:40,735 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 251 flow [2025-04-14 00:55:40,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:40,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:40,735 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] [2025-04-14 00:55:40,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:55:40,736 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:40,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash -569604245, now seen corresponding path program 1 times [2025-04-14 00:55:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:40,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50158860] [2025-04-14 00:55:40,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:40,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:40,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:55:40,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:55:40,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:40,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:40,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50158860] [2025-04-14 00:55:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50158860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:40,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:40,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:55:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269593791] [2025-04-14 00:55:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:40,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:55:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:40,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:55:40,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:55:40,880 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:40,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:40,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:40,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:40,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:42,399 INFO L116 PetriNetUnfolderBase]: 25204/34217 cut-off events. [2025-04-14 00:55:42,400 INFO L117 PetriNetUnfolderBase]: For 15406/15414 co-relation queries the response was YES. [2025-04-14 00:55:42,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79747 conditions, 34217 events. 25204/34217 cut-off events. For 15406/15414 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 198965 event pairs, 19436 based on Foata normal form. 554/29567 useless extension candidates. Maximal degree in co-relation 67427. Up to 28402 conditions per place. [2025-04-14 00:55:42,547 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 51 selfloop transitions, 2 changer transitions 41/97 dead transitions. [2025-04-14 00:55:42,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 538 flow [2025-04-14 00:55:42,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:55:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:55:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-04-14 00:55:42,549 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2025-04-14 00:55:42,549 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 251 flow. Second operand 5 states and 119 transitions. [2025-04-14 00:55:42,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 538 flow [2025-04-14 00:55:42,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 534 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:42,560 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 229 flow [2025-04-14 00:55:42,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-04-14 00:55:42,560 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-04-14 00:55:42,560 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 229 flow [2025-04-14 00:55:42,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:42,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:42,561 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] [2025-04-14 00:55:42,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:55:42,561 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:42,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash -461718250, now seen corresponding path program 1 times [2025-04-14 00:55:42,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:42,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440685302] [2025-04-14 00:55:42,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:42,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:55:42,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:55:42,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:42,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:42,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:42,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440685302] [2025-04-14 00:55:42,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440685302] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:42,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038960569] [2025-04-14 00:55:42,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:42,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:42,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:42,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:55:42,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:55:42,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:55:42,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:55:42,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:42,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:42,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:55:42,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:43,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:55:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:43,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038960569] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:55:43,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:55:43,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 00:55:43,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246948054] [2025-04-14 00:55:43,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:55:43,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:55:43,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:43,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:55:43,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:55:43,055 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:43,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 229 flow. Second operand has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:43,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:43,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:43,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:45,315 INFO L116 PetriNetUnfolderBase]: 32274/43510 cut-off events. [2025-04-14 00:55:45,315 INFO L117 PetriNetUnfolderBase]: For 23925/23933 co-relation queries the response was YES. [2025-04-14 00:55:45,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105257 conditions, 43510 events. 32274/43510 cut-off events. For 23925/23933 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 262581 event pairs, 15134 based on Foata normal form. 617/37591 useless extension candidates. Maximal degree in co-relation 105236. Up to 20010 conditions per place. [2025-04-14 00:55:45,504 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 149 selfloop transitions, 7 changer transitions 1/160 dead transitions. [2025-04-14 00:55:45,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 160 transitions, 927 flow [2025-04-14 00:55:45,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:55:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:55:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2025-04-14 00:55:45,505 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-14 00:55:45,505 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 229 flow. Second operand 7 states and 182 transitions. [2025-04-14 00:55:45,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 160 transitions, 927 flow [2025-04-14 00:55:45,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 160 transitions, 901 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-14 00:55:45,549 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 278 flow [2025-04-14 00:55:45,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-04-14 00:55:45,550 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2025-04-14 00:55:45,550 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 278 flow [2025-04-14 00:55:45,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:45,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:45,550 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] [2025-04-14 00:55:45,556 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:55:45,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:45,751 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:45,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1305762885, now seen corresponding path program 1 times [2025-04-14 00:55:45,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:45,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782897051] [2025-04-14 00:55:45,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:45,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:45,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:55:45,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:55:45,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:45,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:45,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:45,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782897051] [2025-04-14 00:55:45,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782897051] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:45,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991092037] [2025-04-14 00:55:45,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:45,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:45,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:45,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:55:45,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:55:45,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:55:45,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:55:45,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:45,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:45,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:55:45,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:46,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:55:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:46,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991092037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:55:46,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:55:46,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 00:55:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69108267] [2025-04-14 00:55:46,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:55:46,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:55:46,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:46,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:55:46,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:55:46,101 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:46,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 278 flow. Second operand has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:46,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:46,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:46,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:47,683 INFO L116 PetriNetUnfolderBase]: 24592/33606 cut-off events. [2025-04-14 00:55:47,683 INFO L117 PetriNetUnfolderBase]: For 18968/18976 co-relation queries the response was YES. [2025-04-14 00:55:47,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82242 conditions, 33606 events. 24592/33606 cut-off events. For 18968/18976 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 198589 event pairs, 10277 based on Foata normal form. 1166/29568 useless extension candidates. Maximal degree in co-relation 69623. Up to 14697 conditions per place. [2025-04-14 00:55:47,813 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 78 selfloop transitions, 5 changer transitions 43/129 dead transitions. [2025-04-14 00:55:47,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 129 transitions, 769 flow [2025-04-14 00:55:47,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:55:47,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:55:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-04-14 00:55:47,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41534391534391535 [2025-04-14 00:55:47,814 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 278 flow. Second operand 7 states and 157 transitions. [2025-04-14 00:55:47,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 129 transitions, 769 flow [2025-04-14 00:55:47,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 129 transitions, 761 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:47,828 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 272 flow [2025-04-14 00:55:47,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2025-04-14 00:55:47,829 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2025-04-14 00:55:47,829 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 272 flow [2025-04-14 00:55:47,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:47,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:47,829 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] [2025-04-14 00:55:47,836 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:55:48,034 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,SelfDestructingSolverStorable5 [2025-04-14 00:55:48,034 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:48,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1555944526, now seen corresponding path program 2 times [2025-04-14 00:55:48,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:48,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551803533] [2025-04-14 00:55:48,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:48,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:55:48,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:55:48,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:55:48,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:55:48,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:48,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551803533] [2025-04-14 00:55:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551803533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:48,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316628464] [2025-04-14 00:55:48,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:48,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:48,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:48,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:55:48,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:55:48,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:55:48,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:55:48,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:55:48,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:48,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:55:48,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:55:48,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:55:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:55:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316628464] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:48,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:55:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-14 00:55:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776533962] [2025-04-14 00:55:48,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:48,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:55:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:48,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:55:48,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:55:48,405 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:48,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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:55:48,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:48,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:48,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:49,586 INFO L116 PetriNetUnfolderBase]: 15939/21452 cut-off events. [2025-04-14 00:55:49,586 INFO L117 PetriNetUnfolderBase]: For 20233/20237 co-relation queries the response was YES. [2025-04-14 00:55:49,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59388 conditions, 21452 events. 15939/21452 cut-off events. For 20233/20237 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 114966 event pairs, 7405 based on Foata normal form. 562/18665 useless extension candidates. Maximal degree in co-relation 59348. Up to 17968 conditions per place. [2025-04-14 00:55:49,691 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 70 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2025-04-14 00:55:49,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 80 transitions, 508 flow [2025-04-14 00:55:49,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:55:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:55:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2025-04-14 00:55:49,692 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3271604938271605 [2025-04-14 00:55:49,692 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 272 flow. Second operand 6 states and 106 transitions. [2025-04-14 00:55:49,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 80 transitions, 508 flow [2025-04-14 00:55:49,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 80 transitions, 462 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-04-14 00:55:49,735 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 274 flow [2025-04-14 00:55:49,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-04-14 00:55:49,736 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2025-04-14 00:55:49,736 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 274 flow [2025-04-14 00:55:49,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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:55:49,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:49,736 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:55:49,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 00:55:49,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:49,937 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:49,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash 838245989, now seen corresponding path program 2 times [2025-04-14 00:55:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:49,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75953568] [2025-04-14 00:55:49,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:49,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:55:49,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-04-14 00:55:49,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:55:49,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:50,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75953568] [2025-04-14 00:55:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75953568] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:55:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853325277] [2025-04-14 00:55:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:50,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:55:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:50,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:55:50,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:55:50,025 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:50,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:50,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:50,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:50,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:51,168 INFO L116 PetriNetUnfolderBase]: 18564/24932 cut-off events. [2025-04-14 00:55:51,168 INFO L117 PetriNetUnfolderBase]: For 15292/15296 co-relation queries the response was YES. [2025-04-14 00:55:51,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66002 conditions, 24932 events. 18564/24932 cut-off events. For 15292/15296 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 134732 event pairs, 2111 based on Foata normal form. 287/21171 useless extension candidates. Maximal degree in co-relation 65967. Up to 17854 conditions per place. [2025-04-14 00:55:51,267 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 109 selfloop transitions, 7 changer transitions 1/120 dead transitions. [2025-04-14 00:55:51,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 120 transitions, 706 flow [2025-04-14 00:55:51,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:55:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:55:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-04-14 00:55:51,268 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2025-04-14 00:55:51,268 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 274 flow. Second operand 5 states and 131 transitions. [2025-04-14 00:55:51,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 120 transitions, 706 flow [2025-04-14 00:55:51,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 684 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-14 00:55:51,321 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 304 flow [2025-04-14 00:55:51,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2025-04-14 00:55:51,321 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2025-04-14 00:55:51,321 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 304 flow [2025-04-14 00:55:51,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:51,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:51,322 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] [2025-04-14 00:55:51,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:55:51,322 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:51,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:51,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2141763759, now seen corresponding path program 3 times [2025-04-14 00:55:51,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:51,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144285047] [2025-04-14 00:55:51,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:55:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:51,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:55:51,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 35 of 37 statements. [2025-04-14 00:55:51,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:55:51,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:51,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144285047] [2025-04-14 00:55:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144285047] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:51,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:55:51,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623537796] [2025-04-14 00:55:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:51,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:55:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:51,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:55:51,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:55:51,391 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:51,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:51,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:51,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:51,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:52,474 INFO L116 PetriNetUnfolderBase]: 18508/24876 cut-off events. [2025-04-14 00:55:52,474 INFO L117 PetriNetUnfolderBase]: For 21664/21668 co-relation queries the response was YES. [2025-04-14 00:55:52,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66955 conditions, 24876 events. 18508/24876 cut-off events. For 21664/21668 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 136131 event pairs, 7966 based on Foata normal form. 58/20898 useless extension candidates. Maximal degree in co-relation 66921. Up to 21395 conditions per place. [2025-04-14 00:55:52,615 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 86 selfloop transitions, 8 changer transitions 12/109 dead transitions. [2025-04-14 00:55:52,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 644 flow [2025-04-14 00:55:52,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:55:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:55:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-04-14 00:55:52,616 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45925925925925926 [2025-04-14 00:55:52,616 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 304 flow. Second operand 5 states and 124 transitions. [2025-04-14 00:55:52,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 644 flow [2025-04-14 00:55:52,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 109 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:55:52,647 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 338 flow [2025-04-14 00:55:52,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=338, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2025-04-14 00:55:52,647 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2025-04-14 00:55:52,647 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 338 flow [2025-04-14 00:55:52,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:52,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:52,648 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] [2025-04-14 00:55:52,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:55:52,648 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:52,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:52,648 INFO L85 PathProgramCache]: Analyzing trace with hash 954602911, now seen corresponding path program 4 times [2025-04-14 00:55:52,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:52,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827256117] [2025-04-14 00:55:52,648 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:55:52,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:52,654 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:55:52,656 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 37 statements. [2025-04-14 00:55:52,657 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:55:52,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:52,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:52,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827256117] [2025-04-14 00:55:52,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827256117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:52,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:52,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:55:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906402934] [2025-04-14 00:55:52,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:52,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:55:52,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:52,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:55:52,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:55:52,691 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:52,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 338 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:52,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:52,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:52,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:54,286 INFO L116 PetriNetUnfolderBase]: 22370/29956 cut-off events. [2025-04-14 00:55:54,286 INFO L117 PetriNetUnfolderBase]: For 27511/27515 co-relation queries the response was YES. [2025-04-14 00:55:54,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81622 conditions, 29956 events. 22370/29956 cut-off events. For 27511/27515 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 165283 event pairs, 5047 based on Foata normal form. 287/25011 useless extension candidates. Maximal degree in co-relation 81587. Up to 19765 conditions per place. [2025-04-14 00:55:54,390 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 119 selfloop transitions, 13 changer transitions 2/137 dead transitions. [2025-04-14 00:55:54,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 137 transitions, 852 flow [2025-04-14 00:55:54,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:55:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:55:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-04-14 00:55:54,391 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5148148148148148 [2025-04-14 00:55:54,391 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 338 flow. Second operand 5 states and 139 transitions. [2025-04-14 00:55:54,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 137 transitions, 852 flow [2025-04-14 00:55:54,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 137 transitions, 836 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:55:54,420 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 395 flow [2025-04-14 00:55:54,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-04-14 00:55:54,421 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2025-04-14 00:55:54,421 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 395 flow [2025-04-14 00:55:54,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:54,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:54,421 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] [2025-04-14 00:55:54,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:55:54,421 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:54,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:54,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1461943631, now seen corresponding path program 5 times [2025-04-14 00:55:54,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:54,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980663987] [2025-04-14 00:55:54,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:55:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:54,431 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:55:54,436 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:55:54,436 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:55:54,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:54,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980663987] [2025-04-14 00:55:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980663987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:54,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618238811] [2025-04-14 00:55:54,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:55:54,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:54,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:54,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:55:54,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:55:54,549 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-14 00:55:54,568 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:55:54,569 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:55:54,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:54,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:55:54,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:54,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:55:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:54,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618238811] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:54,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:55:54,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-14 00:55:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009475150] [2025-04-14 00:55:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:54,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:55:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:54,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:55:54,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:55:54,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:54,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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:55:54,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:54,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:54,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:55,760 INFO L116 PetriNetUnfolderBase]: 20320/27166 cut-off events. [2025-04-14 00:55:55,760 INFO L117 PetriNetUnfolderBase]: For 37095/37099 co-relation queries the response was YES. [2025-04-14 00:55:55,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77663 conditions, 27166 events. 20320/27166 cut-off events. For 37095/37099 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 147582 event pairs, 9517 based on Foata normal form. 341/22627 useless extension candidates. Maximal degree in co-relation 77626. Up to 13716 conditions per place. [2025-04-14 00:55:55,871 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 92 selfloop transitions, 12 changer transitions 1/108 dead transitions. [2025-04-14 00:55:55,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 108 transitions, 763 flow [2025-04-14 00:55:55,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:55:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:55:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-04-14 00:55:55,872 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3549382716049383 [2025-04-14 00:55:55,872 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 395 flow. Second operand 6 states and 115 transitions. [2025-04-14 00:55:55,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 108 transitions, 763 flow [2025-04-14 00:55:55,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 108 transitions, 758 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:55,928 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 436 flow [2025-04-14 00:55:55,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2025-04-14 00:55:55,928 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2025-04-14 00:55:55,928 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 436 flow [2025-04-14 00:55:55,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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:55:55,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:55,928 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] [2025-04-14 00:55:55,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 00:55:56,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:56,129 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:56,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1612873660, now seen corresponding path program 1 times [2025-04-14 00:55:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:56,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994241380] [2025-04-14 00:55:56,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:56,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:56,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:55:56,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:55:56,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:56,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:56,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994241380] [2025-04-14 00:55:56,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994241380] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:55:56,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853290206] [2025-04-14 00:55:56,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:55:56,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:55:56,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:55:56,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:55:56,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:55:56,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:55:56,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:55:56,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:55:56,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:56,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:55:56,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:55:56,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:55:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:55:56,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:55:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853290206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:56,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:55:56,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-14 00:55:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709320823] [2025-04-14 00:55:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:56,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:55:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:56,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:55:56,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:55:56,820 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:55:56,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 436 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:56,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:56,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:55:56,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:58,965 INFO L116 PetriNetUnfolderBase]: 30889/41408 cut-off events. [2025-04-14 00:55:58,965 INFO L117 PetriNetUnfolderBase]: For 64653/64657 co-relation queries the response was YES. [2025-04-14 00:55:59,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121991 conditions, 41408 events. 30889/41408 cut-off events. For 64653/64657 co-relation queries the response was YES. Maximal size of possible extension queue 1433. Compared 238754 event pairs, 8814 based on Foata normal form. 1/34361 useless extension candidates. Maximal degree in co-relation 121950. Up to 12690 conditions per place. [2025-04-14 00:55:59,270 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 248 selfloop transitions, 30 changer transitions 3/284 dead transitions. [2025-04-14 00:55:59,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 284 transitions, 1833 flow [2025-04-14 00:55:59,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:55:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:55:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 310 transitions. [2025-04-14 00:55:59,272 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-04-14 00:55:59,272 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 436 flow. Second operand 10 states and 310 transitions. [2025-04-14 00:55:59,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 284 transitions, 1833 flow [2025-04-14 00:55:59,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 284 transitions, 1757 flow, removed 30 selfloop flow, removed 4 redundant places. [2025-04-14 00:55:59,684 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 608 flow [2025-04-14 00:55:59,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=608, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-04-14 00:55:59,685 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 39 predicate places. [2025-04-14 00:55:59,685 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 608 flow [2025-04-14 00:55:59,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:59,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:59,685 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] [2025-04-14 00:55:59,691 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:55:59,890 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,SelfDestructingSolverStorable11 [2025-04-14 00:55:59,890 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:55:59,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:59,890 INFO L85 PathProgramCache]: Analyzing trace with hash -99381348, now seen corresponding path program 2 times [2025-04-14 00:55:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:59,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851139977] [2025-04-14 00:55:59,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:59,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:55:59,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:55:59,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:55:59,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:00,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851139977] [2025-04-14 00:56:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851139977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:00,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:00,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:56:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875061618] [2025-04-14 00:56:00,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:00,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:56:00,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:00,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:56:00,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:56:00,138 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:56:00,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 608 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:00,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:00,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:56:00,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:02,530 INFO L116 PetriNetUnfolderBase]: 34882/46821 cut-off events. [2025-04-14 00:56:02,531 INFO L117 PetriNetUnfolderBase]: For 76049/76053 co-relation queries the response was YES. [2025-04-14 00:56:02,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139073 conditions, 46821 events. 34882/46821 cut-off events. For 76049/76053 co-relation queries the response was YES. Maximal size of possible extension queue 1606. Compared 274339 event pairs, 14777 based on Foata normal form. 3/39065 useless extension candidates. Maximal degree in co-relation 139031. Up to 36836 conditions per place. [2025-04-14 00:56:02,845 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 171 selfloop transitions, 27 changer transitions 2/203 dead transitions. [2025-04-14 00:56:02,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 203 transitions, 1455 flow [2025-04-14 00:56:02,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:56:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:56:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2025-04-14 00:56:02,846 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4837962962962963 [2025-04-14 00:56:02,846 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 608 flow. Second operand 8 states and 209 transitions. [2025-04-14 00:56:02,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 203 transitions, 1455 flow [2025-04-14 00:56:03,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 203 transitions, 1369 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-04-14 00:56:03,013 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 733 flow [2025-04-14 00:56:03,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=733, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-04-14 00:56:03,014 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2025-04-14 00:56:03,014 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 733 flow [2025-04-14 00:56:03,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:03,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:03,014 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] [2025-04-14 00:56:03,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:56:03,015 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:56:03,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1593448312, now seen corresponding path program 3 times [2025-04-14 00:56:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:03,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093878223] [2025-04-14 00:56:03,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:56:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:03,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:56:03,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:56:03,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:56:03,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:03,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:03,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093878223] [2025-04-14 00:56:03,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093878223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:03,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:03,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:56:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795524560] [2025-04-14 00:56:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:03,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:56:03,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:03,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:56:03,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:56:03,389 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:56:03,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 733 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:03,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:03,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:56:03,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:06,568 INFO L116 PetriNetUnfolderBase]: 39685/53325 cut-off events. [2025-04-14 00:56:06,569 INFO L117 PetriNetUnfolderBase]: For 82103/82107 co-relation queries the response was YES. [2025-04-14 00:56:06,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160084 conditions, 53325 events. 39685/53325 cut-off events. For 82103/82107 co-relation queries the response was YES. Maximal size of possible extension queue 1886. Compared 320308 event pairs, 15906 based on Foata normal form. 3/44599 useless extension candidates. Maximal degree in co-relation 160040. Up to 41847 conditions per place. [2025-04-14 00:56:06,893 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 198 selfloop transitions, 33 changer transitions 4/238 dead transitions. [2025-04-14 00:56:06,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 238 transitions, 1688 flow [2025-04-14 00:56:06,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:56:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:56:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2025-04-14 00:56:06,895 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2025-04-14 00:56:06,895 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 733 flow. Second operand 9 states and 240 transitions. [2025-04-14 00:56:06,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 238 transitions, 1688 flow [2025-04-14 00:56:07,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 238 transitions, 1654 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-04-14 00:56:07,212 INFO L231 Difference]: Finished difference. Result has 105 places, 114 transitions, 913 flow [2025-04-14 00:56:07,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=913, PETRI_PLACES=105, PETRI_TRANSITIONS=114} [2025-04-14 00:56:07,213 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2025-04-14 00:56:07,213 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 114 transitions, 913 flow [2025-04-14 00:56:07,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:07,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:07,213 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] [2025-04-14 00:56:07,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:56:07,213 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:56:07,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:07,214 INFO L85 PathProgramCache]: Analyzing trace with hash -331103058, now seen corresponding path program 1 times [2025-04-14 00:56:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:07,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935729016] [2025-04-14 00:56:07,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:07,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:56:07,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:56:07,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:07,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:07,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935729016] [2025-04-14 00:56:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935729016] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:07,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793109814] [2025-04-14 00:56:07,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:07,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:07,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:07,724 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:56:07,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 00:56:07,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:56:07,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:56:07,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:07,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:07,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:56:07,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:56:07,981 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:56:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:07,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:56:07,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793109814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:07,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:56:07,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2025-04-14 00:56:07,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763027756] [2025-04-14 00:56:07,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:07,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:56:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:07,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:56:07,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:56:07,998 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:56:07,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 114 transitions, 913 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:07,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:07,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:56:07,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:11,912 INFO L116 PetriNetUnfolderBase]: 44371/59634 cut-off events. [2025-04-14 00:56:11,912 INFO L117 PetriNetUnfolderBase]: For 120868/120872 co-relation queries the response was YES. [2025-04-14 00:56:12,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189029 conditions, 59634 events. 44371/59634 cut-off events. For 120868/120872 co-relation queries the response was YES. Maximal size of possible extension queue 2226. Compared 362946 event pairs, 18674 based on Foata normal form. 3/49942 useless extension candidates. Maximal degree in co-relation 188980. Up to 48383 conditions per place. [2025-04-14 00:56:12,444 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 208 selfloop transitions, 34 changer transitions 4/249 dead transitions. [2025-04-14 00:56:12,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 249 transitions, 1961 flow [2025-04-14 00:56:12,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:56:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:56:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2025-04-14 00:56:12,446 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49176954732510286 [2025-04-14 00:56:12,446 INFO L175 Difference]: Start difference. First operand has 105 places, 114 transitions, 913 flow. Second operand 9 states and 239 transitions. [2025-04-14 00:56:12,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 249 transitions, 1961 flow [2025-04-14 00:56:12,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 249 transitions, 1913 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-04-14 00:56:12,901 INFO L231 Difference]: Finished difference. Result has 114 places, 126 transitions, 1105 flow [2025-04-14 00:56:12,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1105, PETRI_PLACES=114, PETRI_TRANSITIONS=126} [2025-04-14 00:56:12,901 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 63 predicate places. [2025-04-14 00:56:12,901 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 126 transitions, 1105 flow [2025-04-14 00:56:12,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:12,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:12,902 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] [2025-04-14 00:56:12,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 00:56:13,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 00:56:13,103 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:56:13,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash 171393859, now seen corresponding path program 1 times [2025-04-14 00:56:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:13,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754583273] [2025-04-14 00:56:13,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:13,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:13,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:56:13,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:56:13,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:13,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:13,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:13,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754583273] [2025-04-14 00:56:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754583273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:13,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15386059] [2025-04-14 00:56:13,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:13,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:13,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:13,553 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:13,555 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:13,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:56:13,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:56:13,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:13,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:13,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:56:13,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:56:13,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:56:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:13,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:56:13,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15386059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:13,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:56:13,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2025-04-14 00:56:13,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313251302] [2025-04-14 00:56:13,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:13,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:56:13,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:13,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:56:13,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:56:13,739 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:56:13,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 126 transitions, 1105 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:13,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:13,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:56:13,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:18,578 INFO L116 PetriNetUnfolderBase]: 48058/64621 cut-off events. [2025-04-14 00:56:18,578 INFO L117 PetriNetUnfolderBase]: For 150883/150887 co-relation queries the response was YES. [2025-04-14 00:56:18,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210803 conditions, 64621 events. 48058/64621 cut-off events. For 150883/150887 co-relation queries the response was YES. Maximal size of possible extension queue 2475. Compared 398745 event pairs, 21452 based on Foata normal form. 3/54268 useless extension candidates. Maximal degree in co-relation 210749. Up to 54608 conditions per place. [2025-04-14 00:56:18,996 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 205 selfloop transitions, 37 changer transitions 3/248 dead transitions. [2025-04-14 00:56:18,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 248 transitions, 2120 flow [2025-04-14 00:56:18,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:56:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:56:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2025-04-14 00:56:18,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4732510288065844 [2025-04-14 00:56:18,998 INFO L175 Difference]: Start difference. First operand has 114 places, 126 transitions, 1105 flow. Second operand 9 states and 230 transitions. [2025-04-14 00:56:18,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 248 transitions, 2120 flow [2025-04-14 00:56:19,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 248 transitions, 2054 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-04-14 00:56:19,894 INFO L231 Difference]: Finished difference. Result has 122 places, 138 transitions, 1316 flow [2025-04-14 00:56:19,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1316, PETRI_PLACES=122, PETRI_TRANSITIONS=138} [2025-04-14 00:56:19,895 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 71 predicate places. [2025-04-14 00:56:19,896 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 138 transitions, 1316 flow [2025-04-14 00:56:19,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:19,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:19,896 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] [2025-04-14 00:56:19,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 00:56:20,097 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:20,098 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:56:20,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -246415339, now seen corresponding path program 2 times [2025-04-14 00:56:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:20,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577105649] [2025-04-14 00:56:20,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:20,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:56:20,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:56:20,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:56:20,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:20,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:20,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577105649] [2025-04-14 00:56:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577105649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:20,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817729145] [2025-04-14 00:56:20,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:20,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:20,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:20,534 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:56:20,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 00:56:20,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:56:20,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:56:20,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:56:20,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:20,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 00:56:20,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:56:20,750 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:56:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:20,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:56:20,860 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:56:20,860 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 25 treesize of output 16 [2025-04-14 00:56:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:20,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817729145] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:56:20,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:56:20,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 20 [2025-04-14 00:56:20,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426033119] [2025-04-14 00:56:20,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:56:20,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:56:20,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:20,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:56:20,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:56:20,907 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:56:20,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 138 transitions, 1316 flow. Second operand has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 21 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:20,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:20,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:56:20,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:26,185 INFO L116 PetriNetUnfolderBase]: 53011/71309 cut-off events. [2025-04-14 00:56:26,185 INFO L117 PetriNetUnfolderBase]: For 187910/187914 co-relation queries the response was YES. [2025-04-14 00:56:26,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237855 conditions, 71309 events. 53011/71309 cut-off events. For 187910/187914 co-relation queries the response was YES. Maximal size of possible extension queue 2777. Compared 447841 event pairs, 22213 based on Foata normal form. 3/60023 useless extension candidates. Maximal degree in co-relation 237797. Up to 58402 conditions per place. [2025-04-14 00:56:26,887 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 249 selfloop transitions, 58 changer transitions 5/315 dead transitions. [2025-04-14 00:56:26,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 315 transitions, 2687 flow [2025-04-14 00:56:26,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:56:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:56:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 338 transitions. [2025-04-14 00:56:26,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3912037037037037 [2025-04-14 00:56:26,888 INFO L175 Difference]: Start difference. First operand has 122 places, 138 transitions, 1316 flow. Second operand 16 states and 338 transitions. [2025-04-14 00:56:26,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 315 transitions, 2687 flow [2025-04-14 00:56:27,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 315 transitions, 2625 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-04-14 00:56:27,513 INFO L231 Difference]: Finished difference. Result has 139 places, 160 transitions, 1729 flow [2025-04-14 00:56:27,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1729, PETRI_PLACES=139, PETRI_TRANSITIONS=160} [2025-04-14 00:56:27,513 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 88 predicate places. [2025-04-14 00:56:27,513 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 160 transitions, 1729 flow [2025-04-14 00:56:27,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 21 states have internal predecessors, (220), 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:27,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:27,514 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] [2025-04-14 00:56:27,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 00:56:27,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 00:56:27,714 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:56:27,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:27,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1465709159, now seen corresponding path program 3 times [2025-04-14 00:56:27,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:27,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585065796] [2025-04-14 00:56:27,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:56:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:27,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:56:27,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:56:27,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:56:27,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:27,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585065796] [2025-04-14 00:56:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585065796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:27,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:56:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216043813] [2025-04-14 00:56:27,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:27,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:56:27,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:27,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:56:27,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:56:27,879 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:56:27,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 160 transitions, 1729 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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:27,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:27,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:56:27,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:34,115 INFO L116 PetriNetUnfolderBase]: 56578/76135 cut-off events. [2025-04-14 00:56:34,115 INFO L117 PetriNetUnfolderBase]: For 245277/245281 co-relation queries the response was YES. [2025-04-14 00:56:34,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266050 conditions, 76135 events. 56578/76135 cut-off events. For 245277/245281 co-relation queries the response was YES. Maximal size of possible extension queue 3001. Compared 482958 event pairs, 25399 based on Foata normal form. 3/64195 useless extension candidates. Maximal degree in co-relation 265982. Up to 65303 conditions per place. [2025-04-14 00:56:34,680 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 233 selfloop transitions, 48 changer transitions 2/286 dead transitions. [2025-04-14 00:56:34,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 286 transitions, 2844 flow [2025-04-14 00:56:34,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:56:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:56:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions. [2025-04-14 00:56:34,682 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-14 00:56:34,682 INFO L175 Difference]: Start difference. First operand has 139 places, 160 transitions, 1729 flow. Second operand 9 states and 234 transitions. [2025-04-14 00:56:34,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 286 transitions, 2844 flow [2025-04-14 00:56:35,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 286 transitions, 2697 flow, removed 54 selfloop flow, removed 8 redundant places. [2025-04-14 00:56:35,725 INFO L231 Difference]: Finished difference. Result has 142 places, 175 transitions, 1954 flow [2025-04-14 00:56:35,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1954, PETRI_PLACES=142, PETRI_TRANSITIONS=175} [2025-04-14 00:56:35,726 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 91 predicate places. [2025-04-14 00:56:35,726 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 175 transitions, 1954 flow [2025-04-14 00:56:35,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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:35,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:35,726 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] [2025-04-14 00:56:35,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 00:56:35,726 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:56:35,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash 540250907, now seen corresponding path program 4 times [2025-04-14 00:56:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:35,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744018059] [2025-04-14 00:56:35,727 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:56:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:35,732 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:56:35,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:56:35,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:56:35,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:35,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744018059] [2025-04-14 00:56:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744018059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:35,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:35,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:56:35,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684038494] [2025-04-14 00:56:35,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:35,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:56:35,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:35,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:56:35,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:56:35,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:56:35,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 175 transitions, 1954 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:35,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:35,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:56:35,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:42,952 INFO L116 PetriNetUnfolderBase]: 60232/81072 cut-off events. [2025-04-14 00:56:42,953 INFO L117 PetriNetUnfolderBase]: For 306225/306229 co-relation queries the response was YES. [2025-04-14 00:56:43,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294654 conditions, 81072 events. 60232/81072 cut-off events. For 306225/306229 co-relation queries the response was YES. Maximal size of possible extension queue 3250. Compared 518771 event pairs, 27689 based on Foata normal form. 3/68487 useless extension candidates. Maximal degree in co-relation 294587. Up to 70050 conditions per place. [2025-04-14 00:56:43,599 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 232 selfloop transitions, 52 changer transitions 3/290 dead transitions. [2025-04-14 00:56:43,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 290 transitions, 3110 flow [2025-04-14 00:56:43,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:56:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:56:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 234 transitions. [2025-04-14 00:56:43,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-04-14 00:56:43,600 INFO L175 Difference]: Start difference. First operand has 142 places, 175 transitions, 1954 flow. Second operand 10 states and 234 transitions. [2025-04-14 00:56:43,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 290 transitions, 3110 flow [2025-04-14 00:56:45,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 290 transitions, 3038 flow, removed 25 selfloop flow, removed 3 redundant places. [2025-04-14 00:56:45,006 INFO L231 Difference]: Finished difference. Result has 151 places, 187 transitions, 2273 flow [2025-04-14 00:56:45,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2273, PETRI_PLACES=151, PETRI_TRANSITIONS=187} [2025-04-14 00:56:45,006 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 100 predicate places. [2025-04-14 00:56:45,006 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 187 transitions, 2273 flow [2025-04-14 00:56:45,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:45,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:45,007 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] [2025-04-14 00:56:45,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:56:45,007 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:56:45,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1282450398, now seen corresponding path program 2 times [2025-04-14 00:56:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:45,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845633525] [2025-04-14 00:56:45,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:45,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:56:45,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:56:45,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:45,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:45,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:45,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845633525] [2025-04-14 00:56:45,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845633525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:45,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:45,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:56:45,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781202730] [2025-04-14 00:56:45,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:45,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:56:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:45,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:56:45,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:56:45,169 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:56:45,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 187 transitions, 2273 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:45,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:45,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:56:45,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:51,993 INFO L116 PetriNetUnfolderBase]: 63499/85471 cut-off events. [2025-04-14 00:56:51,993 INFO L117 PetriNetUnfolderBase]: For 360785/360789 co-relation queries the response was YES. [2025-04-14 00:56:52,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317130 conditions, 85471 events. 63499/85471 cut-off events. For 360785/360789 co-relation queries the response was YES. Maximal size of possible extension queue 3502. Compared 550421 event pairs, 29834 based on Foata normal form. 3/72277 useless extension candidates. Maximal degree in co-relation 317059. Up to 74935 conditions per place. [2025-04-14 00:56:52,723 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 236 selfloop transitions, 52 changer transitions 2/293 dead transitions. [2025-04-14 00:56:52,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 293 transitions, 3394 flow [2025-04-14 00:56:52,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:56:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:56:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-04-14 00:56:52,724 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2025-04-14 00:56:52,724 INFO L175 Difference]: Start difference. First operand has 151 places, 187 transitions, 2273 flow. Second operand 8 states and 207 transitions. [2025-04-14 00:56:52,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 293 transitions, 3394 flow [2025-04-14 00:56:54,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 293 transitions, 3332 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-04-14 00:56:54,061 INFO L231 Difference]: Finished difference. Result has 156 places, 196 transitions, 2557 flow [2025-04-14 00:56:54,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2211, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2557, PETRI_PLACES=156, PETRI_TRANSITIONS=196} [2025-04-14 00:56:54,061 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 105 predicate places. [2025-04-14 00:56:54,061 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 196 transitions, 2557 flow [2025-04-14 00:56:54,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:54,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:54,062 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] [2025-04-14 00:56:54,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 00:56:54,062 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:56:54,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1791713042, now seen corresponding path program 3 times [2025-04-14 00:56:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:54,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094517251] [2025-04-14 00:56:54,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:56:54,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:54,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:56:54,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:56:54,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:56:54,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:56:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:54,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094517251] [2025-04-14 00:56:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094517251] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:56:54,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157035941] [2025-04-14 00:56:54,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:54,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:56:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:54,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:56:54,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:56:54,242 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:56:54,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 196 transitions, 2557 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 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:54,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:54,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:56:54,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:01,722 INFO L116 PetriNetUnfolderBase]: 66615/89669 cut-off events. [2025-04-14 00:57:01,722 INFO L117 PetriNetUnfolderBase]: For 419681/419685 co-relation queries the response was YES. [2025-04-14 00:57:02,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338375 conditions, 89669 events. 66615/89669 cut-off events. For 419681/419685 co-relation queries the response was YES. Maximal size of possible extension queue 3740. Compared 582589 event pairs, 30847 based on Foata normal form. 3/75876 useless extension candidates. Maximal degree in co-relation 338301. Up to 79296 conditions per place. [2025-04-14 00:57:02,507 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 269 selfloop transitions, 60 changer transitions 3/335 dead transitions. [2025-04-14 00:57:02,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 335 transitions, 3862 flow [2025-04-14 00:57:02,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:57:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:57:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2025-04-14 00:57:02,508 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4703703703703704 [2025-04-14 00:57:02,508 INFO L175 Difference]: Start difference. First operand has 156 places, 196 transitions, 2557 flow. Second operand 10 states and 254 transitions. [2025-04-14 00:57:02,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 335 transitions, 3862 flow [2025-04-14 00:57:04,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 335 transitions, 3794 flow, removed 25 selfloop flow, removed 2 redundant places. [2025-04-14 00:57:04,034 INFO L231 Difference]: Finished difference. Result has 166 places, 209 transitions, 2922 flow [2025-04-14 00:57:04,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2489, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2922, PETRI_PLACES=166, PETRI_TRANSITIONS=209} [2025-04-14 00:57:04,034 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 115 predicate places. [2025-04-14 00:57:04,034 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 209 transitions, 2922 flow [2025-04-14 00:57:04,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:04,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:04,035 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] [2025-04-14 00:57:04,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 00:57:04,035 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:57:04,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash -449943300, now seen corresponding path program 4 times [2025-04-14 00:57:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:04,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48472783] [2025-04-14 00:57:04,035 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:57:04,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:04,041 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:57:04,046 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:57:04,046 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:57:04,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:04,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:04,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48472783] [2025-04-14 00:57:04,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48472783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:57:04,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662132308] [2025-04-14 00:57:04,175 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:57:04,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:57:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:57:04,178 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:57:04,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 00:57:04,238 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:57:04,259 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:57:04,260 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:57:04,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:04,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:57:04,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:57:04,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:57:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:04,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:57:04,439 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:57:04,439 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 25 treesize of output 16 [2025-04-14 00:57:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:04,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662132308] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:57:04,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:57:04,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-14 00:57:04,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115143162] [2025-04-14 00:57:04,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:57:04,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 00:57:04,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:04,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 00:57:04,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-14 00:57:04,467 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:57:04,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 209 transitions, 2922 flow. Second operand has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:04,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:04,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:57:04,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:13,632 INFO L116 PetriNetUnfolderBase]: 69879/94050 cut-off events. [2025-04-14 00:57:13,632 INFO L117 PetriNetUnfolderBase]: For 525104/525108 co-relation queries the response was YES. [2025-04-14 00:57:14,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368782 conditions, 94050 events. 69879/94050 cut-off events. For 525104/525108 co-relation queries the response was YES. Maximal size of possible extension queue 3990. Compared 614078 event pairs, 31966 based on Foata normal form. 3/79662 useless extension candidates. Maximal degree in co-relation 368704. Up to 83470 conditions per place. [2025-04-14 00:57:14,618 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 273 selfloop transitions, 58 changer transitions 2/336 dead transitions. [2025-04-14 00:57:14,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 336 transitions, 4115 flow [2025-04-14 00:57:14,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:57:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:57:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2025-04-14 00:57:14,620 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4703703703703704 [2025-04-14 00:57:14,620 INFO L175 Difference]: Start difference. First operand has 166 places, 209 transitions, 2922 flow. Second operand 10 states and 254 transitions. [2025-04-14 00:57:14,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 336 transitions, 4115 flow [2025-04-14 00:57:17,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 336 transitions, 4007 flow, removed 38 selfloop flow, removed 4 redundant places. [2025-04-14 00:57:17,306 INFO L231 Difference]: Finished difference. Result has 174 places, 216 transitions, 3126 flow [2025-04-14 00:57:17,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2818, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3126, PETRI_PLACES=174, PETRI_TRANSITIONS=216} [2025-04-14 00:57:17,307 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 123 predicate places. [2025-04-14 00:57:17,307 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 216 transitions, 3126 flow [2025-04-14 00:57:17,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:17,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:17,308 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] [2025-04-14 00:57:17,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-14 00:57:17,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:57:17,508 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:57:17,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1888180326, now seen corresponding path program 5 times [2025-04-14 00:57:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:17,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117181664] [2025-04-14 00:57:17,509 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:17,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:17,519 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:57:17,529 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:57:17,530 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:57:17,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:17,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:17,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117181664] [2025-04-14 00:57:17,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117181664] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:57:17,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472805904] [2025-04-14 00:57:17,869 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:17,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:57:17,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:57:17,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:57:17,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 00:57:17,931 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:57:17,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:57:17,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:57:17,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:17,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 00:57:17,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:57:18,084 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:57:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:57:18,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:57:18,164 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:57:18,164 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 25 treesize of output 16 [2025-04-14 00:57:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:18,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472805904] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:57:18,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:57:18,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 19 [2025-04-14 00:57:18,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676532143] [2025-04-14 00:57:18,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:18,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:57:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:18,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:57:18,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:57:18,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:57:18,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 216 transitions, 3126 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:18,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:18,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:57:18,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:27,032 INFO L116 PetriNetUnfolderBase]: 73143/98443 cut-off events. [2025-04-14 00:57:27,033 INFO L117 PetriNetUnfolderBase]: For 584168/584172 co-relation queries the response was YES. [2025-04-14 00:57:27,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390447 conditions, 98443 events. 73143/98443 cut-off events. For 584168/584172 co-relation queries the response was YES. Maximal size of possible extension queue 4235. Compared 646432 event pairs, 35028 based on Foata normal form. 3/83436 useless extension candidates. Maximal degree in co-relation 390365. Up to 87903 conditions per place. [2025-04-14 00:57:27,973 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 253 selfloop transitions, 54 changer transitions 2/312 dead transitions. [2025-04-14 00:57:27,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 312 transitions, 4195 flow [2025-04-14 00:57:27,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:57:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:57:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2025-04-14 00:57:27,974 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4699074074074074 [2025-04-14 00:57:27,974 INFO L175 Difference]: Start difference. First operand has 174 places, 216 transitions, 3126 flow. Second operand 8 states and 203 transitions. [2025-04-14 00:57:27,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 312 transitions, 4195 flow [2025-04-14 00:57:30,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 312 transitions, 4131 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-14 00:57:30,078 INFO L231 Difference]: Finished difference. Result has 178 places, 222 transitions, 3352 flow [2025-04-14 00:57:30,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3062, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3352, PETRI_PLACES=178, PETRI_TRANSITIONS=222} [2025-04-14 00:57:30,079 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 127 predicate places. [2025-04-14 00:57:30,079 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 222 transitions, 3352 flow [2025-04-14 00:57:30,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:30,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:30,079 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] [2025-04-14 00:57:30,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-14 00:57:30,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-14 00:57:30,279 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:57:30,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1301798860, now seen corresponding path program 6 times [2025-04-14 00:57:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:30,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569756854] [2025-04-14 00:57:30,280 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:57:30,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:30,288 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:57:30,293 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:57:30,293 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:57:30,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:30,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569756854] [2025-04-14 00:57:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569756854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:30,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:30,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:57:30,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513479995] [2025-04-14 00:57:30,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:30,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:57:30,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:30,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:57:30,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:57:30,459 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:57:30,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 222 transitions, 3352 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:30,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:30,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:57:30,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:39,995 INFO L116 PetriNetUnfolderBase]: 76407/102830 cut-off events. [2025-04-14 00:57:39,995 INFO L117 PetriNetUnfolderBase]: For 670419/670423 co-relation queries the response was YES. [2025-04-14 00:57:40,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415145 conditions, 102830 events. 76407/102830 cut-off events. For 670419/670423 co-relation queries the response was YES. Maximal size of possible extension queue 4480. Compared 679395 event pairs, 36674 based on Foata normal form. 3/87216 useless extension candidates. Maximal degree in co-relation 415060. Up to 92294 conditions per place. [2025-04-14 00:57:41,059 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 277 selfloop transitions, 60 changer transitions 3/343 dead transitions. [2025-04-14 00:57:41,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 343 transitions, 4603 flow [2025-04-14 00:57:41,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:57:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:57:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 244 transitions. [2025-04-14 00:57:41,060 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2025-04-14 00:57:41,060 INFO L175 Difference]: Start difference. First operand has 178 places, 222 transitions, 3352 flow. Second operand 10 states and 244 transitions. [2025-04-14 00:57:41,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 343 transitions, 4603 flow [2025-04-14 00:57:43,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 343 transitions, 4531 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-04-14 00:57:43,503 INFO L231 Difference]: Finished difference. Result has 186 places, 231 transitions, 3652 flow [2025-04-14 00:57:43,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3280, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3652, PETRI_PLACES=186, PETRI_TRANSITIONS=231} [2025-04-14 00:57:43,504 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 135 predicate places. [2025-04-14 00:57:43,504 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 231 transitions, 3652 flow [2025-04-14 00:57:43,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:43,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:43,504 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] [2025-04-14 00:57:43,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 00:57:43,504 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:57:43,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:43,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2098588795, now seen corresponding path program 5 times [2025-04-14 00:57:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:43,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769830486] [2025-04-14 00:57:43,505 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:43,512 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:57:43,520 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:57:43,520 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:57:43,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:43,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769830486] [2025-04-14 00:57:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769830486] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:57:43,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014184548] [2025-04-14 00:57:43,744 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:57:43,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:57:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:57:43,746 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:57:43,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 00:57:43,810 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:57:43,833 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:57:43,833 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:57:43,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:43,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 00:57:43,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:57:43,993 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:57:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:57:44,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:57:44,052 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:57:44,052 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 20 treesize of output 14 [2025-04-14 00:57:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:57:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014184548] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:57:44,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:57:44,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 19 [2025-04-14 00:57:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455237918] [2025-04-14 00:57:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:44,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:57:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:44,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:57:44,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-04-14 00:57:44,075 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:57:44,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 231 transitions, 3652 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:44,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:44,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:57:44,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:56,538 INFO L116 PetriNetUnfolderBase]: 93535/126013 cut-off events. [2025-04-14 00:57:56,538 INFO L117 PetriNetUnfolderBase]: For 1032822/1032826 co-relation queries the response was YES. [2025-04-14 00:57:57,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529660 conditions, 126013 events. 93535/126013 cut-off events. For 1032822/1032826 co-relation queries the response was YES. Maximal size of possible extension queue 5205. Compared 848086 event pairs, 27398 based on Foata normal form. 3/107041 useless extension candidates. Maximal degree in co-relation 529571. Up to 61581 conditions per place. [2025-04-14 00:57:57,844 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 336 selfloop transitions, 98 changer transitions 5/442 dead transitions. [2025-04-14 00:57:57,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 442 transitions, 5882 flow [2025-04-14 00:57:57,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:57:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:57:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 314 transitions. [2025-04-14 00:57:57,845 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5286195286195287 [2025-04-14 00:57:57,845 INFO L175 Difference]: Start difference. First operand has 186 places, 231 transitions, 3652 flow. Second operand 11 states and 314 transitions. [2025-04-14 00:57:57,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 442 transitions, 5882 flow [2025-04-14 00:58:01,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 442 transitions, 5776 flow, removed 40 selfloop flow, removed 4 redundant places. [2025-04-14 00:58:01,579 INFO L231 Difference]: Finished difference. Result has 197 places, 252 transitions, 4272 flow [2025-04-14 00:58:01,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3546, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4272, PETRI_PLACES=197, PETRI_TRANSITIONS=252} [2025-04-14 00:58:01,580 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 146 predicate places. [2025-04-14 00:58:01,580 INFO L485 AbstractCegarLoop]: Abstraction has has 197 places, 252 transitions, 4272 flow [2025-04-14 00:58:01,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:01,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:01,580 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] [2025-04-14 00:58:01,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 00:58:01,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-14 00:58:01,783 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:58:01,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1271322196, now seen corresponding path program 7 times [2025-04-14 00:58:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:01,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266059015] [2025-04-14 00:58:01,783 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:58:01,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:01,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:58:01,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:58:01,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:58:01,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:58:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:02,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266059015] [2025-04-14 00:58:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266059015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:58:02,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404153123] [2025-04-14 00:58:02,062 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:58:02,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:58:02,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:58:02,064 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:58:02,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 00:58:02,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 00:58:02,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 00:58:02,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:58:02,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:02,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-14 00:58:02,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:58:02,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:58:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:58:02,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:58:02,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404153123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:58:02,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:58:02,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-04-14 00:58:02,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323613932] [2025-04-14 00:58:02,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:58:02,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:58:02,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:58:02,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:58:02,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:58:02,259 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:58:02,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 252 transitions, 4272 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:02,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:58:02,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:58:02,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:58:17,963 INFO L116 PetriNetUnfolderBase]: 108466/146137 cut-off events. [2025-04-14 00:58:17,963 INFO L117 PetriNetUnfolderBase]: For 1444928/1444932 co-relation queries the response was YES. [2025-04-14 00:58:19,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641224 conditions, 146137 events. 108466/146137 cut-off events. For 1444928/1444932 co-relation queries the response was YES. Maximal size of possible extension queue 5899. Compared 996664 event pairs, 39110 based on Foata normal form. 3/124107 useless extension candidates. Maximal degree in co-relation 641129. Up to 92467 conditions per place. [2025-04-14 00:58:19,769 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 345 selfloop transitions, 95 changer transitions 5/448 dead transitions. [2025-04-14 00:58:19,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 448 transitions, 6465 flow [2025-04-14 00:58:19,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:58:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:58:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 306 transitions. [2025-04-14 00:58:19,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-04-14 00:58:19,770 INFO L175 Difference]: Start difference. First operand has 197 places, 252 transitions, 4272 flow. Second operand 11 states and 306 transitions. [2025-04-14 00:58:19,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 448 transitions, 6465 flow [2025-04-14 00:58:30,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 448 transitions, 6147 flow, removed 140 selfloop flow, removed 3 redundant places. [2025-04-14 00:58:30,117 INFO L231 Difference]: Finished difference. Result has 210 places, 267 transitions, 4639 flow [2025-04-14 00:58:30,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3954, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4639, PETRI_PLACES=210, PETRI_TRANSITIONS=267} [2025-04-14 00:58:30,118 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 159 predicate places. [2025-04-14 00:58:30,118 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 267 transitions, 4639 flow [2025-04-14 00:58:30,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:30,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:30,118 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] [2025-04-14 00:58:30,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 00:58:30,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 00:58:30,319 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:58:30,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash -814866507, now seen corresponding path program 6 times [2025-04-14 00:58:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:30,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830903777] [2025-04-14 00:58:30,319 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:58:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:30,324 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:58:30,328 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:58:30,328 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:58:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:58:30,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:30,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830903777] [2025-04-14 00:58:30,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830903777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:58:30,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:58:30,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:58:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959342315] [2025-04-14 00:58:30,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:58:30,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:58:30,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:58:30,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:58:30,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:58:30,453 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:58:30,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 267 transitions, 4639 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:30,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:58:30,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:58:30,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:58:47,968 INFO L116 PetriNetUnfolderBase]: 112153/151124 cut-off events. [2025-04-14 00:58:47,968 INFO L117 PetriNetUnfolderBase]: For 1443512/1443516 co-relation queries the response was YES. [2025-04-14 00:58:49,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660096 conditions, 151124 events. 112153/151124 cut-off events. For 1443512/1443516 co-relation queries the response was YES. Maximal size of possible extension queue 6203. Compared 1039630 event pairs, 51206 based on Foata normal form. 3/128433 useless extension candidates. Maximal degree in co-relation 659994. Up to 135027 conditions per place. [2025-04-14 00:58:50,027 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 352 selfloop transitions, 78 changer transitions 5/438 dead transitions. [2025-04-14 00:58:50,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 438 transitions, 6518 flow [2025-04-14 00:58:50,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:58:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:58:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 268 transitions. [2025-04-14 00:58:50,029 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2025-04-14 00:58:50,029 INFO L175 Difference]: Start difference. First operand has 210 places, 267 transitions, 4639 flow. Second operand 10 states and 268 transitions. [2025-04-14 00:58:50,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 438 transitions, 6518 flow [2025-04-14 00:59:01,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 438 transitions, 6082 flow, removed 182 selfloop flow, removed 4 redundant places. [2025-04-14 00:59:01,433 INFO L231 Difference]: Finished difference. Result has 220 places, 293 transitions, 4915 flow [2025-04-14 00:59:01,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4213, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4915, PETRI_PLACES=220, PETRI_TRANSITIONS=293} [2025-04-14 00:59:01,434 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 169 predicate places. [2025-04-14 00:59:01,434 INFO L485 AbstractCegarLoop]: Abstraction has has 220 places, 293 transitions, 4915 flow [2025-04-14 00:59:01,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:01,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:01,435 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] [2025-04-14 00:59:01,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 00:59:01,435 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-14 00:59:01,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1836868622, now seen corresponding path program 8 times [2025-04-14 00:59:01,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:01,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096387718] [2025-04-14 00:59:01,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:59:01,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:01,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 00:59:01,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 40 statements. [2025-04-14 00:59:01,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:59:01,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:59:01,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:01,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096387718] [2025-04-14 00:59:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096387718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:01,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:01,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:59:01,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750874252] [2025-04-14 00:59:01,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:01,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:59:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:01,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:59:01,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:59:01,575 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 54 [2025-04-14 00:59:01,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 293 transitions, 4915 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:01,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:01,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 54 [2025-04-14 00:59:01,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand