/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/popl20-mult-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:26:16,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:26:16,128 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 01:26:16,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:26:16,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:26:16,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:26:16,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:26:16,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:26:16,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:26:16,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:26:16,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:26:16,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:26:16,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:26:16,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:26:16,157 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:26:16,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:26:16,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:26:16,157 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:26:16,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:26:16,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:26:16,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:26:16,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:26:16,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:26:16,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:26:16,159 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:26:16,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:26:16,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:26:16,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:26:16,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:26:16,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:26:16,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:26:16,159 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 01:26:16,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:26:16,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:26:16,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:26:16,400 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:26:16,400 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:26:16,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2025-04-14 01:26:17,689 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48427ed76/255c0b0a6289458eb4e8ffd77156240b/FLAGca55e1fe8 [2025-04-14 01:26:17,922 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:26:17,922 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2025-04-14 01:26:17,933 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48427ed76/255c0b0a6289458eb4e8ffd77156240b/FLAGca55e1fe8 [2025-04-14 01:26:18,740 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48427ed76/255c0b0a6289458eb4e8ffd77156240b [2025-04-14 01:26:18,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:26:18,743 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:26:18,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:26:18,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:26:18,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:26:18,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:18,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0cb417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18, skipping insertion in model container [2025-04-14 01:26:18,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:18,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:26:18,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2664,2677] [2025-04-14 01:26:18,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:26:18,935 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:26:18,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c[2664,2677] [2025-04-14 01:26:18,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:26:18,973 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:26:18,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18 WrapperNode [2025-04-14 01:26:18,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:26:18,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:26:18,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:26:18,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:26:18,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:18,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,006 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 92 [2025-04-14 01:26:19,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:26:19,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:26:19,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:26:19,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:26:19,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,030 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 01:26:19,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:26:19,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:26:19,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:26:19,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:26:19,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (1/1) ... [2025-04-14 01:26:19,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:26:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:19,071 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 01:26:19,074 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 01:26:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:26:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:26:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:26:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:26:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:26:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:26:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:26:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 01:26:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 01:26:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:26:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:26:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:26:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:26:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:26:19,090 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 01:26:19,157 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:26:19,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:26:19,311 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:26:19,312 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:26:19,312 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:26:19,440 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:26:19,444 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:26:19,449 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:26:19,457 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:26:19,462 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:26:19,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:26:19 BoogieIcfgContainer [2025-04-14 01:26:19,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:26:19,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:26:19,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:26:19,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:26:19,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:26:18" (1/3) ... [2025-04-14 01:26:19,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bc2dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:26:19, skipping insertion in model container [2025-04-14 01:26:19,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:26:18" (2/3) ... [2025-04-14 01:26:19,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bc2dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:26:19, skipping insertion in model container [2025-04-14 01:26:19,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:26:19" (3/3) ... [2025-04-14 01:26:19,470 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2025-04-14 01:26:19,478 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:26:19,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-4.wvr.c that has 5 procedures, 32 locations, 35 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 01:26:19,480 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:26:19,533 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 01:26:19,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-14 01:26:19,579 INFO L116 PetriNetUnfolderBase]: 8/35 cut-off events. [2025-04-14 01:26:19,581 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:26:19,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 35 events. 8/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-14 01:26:19,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-14 01:26:19,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 92 flow [2025-04-14 01:26:19,595 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:26:19,603 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;@7a5f8bf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:26:19,604 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 01:26:19,617 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:26:19,617 INFO L116 PetriNetUnfolderBase]: 8/33 cut-off events. [2025-04-14 01:26:19,617 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 01:26:19,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:19,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:19,618 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:19,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:19,621 INFO L85 PathProgramCache]: Analyzing trace with hash -300942333, now seen corresponding path program 1 times [2025-04-14 01:26:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:19,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27428321] [2025-04-14 01:26:19,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:19,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:26:19,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:26:19,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:19,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:19,901 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 01:26:19,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:19,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27428321] [2025-04-14 01:26:19,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27428321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:19,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:19,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:26:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741929668] [2025-04-14 01:26:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:19,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:26:19,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:19,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:26:19,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:26:19,927 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:19,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:19,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:19,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:19,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:20,330 INFO L116 PetriNetUnfolderBase]: 3615/4612 cut-off events. [2025-04-14 01:26:20,330 INFO L117 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2025-04-14 01:26:20,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9585 conditions, 4612 events. 3615/4612 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16646 event pairs, 763 based on Foata normal form. 155/3213 useless extension candidates. Maximal degree in co-relation 8466. Up to 3776 conditions per place. [2025-04-14 01:26:20,357 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 50 selfloop transitions, 3 changer transitions 2/55 dead transitions. [2025-04-14 01:26:20,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 265 flow [2025-04-14 01:26:20,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:26:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:26:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-04-14 01:26:20,368 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5982905982905983 [2025-04-14 01:26:20,369 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 92 flow. Second operand 3 states and 70 transitions. [2025-04-14 01:26:20,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 265 flow [2025-04-14 01:26:20,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 55 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-14 01:26:20,383 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 99 flow [2025-04-14 01:26:20,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2025-04-14 01:26:20,388 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2025-04-14 01:26:20,388 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 99 flow [2025-04-14 01:26:20,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:20,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:20,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:20,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:26:20,389 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:20,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash -402083546, now seen corresponding path program 1 times [2025-04-14 01:26:20,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:20,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971295066] [2025-04-14 01:26:20,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:20,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:20,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:26:20,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:26:20,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:20,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:20,463 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 01:26:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:20,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971295066] [2025-04-14 01:26:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971295066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:26:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014855545] [2025-04-14 01:26:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:20,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:26:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:20,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:26:20,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:26:20,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:20,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:20,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:20,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:20,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:20,780 INFO L116 PetriNetUnfolderBase]: 2839/3836 cut-off events. [2025-04-14 01:26:20,780 INFO L117 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2025-04-14 01:26:20,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8784 conditions, 3836 events. 2839/3836 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 15657 event pairs, 739 based on Foata normal form. 0/3058 useless extension candidates. Maximal degree in co-relation 1575. Up to 3660 conditions per place. [2025-04-14 01:26:20,796 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 45 selfloop transitions, 4 changer transitions 2/51 dead transitions. [2025-04-14 01:26:20,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 238 flow [2025-04-14 01:26:20,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:26:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:26:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-14 01:26:20,797 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-14 01:26:20,798 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 99 flow. Second operand 3 states and 65 transitions. [2025-04-14 01:26:20,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 238 flow [2025-04-14 01:26:20,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:26:20,799 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 136 flow [2025-04-14 01:26:20,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-04-14 01:26:20,800 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-04-14 01:26:20,800 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 136 flow [2025-04-14 01:26:20,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:20,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:20,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:20,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:26:20,800 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:20,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1487168730, now seen corresponding path program 2 times [2025-04-14 01:26:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:20,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591869467] [2025-04-14 01:26:20,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:26:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:20,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:26:20,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:26:20,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:26:20,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:20,865 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 01:26:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:20,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591869467] [2025-04-14 01:26:20,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591869467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:20,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:20,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:26:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862749004] [2025-04-14 01:26:20,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:20,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:26:20,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:20,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:26:20,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:26:20,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:20,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:20,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:20,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:20,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:21,130 INFO L116 PetriNetUnfolderBase]: 2559/3403 cut-off events. [2025-04-14 01:26:21,131 INFO L117 PetriNetUnfolderBase]: For 1212/1212 co-relation queries the response was YES. [2025-04-14 01:26:21,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8437 conditions, 3403 events. 2559/3403 cut-off events. For 1212/1212 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11902 event pairs, 1525 based on Foata normal form. 95/2835 useless extension candidates. Maximal degree in co-relation 6331. Up to 3237 conditions per place. [2025-04-14 01:26:21,145 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 36 selfloop transitions, 0 changer transitions 19/55 dead transitions. [2025-04-14 01:26:21,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 291 flow [2025-04-14 01:26:21,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:26:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:26:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-14 01:26:21,146 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-14 01:26:21,146 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 136 flow. Second operand 3 states and 65 transitions. [2025-04-14 01:26:21,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 291 flow [2025-04-14 01:26:21,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:26:21,148 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 124 flow [2025-04-14 01:26:21,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-04-14 01:26:21,149 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2025-04-14 01:26:21,149 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 124 flow [2025-04-14 01:26:21,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:21,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:21,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:21,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:26:21,149 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:21,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 203417495, now seen corresponding path program 1 times [2025-04-14 01:26:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:21,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619826745] [2025-04-14 01:26:21,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:21,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:26:21,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:26:21,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:21,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:21,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:21,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619826745] [2025-04-14 01:26:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619826745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:21,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:26:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196896512] [2025-04-14 01:26:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:21,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:26:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:21,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:26:21,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:26:21,362 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:21,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:21,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:21,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:21,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:21,844 INFO L116 PetriNetUnfolderBase]: 6507/8621 cut-off events. [2025-04-14 01:26:21,844 INFO L117 PetriNetUnfolderBase]: For 2832/2832 co-relation queries the response was YES. [2025-04-14 01:26:21,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20859 conditions, 8621 events. 6507/8621 cut-off events. For 2832/2832 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 36628 event pairs, 1436 based on Foata normal form. 314/7000 useless extension candidates. Maximal degree in co-relation 20853. Up to 3389 conditions per place. [2025-04-14 01:26:21,880 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 78 selfloop transitions, 9 changer transitions 2/89 dead transitions. [2025-04-14 01:26:21,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 89 transitions, 452 flow [2025-04-14 01:26:21,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:26:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:26:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-04-14 01:26:21,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2025-04-14 01:26:21,883 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 124 flow. Second operand 4 states and 102 transitions. [2025-04-14 01:26:21,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 89 transitions, 452 flow [2025-04-14 01:26:21,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 89 transitions, 440 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 01:26:21,885 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 185 flow [2025-04-14 01:26:21,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-04-14 01:26:21,888 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2025-04-14 01:26:21,888 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 185 flow [2025-04-14 01:26:21,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:21,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:21,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:21,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:26:21,889 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:21,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 948911447, now seen corresponding path program 2 times [2025-04-14 01:26:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:21,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834049085] [2025-04-14 01:26:21,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:26:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:21,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:26:21,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:26:21,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:26:21,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:22,043 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 01:26:22,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:22,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834049085] [2025-04-14 01:26:22,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834049085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:22,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:22,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:26:22,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401680403] [2025-04-14 01:26:22,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:22,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:26:22,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:22,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:26:22,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:26:22,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:22,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:22,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:22,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:22,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:22,916 INFO L116 PetriNetUnfolderBase]: 12710/16819 cut-off events. [2025-04-14 01:26:22,916 INFO L117 PetriNetUnfolderBase]: For 14771/14771 co-relation queries the response was YES. [2025-04-14 01:26:22,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45750 conditions, 16819 events. 12710/16819 cut-off events. For 14771/14771 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 79611 event pairs, 2488 based on Foata normal form. 314/13283 useless extension candidates. Maximal degree in co-relation 45742. Up to 5403 conditions per place. [2025-04-14 01:26:22,991 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 102 selfloop transitions, 19 changer transitions 2/123 dead transitions. [2025-04-14 01:26:22,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 123 transitions, 690 flow [2025-04-14 01:26:22,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:26:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:26:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-04-14 01:26:22,995 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6871794871794872 [2025-04-14 01:26:22,995 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 185 flow. Second operand 5 states and 134 transitions. [2025-04-14 01:26:22,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 123 transitions, 690 flow [2025-04-14 01:26:23,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 123 transitions, 682 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-14 01:26:23,002 INFO L231 Difference]: Finished difference. Result has 47 places, 52 transitions, 304 flow [2025-04-14 01:26:23,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=47, PETRI_TRANSITIONS=52} [2025-04-14 01:26:23,003 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2025-04-14 01:26:23,003 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 52 transitions, 304 flow [2025-04-14 01:26:23,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:23,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:23,003 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:23,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:26:23,003 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:23,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash -885185046, now seen corresponding path program 1 times [2025-04-14 01:26:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:23,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067105199] [2025-04-14 01:26:23,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:23,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:26:23,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:26:23,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:23,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:23,175 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 01:26:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:23,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067105199] [2025-04-14 01:26:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067105199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:26:23,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626577929] [2025-04-14 01:26:23,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:23,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:23,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:23,179 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 01:26:23,180 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 01:26:23,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:26:23,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:26:23,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:23,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:23,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:26:23,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:26:23,326 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 01:26:23,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:26:23,406 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 01:26:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626577929] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:26:23,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:26:23,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-14 01:26:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469432970] [2025-04-14 01:26:23,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:26:23,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:26:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:23,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:26:23,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:26:23,407 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:23,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 52 transitions, 304 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:23,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:23,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:25,035 INFO L116 PetriNetUnfolderBase]: 27944/36167 cut-off events. [2025-04-14 01:26:25,035 INFO L117 PetriNetUnfolderBase]: For 48938/48938 co-relation queries the response was YES. [2025-04-14 01:26:25,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106709 conditions, 36167 events. 27944/36167 cut-off events. For 48938/48938 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 180526 event pairs, 3435 based on Foata normal form. 0/27352 useless extension candidates. Maximal degree in co-relation 106699. Up to 9704 conditions per place. [2025-04-14 01:26:25,185 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 236 selfloop transitions, 18 changer transitions 0/254 dead transitions. [2025-04-14 01:26:25,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 254 transitions, 2060 flow [2025-04-14 01:26:25,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:26:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:26:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2025-04-14 01:26:25,186 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2025-04-14 01:26:25,186 INFO L175 Difference]: Start difference. First operand has 47 places, 52 transitions, 304 flow. Second operand 8 states and 177 transitions. [2025-04-14 01:26:25,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 254 transitions, 2060 flow [2025-04-14 01:26:25,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 254 transitions, 1800 flow, removed 130 selfloop flow, removed 0 redundant places. [2025-04-14 01:26:25,217 INFO L231 Difference]: Finished difference. Result has 58 places, 70 transitions, 376 flow [2025-04-14 01:26:25,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=58, PETRI_TRANSITIONS=70} [2025-04-14 01:26:25,217 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2025-04-14 01:26:25,217 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 70 transitions, 376 flow [2025-04-14 01:26:25,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:25,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:25,218 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:25,338 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 01:26:25,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 01:26:25,422 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:25,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash -205040908, now seen corresponding path program 2 times [2025-04-14 01:26:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:25,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153037958] [2025-04-14 01:26:25,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:26:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:25,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:26:25,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:26:25,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:26:25,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:25,559 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 01:26:25,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:25,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153037958] [2025-04-14 01:26:25,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153037958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:25,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:25,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:26:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38468686] [2025-04-14 01:26:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:25,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:26:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:25,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:26:25,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:26:25,560 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:25,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 70 transitions, 376 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:25,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:25,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:25,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:27,468 INFO L116 PetriNetUnfolderBase]: 29650/38611 cut-off events. [2025-04-14 01:26:27,468 INFO L117 PetriNetUnfolderBase]: For 57046/57046 co-relation queries the response was YES. [2025-04-14 01:26:27,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125996 conditions, 38611 events. 29650/38611 cut-off events. For 57046/57046 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 197851 event pairs, 6235 based on Foata normal form. 0/31890 useless extension candidates. Maximal degree in co-relation 125981. Up to 15149 conditions per place. [2025-04-14 01:26:27,652 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 145 selfloop transitions, 16 changer transitions 0/161 dead transitions. [2025-04-14 01:26:27,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 161 transitions, 1193 flow [2025-04-14 01:26:27,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:26:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:26:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-04-14 01:26:27,653 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-14 01:26:27,653 INFO L175 Difference]: Start difference. First operand has 58 places, 70 transitions, 376 flow. Second operand 5 states and 104 transitions. [2025-04-14 01:26:27,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 161 transitions, 1193 flow [2025-04-14 01:26:27,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 161 transitions, 1179 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-04-14 01:26:27,891 INFO L231 Difference]: Finished difference. Result has 63 places, 72 transitions, 420 flow [2025-04-14 01:26:27,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=420, PETRI_PLACES=63, PETRI_TRANSITIONS=72} [2025-04-14 01:26:27,892 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2025-04-14 01:26:27,892 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 72 transitions, 420 flow [2025-04-14 01:26:27,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:27,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:27,892 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:27,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:26:27,892 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:27,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:27,893 INFO L85 PathProgramCache]: Analyzing trace with hash -39297588, now seen corresponding path program 3 times [2025-04-14 01:26:27,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:27,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480771976] [2025-04-14 01:26:27,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:26:27,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:27,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:26:27,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:26:27,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:26:27,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:28,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:28,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480771976] [2025-04-14 01:26:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480771976] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:26:28,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495159809] [2025-04-14 01:26:28,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:26:28,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:28,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:28,030 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 01:26:28,031 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 01:26:28,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:26:28,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:26:28,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:26:28,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:28,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:26:28,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:26:28,129 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 01:26:28,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:26:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495159809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:26:28,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:26:28,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-14 01:26:28,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845337966] [2025-04-14 01:26:28,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:26:28,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:26:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:28,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:26:28,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:26:28,186 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:28,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 72 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:28,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:28,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:28,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:31,657 INFO L116 PetriNetUnfolderBase]: 50852/66623 cut-off events. [2025-04-14 01:26:31,657 INFO L117 PetriNetUnfolderBase]: For 127890/127890 co-relation queries the response was YES. [2025-04-14 01:26:31,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228908 conditions, 66623 events. 50852/66623 cut-off events. For 127890/127890 co-relation queries the response was YES. Maximal size of possible extension queue 2401. Compared 371223 event pairs, 6244 based on Foata normal form. 0/60617 useless extension candidates. Maximal degree in co-relation 228891. Up to 17092 conditions per place. [2025-04-14 01:26:32,016 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 321 selfloop transitions, 39 changer transitions 0/360 dead transitions. [2025-04-14 01:26:32,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 360 transitions, 2788 flow [2025-04-14 01:26:32,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:26:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:26:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions. [2025-04-14 01:26:32,018 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5337995337995338 [2025-04-14 01:26:32,018 INFO L175 Difference]: Start difference. First operand has 63 places, 72 transitions, 420 flow. Second operand 11 states and 229 transitions. [2025-04-14 01:26:32,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 360 transitions, 2788 flow [2025-04-14 01:26:32,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 360 transitions, 2739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:26:32,269 INFO L231 Difference]: Finished difference. Result has 77 places, 102 transitions, 689 flow [2025-04-14 01:26:32,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=689, PETRI_PLACES=77, PETRI_TRANSITIONS=102} [2025-04-14 01:26:32,270 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2025-04-14 01:26:32,270 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 102 transitions, 689 flow [2025-04-14 01:26:32,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:32,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:32,270 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:32,276 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 01:26:32,475 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,SelfDestructingSolverStorable7 [2025-04-14 01:26:32,475 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:32,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1468816826, now seen corresponding path program 1 times [2025-04-14 01:26:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:32,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665568147] [2025-04-14 01:26:32,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:26:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:32,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:26:32,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:26:32,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:32,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:32,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665568147] [2025-04-14 01:26:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665568147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:32,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:26:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416016276] [2025-04-14 01:26:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:32,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:26:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:32,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:26:32,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:26:32,606 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:32,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 102 transitions, 689 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:32,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:32,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:32,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:36,793 INFO L116 PetriNetUnfolderBase]: 53075/69475 cut-off events. [2025-04-14 01:26:36,794 INFO L117 PetriNetUnfolderBase]: For 212534/212534 co-relation queries the response was YES. [2025-04-14 01:26:37,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305340 conditions, 69475 events. 53075/69475 cut-off events. For 212534/212534 co-relation queries the response was YES. Maximal size of possible extension queue 2482. Compared 384477 event pairs, 17026 based on Foata normal form. 0/63091 useless extension candidates. Maximal degree in co-relation 305317. Up to 57370 conditions per place. [2025-04-14 01:26:37,232 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 150 selfloop transitions, 12 changer transitions 23/185 dead transitions. [2025-04-14 01:26:37,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 185 transitions, 1642 flow [2025-04-14 01:26:37,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:26:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:26:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-04-14 01:26:37,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-14 01:26:37,233 INFO L175 Difference]: Start difference. First operand has 77 places, 102 transitions, 689 flow. Second operand 5 states and 105 transitions. [2025-04-14 01:26:37,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 185 transitions, 1642 flow [2025-04-14 01:26:38,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 185 transitions, 1642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:26:38,826 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 762 flow [2025-04-14 01:26:38,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=762, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2025-04-14 01:26:38,827 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 44 predicate places. [2025-04-14 01:26:38,827 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 106 transitions, 762 flow [2025-04-14 01:26:38,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:38,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:38,827 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:38,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:26:38,827 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:38,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash -267757728, now seen corresponding path program 4 times [2025-04-14 01:26:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:38,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658227835] [2025-04-14 01:26:38,828 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:26:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:38,832 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:26:38,839 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:26:38,839 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:26:38,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:38,989 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 01:26:38,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:38,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658227835] [2025-04-14 01:26:38,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658227835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:26:38,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:26:38,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:26:38,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255218281] [2025-04-14 01:26:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:26:38,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:26:38,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:38,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:26:38,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:26:38,991 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:38,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 106 transitions, 762 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:38,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:38,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:38,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:43,969 INFO L116 PetriNetUnfolderBase]: 65807/85870 cut-off events. [2025-04-14 01:26:43,969 INFO L117 PetriNetUnfolderBase]: For 321421/321421 co-relation queries the response was YES. [2025-04-14 01:26:44,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400874 conditions, 85870 events. 65807/85870 cut-off events. For 321421/321421 co-relation queries the response was YES. Maximal size of possible extension queue 3101. Compared 486344 event pairs, 14194 based on Foata normal form. 696/78346 useless extension candidates. Maximal degree in co-relation 400848. Up to 33504 conditions per place. [2025-04-14 01:26:44,879 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 175 selfloop transitions, 45 changer transitions 9/229 dead transitions. [2025-04-14 01:26:44,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 229 transitions, 2094 flow [2025-04-14 01:26:44,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:26:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:26:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-14 01:26:44,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2025-04-14 01:26:44,880 INFO L175 Difference]: Start difference. First operand has 83 places, 106 transitions, 762 flow. Second operand 5 states and 100 transitions. [2025-04-14 01:26:44,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 229 transitions, 2094 flow [2025-04-14 01:26:50,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 229 transitions, 2062 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-14 01:26:50,998 INFO L231 Difference]: Finished difference. Result has 86 places, 123 transitions, 1029 flow [2025-04-14 01:26:50,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1029, PETRI_PLACES=86, PETRI_TRANSITIONS=123} [2025-04-14 01:26:50,999 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2025-04-14 01:26:50,999 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 123 transitions, 1029 flow [2025-04-14 01:26:50,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:50,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:50,999 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:26:50,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:26:50,999 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:26:51,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:51,000 INFO L85 PathProgramCache]: Analyzing trace with hash 205733962, now seen corresponding path program 2 times [2025-04-14 01:26:51,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:51,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632667882] [2025-04-14 01:26:51,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:26:51,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:51,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:26:51,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:26:51,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:26:51,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:51,195 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 01:26:51,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:51,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632667882] [2025-04-14 01:26:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632667882] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:26:51,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211335585] [2025-04-14 01:26:51,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:26:51,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:51,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:51,198 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 01:26:51,199 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 01:26:51,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:26:51,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:26:51,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:26:51,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:51,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:26:51,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:26:51,294 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 01:26:51,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:26:51,349 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 01:26:51,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211335585] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:26:51,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:26:51,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2025-04-14 01:26:51,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138785340] [2025-04-14 01:26:51,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:26:51,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:26:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:51,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:26:51,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:26:51,350 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:26:51,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 123 transitions, 1029 flow. Second operand has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 14 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:51,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:51,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:26:51,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:03,162 INFO L116 PetriNetUnfolderBase]: 137407/176372 cut-off events. [2025-04-14 01:27:03,163 INFO L117 PetriNetUnfolderBase]: For 898697/898697 co-relation queries the response was YES. [2025-04-14 01:27:04,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884719 conditions, 176372 events. 137407/176372 cut-off events. For 898697/898697 co-relation queries the response was YES. Maximal size of possible extension queue 5668. Compared 1015642 event pairs, 22485 based on Foata normal form. 2496/162846 useless extension candidates. Maximal degree in co-relation 884692. Up to 82772 conditions per place. [2025-04-14 01:27:04,858 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 650 selfloop transitions, 194 changer transitions 8/852 dead transitions. [2025-04-14 01:27:04,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 852 transitions, 8495 flow [2025-04-14 01:27:04,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 01:27:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 01:27:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 415 transitions. [2025-04-14 01:27:04,860 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4836829836829837 [2025-04-14 01:27:04,860 INFO L175 Difference]: Start difference. First operand has 86 places, 123 transitions, 1029 flow. Second operand 22 states and 415 transitions. [2025-04-14 01:27:04,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 852 transitions, 8495 flow [2025-04-14 01:27:30,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 852 transitions, 8195 flow, removed 85 selfloop flow, removed 1 redundant places. [2025-04-14 01:27:30,733 INFO L231 Difference]: Finished difference. Result has 120 places, 336 transitions, 3804 flow [2025-04-14 01:27:30,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3804, PETRI_PLACES=120, PETRI_TRANSITIONS=336} [2025-04-14 01:27:30,734 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 81 predicate places. [2025-04-14 01:27:30,734 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 336 transitions, 3804 flow [2025-04-14 01:27:30,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 14 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:30,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:30,734 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:27:30,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:27:30,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:30,935 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:27:30,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash 812311832, now seen corresponding path program 3 times [2025-04-14 01:27:30,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:30,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728255899] [2025-04-14 01:27:30,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:27:30,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:30,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:27:30,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:27:30,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:27:30,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:31,059 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 01:27:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:31,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728255899] [2025-04-14 01:27:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728255899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:27:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:27:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:27:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25264718] [2025-04-14 01:27:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:27:31,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:27:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:31,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:27:31,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:27:31,060 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:27:31,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 336 transitions, 3804 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:31,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:31,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:27:31,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:46,078 INFO L116 PetriNetUnfolderBase]: 148742/192316 cut-off events. [2025-04-14 01:27:46,078 INFO L117 PetriNetUnfolderBase]: For 1808494/1808494 co-relation queries the response was YES. [2025-04-14 01:27:47,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077039 conditions, 192316 events. 148742/192316 cut-off events. For 1808494/1808494 co-relation queries the response was YES. Maximal size of possible extension queue 6189. Compared 1144235 event pairs, 39480 based on Foata normal form. 480/183694 useless extension candidates. Maximal degree in co-relation 1076998. Up to 136167 conditions per place. [2025-04-14 01:27:48,380 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 486 selfloop transitions, 73 changer transitions 14/573 dead transitions. [2025-04-14 01:27:48,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 573 transitions, 6994 flow [2025-04-14 01:27:48,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:27:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:27:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-04-14 01:27:48,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4775641025641026 [2025-04-14 01:27:48,381 INFO L175 Difference]: Start difference. First operand has 120 places, 336 transitions, 3804 flow. Second operand 8 states and 149 transitions. [2025-04-14 01:27:48,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 573 transitions, 6994 flow [2025-04-14 01:29:30,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 573 transitions, 6482 flow, removed 192 selfloop flow, removed 3 redundant places. [2025-04-14 01:29:30,669 INFO L231 Difference]: Finished difference. Result has 128 places, 357 transitions, 3801 flow [2025-04-14 01:29:30,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3362, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3801, PETRI_PLACES=128, PETRI_TRANSITIONS=357} [2025-04-14 01:29:30,674 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 89 predicate places. [2025-04-14 01:29:30,674 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 357 transitions, 3801 flow [2025-04-14 01:29:30,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:29:30,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:29:30,674 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:29:30,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:29:30,674 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:29:30,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:29:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 891700136, now seen corresponding path program 4 times [2025-04-14 01:29:30,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:29:30,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977119199] [2025-04-14 01:29:30,675 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:29:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:29:30,682 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:29:30,690 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:29:30,690 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:29:30,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:29:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:29:30,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:29:30,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977119199] [2025-04-14 01:29:30,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977119199] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:29:30,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:29:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:29:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333730831] [2025-04-14 01:29:30,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:29:30,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:29:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:29:30,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:29:30,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:29:30,788 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:29:30,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 357 transitions, 3801 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:29:30,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:29:30,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:29:30,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:29:46,307 INFO L116 PetriNetUnfolderBase]: 147970/191244 cut-off events. [2025-04-14 01:29:46,307 INFO L117 PetriNetUnfolderBase]: For 1720001/1720001 co-relation queries the response was YES. [2025-04-14 01:29:48,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045566 conditions, 191244 events. 147970/191244 cut-off events. For 1720001/1720001 co-relation queries the response was YES. Maximal size of possible extension queue 6172. Compared 1138022 event pairs, 41581 based on Foata normal form. 0/182896 useless extension candidates. Maximal degree in co-relation 1045520. Up to 139361 conditions per place. [2025-04-14 01:29:48,896 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 361 selfloop transitions, 56 changer transitions 25/442 dead transitions. [2025-04-14 01:29:48,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 442 transitions, 5296 flow [2025-04-14 01:29:48,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:29:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:29:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-04-14 01:29:48,897 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5743589743589743 [2025-04-14 01:29:48,897 INFO L175 Difference]: Start difference. First operand has 128 places, 357 transitions, 3801 flow. Second operand 5 states and 112 transitions. [2025-04-14 01:29:48,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 442 transitions, 5296 flow [2025-04-14 01:30:34,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 442 transitions, 5200 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-14 01:30:34,400 INFO L231 Difference]: Finished difference. Result has 132 places, 357 transitions, 3841 flow [2025-04-14 01:30:34,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3705, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3841, PETRI_PLACES=132, PETRI_TRANSITIONS=357} [2025-04-14 01:30:34,400 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 93 predicate places. [2025-04-14 01:30:34,401 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 357 transitions, 3841 flow [2025-04-14 01:30:34,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:30:34,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:30:34,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:30:34,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:30:34,401 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 01:30:34,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:30:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1626526118, now seen corresponding path program 5 times [2025-04-14 01:30:34,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:30:34,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210241211] [2025-04-14 01:30:34,403 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:30:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:30:34,407 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:30:34,412 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:30:34,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:30:34,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:34,461 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 01:30:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:30:34,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210241211] [2025-04-14 01:30:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210241211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:30:34,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:30:34,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:30:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023173605] [2025-04-14 01:30:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:30:34,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:30:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:30:34,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:30:34,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:30:34,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2025-04-14 01:30:34,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 357 transitions, 3841 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:30:34,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:30:34,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2025-04-14 01:30:34,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand