/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt-zero.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:16:43,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:16:43,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:16:43,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:16:43,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:16:43,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:16:43,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:16:43,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:16:43,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:16:43,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:16:43,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:16:43,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:16:43,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:16:43,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:16:43,421 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:16:43,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:16:43,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:16:43,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:16:43,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:16:43,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:43,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:43,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:43,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:16:43,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:16:43,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:16:43,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:16:43,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:16:43,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:16:43,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:16:43,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:16:43,680 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:16:43,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt-zero.i [2025-04-13 19:16:44,939 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942050dce/93287d75dbd041bab517e7cc9ef97895/FLAGe38b51e00 [2025-04-13 19:16:45,186 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:16:45,187 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt-zero.i [2025-04-13 19:16:45,199 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942050dce/93287d75dbd041bab517e7cc9ef97895/FLAGe38b51e00 [2025-04-13 19:16:45,990 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942050dce/93287d75dbd041bab517e7cc9ef97895 [2025-04-13 19:16:45,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:16:45,994 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:16:45,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:45,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:16:45,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:16:45,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:45" (1/1) ... [2025-04-13 19:16:45,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b1894c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:45, skipping insertion in model container [2025-04-13 19:16:45,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:45" (1/1) ... [2025-04-13 19:16:46,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:16:46,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt-zero.i[30843,30856] [2025-04-13 19:16:46,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:46,310 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:16:46,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt-zero.i[30843,30856] [2025-04-13 19:16:46,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:46,396 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:16:46,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46 WrapperNode [2025-04-13 19:16:46,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:46,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:46,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:16:46,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:16:46,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,423 INFO L138 Inliner]: procedures = 164, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-04-13 19:16:46,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:46,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:16:46,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:16:46,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:16:46,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,451 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-04-13 19:16:46,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:16:46,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:16:46,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:16:46,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:16:46,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (1/1) ... [2025-04-13 19:16:46,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:46,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:46,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:16:46,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:16:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:16:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:16:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:16:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:16:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:16:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:16:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:16:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:16:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:16:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:16:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:16:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:16:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:16:46,513 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:16:46,601 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:16:46,602 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:16:46,720 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:16:46,721 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:16:46,721 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:16:46,836 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:16:46,840 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:16:46,845 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-13 19:16:46,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:46 BoogieIcfgContainer [2025-04-13 19:16:46,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:16:46,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:16:46,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:16:46,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:16:46,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:16:45" (1/3) ... [2025-04-13 19:16:46,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3d31a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:46, skipping insertion in model container [2025-04-13 19:16:46,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:46" (2/3) ... [2025-04-13 19:16:46,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3d31a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:46, skipping insertion in model container [2025-04-13 19:16:46,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:46" (3/3) ... [2025-04-13 19:16:46,852 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-04-13 19:16:46,862 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:16:46,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 12 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 19:16:46,864 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:16:46,897 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:46,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 16 transitions, 36 flow [2025-04-13 19:16:46,948 INFO L116 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-04-13 19:16:46,951 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:46,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 16 events. 3/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 24 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-13 19:16:46,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 16 transitions, 36 flow [2025-04-13 19:16:46,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 15 transitions, 34 flow [2025-04-13 19:16:46,966 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:46,975 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;@34117ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:46,975 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:16:46,981 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:46,981 INFO L116 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-04-13 19:16:46,981 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:46,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:46,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:16:46,982 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:16:46,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 7405686, now seen corresponding path program 1 times [2025-04-13 19:16:46,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:46,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083295477] [2025-04-13 19:16:46,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:46,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:47,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:47,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:47,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:47,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:47,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083295477] [2025-04-13 19:16:47,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083295477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:47,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:47,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:16:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095160871] [2025-04-13 19:16:47,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:47,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:16:47,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:47,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:16:47,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:16:47,271 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2025-04-13 19:16:47,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 15 transitions, 34 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:47,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:47,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2025-04-13 19:16:47,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:47,307 INFO L116 PetriNetUnfolderBase]: 8/27 cut-off events. [2025-04-13 19:16:47,307 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:47,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 27 events. 8/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 6 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 43. Up to 24 conditions per place. [2025-04-13 19:16:47,308 INFO L140 encePairwiseOnDemand]: 13/16 looper letters, 10 selfloop transitions, 0 changer transitions 0/12 dead transitions. [2025-04-13 19:16:47,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 12 transitions, 48 flow [2025-04-13 19:16:47,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:16:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:16:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 17 transitions. [2025-04-13 19:16:47,318 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-04-13 19:16:47,319 INFO L175 Difference]: Start difference. First operand has 15 places, 15 transitions, 34 flow. Second operand 2 states and 17 transitions. [2025-04-13 19:16:47,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 12 transitions, 48 flow [2025-04-13 19:16:47,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 48 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:47,324 INFO L231 Difference]: Finished difference. Result has 15 places, 12 transitions, 28 flow [2025-04-13 19:16:47,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=28, PETRI_PLACES=15, PETRI_TRANSITIONS=12} [2025-04-13 19:16:47,330 INFO L279 CegarLoopForPetriNet]: 15 programPoint places, 0 predicate places. [2025-04-13 19:16:47,330 INFO L485 AbstractCegarLoop]: Abstraction has has 15 places, 12 transitions, 28 flow [2025-04-13 19:16:47,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:47,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:47,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:16:47,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:16:47,331 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:16:47,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:47,332 INFO L85 PathProgramCache]: Analyzing trace with hash 7405414, now seen corresponding path program 1 times [2025-04-13 19:16:47,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:47,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260138190] [2025-04-13 19:16:47,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:47,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:47,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:47,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:47,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:47,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:47,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:47,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:47,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:47,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:47,371 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:47,372 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 19:16:47,373 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 19:16:47,373 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 19:16:47,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:16:47,374 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:16:47,376 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:47,376 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:16:47,398 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:47,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 27 transitions, 64 flow [2025-04-13 19:16:47,412 INFO L116 PetriNetUnfolderBase]: 6/29 cut-off events. [2025-04-13 19:16:47,413 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:16:47,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 29 events. 6/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 3 conditions per place. [2025-04-13 19:16:47,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 27 transitions, 64 flow [2025-04-13 19:16:47,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 26 transitions, 62 flow [2025-04-13 19:16:47,414 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:47,414 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;@34117ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:47,414 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:16:47,420 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:47,420 INFO L116 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-04-13 19:16:47,420 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:16:47,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:47,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:16:47,420 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:16:47,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash 8246784, now seen corresponding path program 1 times [2025-04-13 19:16:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:47,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914755617] [2025-04-13 19:16:47,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:47,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:47,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:47,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:47,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:47,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914755617] [2025-04-13 19:16:47,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914755617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:47,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:47,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:16:47,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511206907] [2025-04-13 19:16:47,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:47,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:16:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:47,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:16:47,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:16:47,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2025-04-13 19:16:47,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 26 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:47,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:47,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2025-04-13 19:16:47,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:47,596 INFO L116 PetriNetUnfolderBase]: 162/285 cut-off events. [2025-04-13 19:16:47,596 INFO L117 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-04-13 19:16:47,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 285 events. 162/285 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 940 event pairs, 132 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 324. Up to 276 conditions per place. [2025-04-13 19:16:47,599 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-04-13 19:16:47,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 88 flow [2025-04-13 19:16:47,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:16:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:16:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2025-04-13 19:16:47,604 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-13 19:16:47,604 INFO L175 Difference]: Start difference. First operand has 25 places, 26 transitions, 62 flow. Second operand 2 states and 29 transitions. [2025-04-13 19:16:47,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 88 flow [2025-04-13 19:16:47,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:47,605 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 52 flow [2025-04-13 19:16:47,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 19:16:47,606 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-13 19:16:47,606 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 52 flow [2025-04-13 19:16:47,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:47,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:47,606 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 19:16:47,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:16:47,606 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:16:47,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:47,606 INFO L85 PathProgramCache]: Analyzing trace with hash -665324999, now seen corresponding path program 1 times [2025-04-13 19:16:47,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:47,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932832947] [2025-04-13 19:16:47,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:47,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:47,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:47,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:47,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:47,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:47,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:47,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:47,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:47,632 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:47,632 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:16:47,632 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:16:47,633 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 19:16:47,633 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:16:47,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:16:47,633 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:16:47,633 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:47,633 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:16:47,660 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:47,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 38 transitions, 94 flow [2025-04-13 19:16:47,671 INFO L116 PetriNetUnfolderBase]: 9/42 cut-off events. [2025-04-13 19:16:47,671 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:16:47,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 42 events. 9/42 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2025-04-13 19:16:47,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 38 transitions, 94 flow [2025-04-13 19:16:47,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 37 transitions, 92 flow [2025-04-13 19:16:47,674 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:47,674 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;@34117ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:47,674 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:16:47,681 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:47,681 INFO L116 PetriNetUnfolderBase]: 1/8 cut-off events. [2025-04-13 19:16:47,681 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:16:47,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:47,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:16:47,681 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:16:47,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash 9426186, now seen corresponding path program 1 times [2025-04-13 19:16:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:47,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831382656] [2025-04-13 19:16:47,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:47,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:47,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:47,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:47,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:47,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:47,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831382656] [2025-04-13 19:16:47,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831382656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:47,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:47,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:16:47,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664096756] [2025-04-13 19:16:47,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:47,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:16:47,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:47,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:16:47,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:16:47,769 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-13 19:16:47,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:47,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:47,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-13 19:16:47,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:48,008 INFO L116 PetriNetUnfolderBase]: 1926/2766 cut-off events. [2025-04-13 19:16:48,008 INFO L117 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2025-04-13 19:16:48,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5715 conditions, 2766 events. 1926/2766 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11847 event pairs, 1602 based on Foata normal form. 0/2432 useless extension candidates. Maximal degree in co-relation 2174. Up to 2726 conditions per place. [2025-04-13 19:16:48,023 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2025-04-13 19:16:48,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 130 flow [2025-04-13 19:16:48,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:16:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:16:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2025-04-13 19:16:48,025 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-04-13 19:16:48,025 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 92 flow. Second operand 2 states and 41 transitions. [2025-04-13 19:16:48,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 130 flow [2025-04-13 19:16:48,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 128 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:48,027 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 76 flow [2025-04-13 19:16:48,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-04-13 19:16:48,027 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-04-13 19:16:48,028 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 76 flow [2025-04-13 19:16:48,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:48,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:48,028 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 19:16:48,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:16:48,028 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:16:48,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:48,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1135950623, now seen corresponding path program 1 times [2025-04-13 19:16:48,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:48,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163455676] [2025-04-13 19:16:48,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:48,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:48,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:48,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:48,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:48,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:48,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:48,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:48,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:48,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:48,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:48,058 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:48,058 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:16:48,058 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:16:48,058 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:16:48,058 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:16:48,058 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:16:48,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:16:48,058 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:16:48,059 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:48,059 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:16:48,091 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:48,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 49 transitions, 126 flow [2025-04-13 19:16:48,100 INFO L116 PetriNetUnfolderBase]: 12/55 cut-off events. [2025-04-13 19:16:48,100 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:16:48,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 55 events. 12/55 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 54. Up to 5 conditions per place. [2025-04-13 19:16:48,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 49 transitions, 126 flow [2025-04-13 19:16:48,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 48 transitions, 124 flow [2025-04-13 19:16:48,102 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:48,104 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;@34117ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:48,104 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:16:48,105 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:48,106 INFO L116 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-04-13 19:16:48,106 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:16:48,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:48,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:16:48,106 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:16:48,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 10944532, now seen corresponding path program 1 times [2025-04-13 19:16:48,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:48,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363722875] [2025-04-13 19:16:48,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:48,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:48,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:48,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:48,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:48,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:48,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363722875] [2025-04-13 19:16:48,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363722875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:48,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:48,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:16:48,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894240203] [2025-04-13 19:16:48,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:48,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:16:48,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:48,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:16:48,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:16:48,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 49 [2025-04-13 19:16:48,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 124 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:48,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:48,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 49 [2025-04-13 19:16:48,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:49,735 INFO L116 PetriNetUnfolderBase]: 19076/24922 cut-off events. [2025-04-13 19:16:49,736 INFO L117 PetriNetUnfolderBase]: For 3968/3968 co-relation queries the response was YES. [2025-04-13 19:16:49,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51539 conditions, 24922 events. 19076/24922 cut-off events. For 3968/3968 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 120893 event pairs, 16008 based on Foata normal form. 0/21790 useless extension candidates. Maximal degree in co-relation 7922. Up to 24678 conditions per place. [2025-04-13 19:16:49,977 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 34 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-04-13 19:16:49,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 174 flow [2025-04-13 19:16:49,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:16:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:16:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2025-04-13 19:16:49,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2025-04-13 19:16:49,979 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 124 flow. Second operand 2 states and 53 transitions. [2025-04-13 19:16:49,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 174 flow [2025-04-13 19:16:49,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 168 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:49,982 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 100 flow [2025-04-13 19:16:49,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-04-13 19:16:49,982 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2025-04-13 19:16:49,982 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 100 flow [2025-04-13 19:16:49,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:49,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:49,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:49,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:16:49,983 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:16:49,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1456202772, now seen corresponding path program 1 times [2025-04-13 19:16:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:49,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934253209] [2025-04-13 19:16:49,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:49,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:49,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:49,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:49,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:50,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934253209] [2025-04-13 19:16:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934253209] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:16:50,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730371145] [2025-04-13 19:16:50,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:50,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:50,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:50,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:50,026 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-04-13 19:16:50,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:50,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:50,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-04-13 19:16:50,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:51,571 INFO L116 PetriNetUnfolderBase]: 24526/31944 cut-off events. [2025-04-13 19:16:51,571 INFO L117 PetriNetUnfolderBase]: For 1785/1785 co-relation queries the response was YES. [2025-04-13 19:16:51,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65219 conditions, 31944 events. 24526/31944 cut-off events. For 1785/1785 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 157856 event pairs, 18409 based on Foata normal form. 0/27322 useless extension candidates. Maximal degree in co-relation 65212. Up to 28203 conditions per place. [2025-04-13 19:16:51,778 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 59 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-04-13 19:16:51,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 289 flow [2025-04-13 19:16:51,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-04-13 19:16:51,781 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2025-04-13 19:16:51,781 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 100 flow. Second operand 3 states and 74 transitions. [2025-04-13 19:16:51,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 289 flow [2025-04-13 19:16:51,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:51,789 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 112 flow [2025-04-13 19:16:51,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-04-13 19:16:51,790 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2025-04-13 19:16:51,790 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 112 flow [2025-04-13 19:16:51,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:51,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:51,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:51,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:16:51,791 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:16:51,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2077449681, now seen corresponding path program 1 times [2025-04-13 19:16:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:51,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775972844] [2025-04-13 19:16:51,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:51,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:16:51,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:16:51,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:51,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:51,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775972844] [2025-04-13 19:16:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775972844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:16:51,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175233021] [2025-04-13 19:16:51,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:51,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:51,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:16:51,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:16:51,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:16:51,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:16:51,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:51,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:51,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:16:51,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:16:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:51,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:16:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175233021] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:16:51,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:16:51,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-13 19:16:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521358031] [2025-04-13 19:16:51,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:16:51,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:16:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:51,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:16:51,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:16:51,976 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-04-13 19:16:51,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:51,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:51,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-04-13 19:16:51,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:53,708 INFO L116 PetriNetUnfolderBase]: 27251/35430 cut-off events. [2025-04-13 19:16:53,708 INFO L117 PetriNetUnfolderBase]: For 5848/5848 co-relation queries the response was YES. [2025-04-13 19:16:53,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77203 conditions, 35430 events. 27251/35430 cut-off events. For 5848/5848 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 176058 event pairs, 16271 based on Foata normal form. 0/30519 useless extension candidates. Maximal degree in co-relation 77194. Up to 28203 conditions per place. [2025-04-13 19:16:53,857 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 84 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2025-04-13 19:16:53,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 91 transitions, 420 flow [2025-04-13 19:16:53,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:16:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:16:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-04-13 19:16:53,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-04-13 19:16:53,859 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 112 flow. Second operand 4 states and 104 transitions. [2025-04-13 19:16:53,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 91 transitions, 420 flow [2025-04-13 19:16:53,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 91 transitions, 416 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:53,863 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 124 flow [2025-04-13 19:16:53,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2025-04-13 19:16:53,864 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2025-04-13 19:16:53,864 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 124 flow [2025-04-13 19:16:53,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:53,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:53,865 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:53,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:16:54,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:16:54,069 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:16:54,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash 748603326, now seen corresponding path program 1 times [2025-04-13 19:16:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:54,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112641903] [2025-04-13 19:16:54,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:54,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:16:54,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:16:54,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:54,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:54,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:54,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:16:54,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:16:54,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:54,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:54,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:54,084 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:54,084 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:16:54,084 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:16:54,084 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:16:54,084 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:16:54,084 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:16:54,084 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:16:54,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:16:54,084 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 19:16:54,085 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:54,085 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:16:54,123 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:54,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 60 transitions, 160 flow [2025-04-13 19:16:54,130 INFO L116 PetriNetUnfolderBase]: 15/68 cut-off events. [2025-04-13 19:16:54,130 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:16:54,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 68 events. 15/68 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 178 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 73. Up to 6 conditions per place. [2025-04-13 19:16:54,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 60 transitions, 160 flow [2025-04-13 19:16:54,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 59 transitions, 158 flow [2025-04-13 19:16:54,131 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:54,131 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;@34117ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:54,131 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:16:54,133 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:54,133 INFO L116 PetriNetUnfolderBase]: 1/8 cut-off events. [2025-04-13 19:16:54,133 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:16:54,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:54,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:16:54,133 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:16:54,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash 12800862, now seen corresponding path program 1 times [2025-04-13 19:16:54,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:54,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912726501] [2025-04-13 19:16:54,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:54,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:54,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:54,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:54,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:54,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:54,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:54,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912726501] [2025-04-13 19:16:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912726501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:54,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:16:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311207977] [2025-04-13 19:16:54,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:54,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:16:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:54,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:16:54,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:16:54,169 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-04-13 19:16:54,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:54,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:54,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-04-13 19:16:54,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:04,901 INFO L116 PetriNetUnfolderBase]: 172740/213646 cut-off events. [2025-04-13 19:17:04,901 INFO L117 PetriNetUnfolderBase]: For 42638/42638 co-relation queries the response was YES. [2025-04-13 19:17:05,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441948 conditions, 213646 events. 172740/213646 cut-off events. For 42638/42638 co-relation queries the response was YES. Maximal size of possible extension queue 4643. Compared 1116745 event pairs, 145662 based on Foata normal form. 0/186126 useless extension candidates. Maximal degree in co-relation 51933. Up to 211956 conditions per place. [2025-04-13 19:17:06,008 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 42 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2025-04-13 19:17:06,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 220 flow [2025-04-13 19:17:06,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:17:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:17:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2025-04-13 19:17:06,010 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-04-13 19:17:06,010 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 158 flow. Second operand 2 states and 65 transitions. [2025-04-13 19:17:06,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 220 flow [2025-04-13 19:17:06,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 208 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 19:17:06,023 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 124 flow [2025-04-13 19:17:06,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-04-13 19:17:06,024 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2025-04-13 19:17:06,024 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 124 flow [2025-04-13 19:17:06,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:06,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:06,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:06,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:17:06,024 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:17:06,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2125528798, now seen corresponding path program 1 times [2025-04-13 19:17:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:06,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472805904] [2025-04-13 19:17:06,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:06,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:17:06,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:17:06,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:06,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:06,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:06,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472805904] [2025-04-13 19:17:06,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472805904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:06,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:06,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:17:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163488732] [2025-04-13 19:17:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:06,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:17:06,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:06,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:17:06,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:17:06,056 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 60 [2025-04-13 19:17:06,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:06,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:06,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 60 [2025-04-13 19:17:06,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:18,794 INFO L116 PetriNetUnfolderBase]: 222094/274389 cut-off events. [2025-04-13 19:17:18,794 INFO L117 PetriNetUnfolderBase]: For 14286/14286 co-relation queries the response was YES. [2025-04-13 19:17:19,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557712 conditions, 274389 events. 222094/274389 cut-off events. For 14286/14286 co-relation queries the response was YES. Maximal size of possible extension queue 5479. Compared 1461691 event pairs, 167271 based on Foata normal form. 0/235059 useless extension candidates. Maximal degree in co-relation 557704. Up to 242235 conditions per place. [2025-04-13 19:17:20,433 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 75 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-04-13 19:17:20,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 366 flow [2025-04-13 19:17:20,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:17:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:17:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-04-13 19:17:20,445 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-04-13 19:17:20,445 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 124 flow. Second operand 3 states and 93 transitions. [2025-04-13 19:17:20,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 366 flow [2025-04-13 19:17:20,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:17:20,495 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 136 flow [2025-04-13 19:17:20,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2025-04-13 19:17:20,496 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2025-04-13 19:17:20,496 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 136 flow [2025-04-13 19:17:20,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:20,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:20,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:20,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:17:20,497 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:17:20,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1491787991, now seen corresponding path program 1 times [2025-04-13 19:17:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:20,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862608188] [2025-04-13 19:17:20,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:20,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:17:20,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:17:20,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:20,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:20,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:20,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862608188] [2025-04-13 19:17:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862608188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:17:20,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863541801] [2025-04-13 19:17:20,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:20,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:17:20,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:17:20,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:17:20,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:17:20,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:17:20,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:17:20,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:20,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:20,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:17:20,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:17:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:20,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:17:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:20,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863541801] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:17:20,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:17:20,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-13 19:17:20,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032411573] [2025-04-13 19:17:20,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:17:20,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:17:20,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:20,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:17:20,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:17:20,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 60 [2025-04-13 19:17:20,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:20,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:20,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 60 [2025-04-13 19:17:20,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:35,632 INFO L116 PetriNetUnfolderBase]: 246771/304668 cut-off events. [2025-04-13 19:17:35,633 INFO L117 PetriNetUnfolderBase]: For 43349/43349 co-relation queries the response was YES. [2025-04-13 19:17:36,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653084 conditions, 304668 events. 246771/304668 cut-off events. For 43349/43349 co-relation queries the response was YES. Maximal size of possible extension queue 5981. Compared 1635293 event pairs, 150235 based on Foata normal form. 0/262270 useless extension candidates. Maximal degree in co-relation 653074. Up to 242235 conditions per place. [2025-04-13 19:17:37,480 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 108 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-04-13 19:17:37,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 116 transitions, 534 flow [2025-04-13 19:17:37,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:17:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:17:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-04-13 19:17:37,483 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-04-13 19:17:37,483 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 136 flow. Second operand 4 states and 132 transitions. [2025-04-13 19:17:37,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 116 transitions, 534 flow [2025-04-13 19:17:37,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 116 transitions, 530 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:17:37,557 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 148 flow [2025-04-13 19:17:37,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-04-13 19:17:37,557 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2025-04-13 19:17:37,558 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 148 flow [2025-04-13 19:17:37,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:37,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:37,558 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:37,564 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-13 19:17:37,760 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,SelfDestructingSolverStorable12 [2025-04-13 19:17:37,760 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:17:37,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash -974307842, now seen corresponding path program 2 times [2025-04-13 19:17:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:37,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325337278] [2025-04-13 19:17:37,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:17:37,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:37,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 19:17:37,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 10 statements. [2025-04-13 19:17:37,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:17:37,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 19:17:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:37,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325337278] [2025-04-13 19:17:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325337278] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:37,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:37,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:17:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84404650] [2025-04-13 19:17:37,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:37,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:17:37,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:37,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:17:37,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:17:37,805 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-04-13 19:17:37,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:37,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:37,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-04-13 19:17:37,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:50,742 INFO L116 PetriNetUnfolderBase]: 197417/243700 cut-off events. [2025-04-13 19:17:50,743 INFO L117 PetriNetUnfolderBase]: For 84945/101718 co-relation queries the response was YES. [2025-04-13 19:17:51,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540379 conditions, 243700 events. 197417/243700 cut-off events. For 84945/101718 co-relation queries the response was YES. Maximal size of possible extension queue 4915. Compared 1301500 event pairs, 124053 based on Foata normal form. 0/218773 useless extension candidates. Maximal degree in co-relation 540368. Up to 181677 conditions per place. [2025-04-13 19:17:52,316 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 74 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-04-13 19:17:52,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 384 flow [2025-04-13 19:17:52,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:17:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:17:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-04-13 19:17:52,318 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-04-13 19:17:52,318 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 148 flow. Second operand 3 states and 93 transitions. [2025-04-13 19:17:52,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 384 flow [2025-04-13 19:17:52,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 82 transitions, 376 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:17:52,365 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 142 flow [2025-04-13 19:17:52,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2025-04-13 19:17:52,367 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2025-04-13 19:17:52,367 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 142 flow [2025-04-13 19:17:52,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:52,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:52,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:52,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:17:52,367 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:17:52,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1059350171, now seen corresponding path program 1 times [2025-04-13 19:17:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:52,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217620348] [2025-04-13 19:17:52,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:52,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:17:52,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:17:52,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:52,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:17:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:52,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217620348] [2025-04-13 19:17:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217620348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:52,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:52,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:17:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769830486] [2025-04-13 19:17:52,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:52,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:17:52,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:52,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:17:52,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:17:52,430 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 60 [2025-04-13 19:17:52,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:52,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:52,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 60 [2025-04-13 19:17:52,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:18:09,596 INFO L116 PetriNetUnfolderBase]: 253817/313138 cut-off events. [2025-04-13 19:18:09,596 INFO L117 PetriNetUnfolderBase]: For 73340/94928 co-relation queries the response was YES. [2025-04-13 19:18:10,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680141 conditions, 313138 events. 253817/313138 cut-off events. For 73340/94928 co-relation queries the response was YES. Maximal size of possible extension queue 5952. Compared 1664053 event pairs, 174975 based on Foata normal form. 0/276164 useless extension candidates. Maximal degree in co-relation 680130. Up to 276835 conditions per place. [2025-04-13 19:18:11,289 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 76 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-04-13 19:18:11,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 393 flow [2025-04-13 19:18:11,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:18:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:18:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-04-13 19:18:11,290 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:18:11,290 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 142 flow. Second operand 3 states and 90 transitions. [2025-04-13 19:18:11,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 393 flow [2025-04-13 19:18:11,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:18:11,342 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 150 flow [2025-04-13 19:18:11,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-04-13 19:18:11,343 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2025-04-13 19:18:11,343 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 150 flow [2025-04-13 19:18:11,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:18:11,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:18:11,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:18:11,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:18:11,343 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:18:11,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:18:11,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1494978384, now seen corresponding path program 1 times [2025-04-13 19:18:11,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:18:11,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663890241] [2025-04-13 19:18:11,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:18:11,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:18:11,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:18:11,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:18:11,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:18:11,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:18:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:18:11,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:18:11,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663890241] [2025-04-13 19:18:11,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663890241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:18:11,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:18:11,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:18:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250035081] [2025-04-13 19:18:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:18:11,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:18:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:18:11,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:18:11,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:18:11,374 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-04-13 19:18:11,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:18:11,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:18:11,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-04-13 19:18:11,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:18:24,488 INFO L116 PetriNetUnfolderBase]: 197417/243786 cut-off events. [2025-04-13 19:18:24,488 INFO L117 PetriNetUnfolderBase]: For 78590/101748 co-relation queries the response was YES. [2025-04-13 19:18:25,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543670 conditions, 243786 events. 197417/243786 cut-off events. For 78590/101748 co-relation queries the response was YES. Maximal size of possible extension queue 4860. Compared 1304293 event pairs, 117655 based on Foata normal form. 0/225254 useless extension candidates. Maximal degree in co-relation 543658. Up to 173035 conditions per place. [2025-04-13 19:18:25,919 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 74 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-04-13 19:18:25,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 389 flow [2025-04-13 19:18:25,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:18:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:18:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-04-13 19:18:25,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:18:25,920 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 150 flow. Second operand 3 states and 90 transitions. [2025-04-13 19:18:25,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 389 flow [2025-04-13 19:18:25,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 385 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:18:25,961 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 148 flow [2025-04-13 19:18:25,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2025-04-13 19:18:25,962 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2025-04-13 19:18:25,962 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 148 flow [2025-04-13 19:18:25,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:18:25,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:18:25,962 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:18:25,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 19:18:25,962 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:18:25,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:18:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash 171494192, now seen corresponding path program 1 times [2025-04-13 19:18:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:18:25,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214258299] [2025-04-13 19:18:25,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:18:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:18:25,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:18:25,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:18:25,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:18:25,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:18:25,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:18:25,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:18:25,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:18:25,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:18:25,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:18:25,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:18:25,976 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:18:25,977 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 19:18:25,977 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:18:25,977 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 19:18:25,977 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 19:18:25,977 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 19:18:25,977 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 19:18:25,977 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:18:25,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 19:18:25,977 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-04-13 19:18:25,977 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:18:25,978 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 19:18:26,005 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:18:26,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 71 transitions, 196 flow [2025-04-13 19:18:26,012 INFO L116 PetriNetUnfolderBase]: 18/81 cut-off events. [2025-04-13 19:18:26,012 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 19:18:26,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 81 events. 18/81 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 202 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 93. Up to 7 conditions per place. [2025-04-13 19:18:26,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 71 transitions, 196 flow [2025-04-13 19:18:26,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 70 transitions, 194 flow [2025-04-13 19:18:26,015 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:18:26,015 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;@34117ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:18:26,015 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 19:18:26,016 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:18:26,016 INFO L116 PetriNetUnfolderBase]: 1/7 cut-off events. [2025-04-13 19:18:26,016 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:18:26,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:18:26,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:18:26,016 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:18:26,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:18:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash 14996136, now seen corresponding path program 1 times [2025-04-13 19:18:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:18:26,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468696860] [2025-04-13 19:18:26,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:18:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:18:26,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:18:26,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:18:26,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:18:26,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:18:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:18:26,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:18:26,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468696860] [2025-04-13 19:18:26,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468696860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:18:26,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:18:26,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:18:26,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728177446] [2025-04-13 19:18:26,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:18:26,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:18:26,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:18:26,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:18:26,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:18:26,043 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 71 [2025-04-13 19:18:26,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:18:26,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:18:26,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 71 [2025-04-13 19:18:26,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand