/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/11_fmaxsymopt-zero.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:49:57,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:49:57,584 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 23:49:57,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:49:57,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:49:57,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:49:57,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:49:57,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:49:57,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:49:57,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:49:57,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:49:57,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:49:57,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:49:57,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:49:57,623 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:49:57,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:49:57,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:49:57,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:49:57,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:49:57,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:49:57,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:49:57,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:49:57,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:57,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:57,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:49:57,625 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:49:57,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:49:57,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:49:57,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:49:57,876 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:49:57,877 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:49:57,878 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 23:49:59,222 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14fb6297f/68b558cb002b4e6c945e900c2994e7c7/FLAG254ae80ea [2025-04-13 23:49:59,544 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:49:59,545 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/11_fmaxsymopt-zero.i [2025-04-13 23:49:59,562 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14fb6297f/68b558cb002b4e6c945e900c2994e7c7/FLAG254ae80ea [2025-04-13 23:50:00,224 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14fb6297f/68b558cb002b4e6c945e900c2994e7c7 [2025-04-13 23:50:00,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:50:00,228 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:50:00,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:50:00,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:50:00,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:50:00,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268bed0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00, skipping insertion in model container [2025-04-13 23:50:00,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:50:00,590 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 23:50:00,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:50:00,624 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:50:00,678 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 23:50:00,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:50:00,707 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:50:00,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00 WrapperNode [2025-04-13 23:50:00,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:50:00,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:50:00,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:50:00,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:50:00,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,749 INFO L138 Inliner]: procedures = 164, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-04-13 23:50:00,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:50:00,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:50:00,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:50:00,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:50:00,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,766 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 23:50:00,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:50:00,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:50:00,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:50:00,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:50:00,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (1/1) ... [2025-04-13 23:50:00,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:50:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:00,806 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 23:50:00,809 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 23:50:00,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 23:50:00,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:50:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:50:00,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:50:00,827 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:50:00,914 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:50:00,915 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:50:01,042 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:50:01,042 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:50:01,043 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:50:01,195 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:50:01,198 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:50:01,204 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:50:01,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:50:01 BoogieIcfgContainer [2025-04-13 23:50:01,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:50:01,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:50:01,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:50:01,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:50:01,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:50:00" (1/3) ... [2025-04-13 23:50:01,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f207762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:50:01, skipping insertion in model container [2025-04-13 23:50:01,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:50:00" (2/3) ... [2025-04-13 23:50:01,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f207762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:50:01, skipping insertion in model container [2025-04-13 23:50:01,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:50:01" (3/3) ... [2025-04-13 23:50:01,211 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-04-13 23:50:01,223 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:50:01,224 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 23:50:01,224 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:50:01,259 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:01,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 16 transitions, 36 flow [2025-04-13 23:50:01,306 INFO L116 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-04-13 23:50:01,310 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:50:01,312 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 4. Compared 18 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 23:50:01,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 16 transitions, 36 flow [2025-04-13 23:50:01,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 15 transitions, 34 flow [2025-04-13 23:50:01,323 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:01,334 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;@3220e97f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:01,334 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:50:01,342 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:01,343 INFO L116 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-04-13 23:50:01,343 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:50:01,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:01,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:50:01,344 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 23:50:01,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash 6363909, now seen corresponding path program 1 times [2025-04-13 23:50:01,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:01,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380333193] [2025-04-13 23:50:01,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:01,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:01,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:50:01,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:50:01,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:01,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:01,443 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:01,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:50:01,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:50:01,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:01,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:01,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:01,481 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:01,482 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:50:01,483 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:50:01,484 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 23:50:01,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:50:01,484 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 23:50:01,488 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:01,489 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:50:01,546 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:01,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 27 transitions, 64 flow [2025-04-13 23:50:01,560 INFO L116 PetriNetUnfolderBase]: 6/29 cut-off events. [2025-04-13 23:50:01,560 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:50:01,561 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 54 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 23:50:01,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 27 transitions, 64 flow [2025-04-13 23:50:01,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 26 transitions, 62 flow [2025-04-13 23:50:01,565 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:01,565 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;@3220e97f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:01,565 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:50:01,572 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:01,572 INFO L116 PetriNetUnfolderBase]: 1/8 cut-off events. [2025-04-13 23:50:01,572 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:01,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:01,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:50:01,572 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 23:50:01,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:01,573 INFO L85 PathProgramCache]: Analyzing trace with hash 7205093, now seen corresponding path program 1 times [2025-04-13 23:50:01,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:01,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140686814] [2025-04-13 23:50:01,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:01,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:50:01,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:50:01,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:01,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:01,754 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 23:50:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:01,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140686814] [2025-04-13 23:50:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140686814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171619216] [2025-04-13 23:50:01,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:01,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:01,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:01,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:01,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2025-04-13 23:50:01,791 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 23:50:01,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:01,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2025-04-13 23:50:01,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:01,903 INFO L116 PetriNetUnfolderBase]: 162/286 cut-off events. [2025-04-13 23:50:01,903 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-13 23:50:01,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 286 events. 162/286 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 938 event pairs, 132 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 324. Up to 276 conditions per place. [2025-04-13 23:50:01,909 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 18 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-04-13 23:50:01,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 88 flow [2025-04-13 23:50:01,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:50:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:50:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2025-04-13 23:50:01,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-13 23:50:01,921 INFO L175 Difference]: Start difference. First operand has 25 places, 26 transitions, 62 flow. Second operand 2 states and 29 transitions. [2025-04-13 23:50:01,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 88 flow [2025-04-13 23:50:01,925 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 23:50:01,926 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 52 flow [2025-04-13 23:50:01,928 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 23:50:01,931 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-13 23:50:01,931 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 52 flow [2025-04-13 23:50:01,931 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 23:50:01,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:01,931 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 23:50:01,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:50:01,931 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 23:50:01,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:01,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1666212046, now seen corresponding path program 1 times [2025-04-13 23:50:01,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:01,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241043849] [2025-04-13 23:50:01,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:01,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:01,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:01,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:01,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:01,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:01,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:01,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:50:01,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:50:01,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:01,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:01,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:01,956 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:01,956 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 23:50:01,956 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 23:50:01,956 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 23:50:01,956 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:50:01,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:50:01,957 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:50:01,957 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:01,957 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:50:01,986 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:01,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 38 transitions, 94 flow [2025-04-13 23:50:01,995 INFO L116 PetriNetUnfolderBase]: 9/42 cut-off events. [2025-04-13 23:50:01,995 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 23:50:01,995 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 6. Compared 93 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 23:50:01,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 38 transitions, 94 flow [2025-04-13 23:50:01,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 37 transitions, 92 flow [2025-04-13 23:50:01,997 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:01,997 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;@3220e97f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:01,997 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:50:02,000 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:02,000 INFO L116 PetriNetUnfolderBase]: 1/8 cut-off events. [2025-04-13 23:50:02,000 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:02,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:02,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:50:02,000 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 23:50:02,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 8384495, now seen corresponding path program 1 times [2025-04-13 23:50:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:02,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860633779] [2025-04-13 23:50:02,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:02,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:02,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:50:02,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:50:02,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:02,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:02,072 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 23:50:02,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:02,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860633779] [2025-04-13 23:50:02,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860633779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:02,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:02,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074150228] [2025-04-13 23:50:02,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:02,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:02,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:02,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:02,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-13 23:50:02,074 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 23:50:02,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:02,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-13 23:50:02,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:02,463 INFO L116 PetriNetUnfolderBase]: 1926/2766 cut-off events. [2025-04-13 23:50:02,463 INFO L117 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2025-04-13 23:50:02,470 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 11806 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 23:50:02,487 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2025-04-13 23:50:02,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 130 flow [2025-04-13 23:50:02,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:50:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:50:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2025-04-13 23:50:02,490 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-04-13 23:50:02,490 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 92 flow. Second operand 2 states and 41 transitions. [2025-04-13 23:50:02,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 130 flow [2025-04-13 23:50:02,491 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 23:50:02,492 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 76 flow [2025-04-13 23:50:02,493 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 23:50:02,493 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-04-13 23:50:02,493 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 76 flow [2025-04-13 23:50:02,493 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 23:50:02,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:02,493 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 23:50:02,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:50:02,494 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 23:50:02,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -915729228, now seen corresponding path program 1 times [2025-04-13 23:50:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:02,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57367725] [2025-04-13 23:50:02,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:02,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:50:02,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:50:02,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:02,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:02,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:02,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:50:02,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:50:02,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:02,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:02,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:02,530 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:02,530 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 23:50:02,530 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 23:50:02,530 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 23:50:02,530 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 23:50:02,530 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 23:50:02,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:50:02,531 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:50:02,531 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:02,531 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:50:02,572 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:02,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 49 transitions, 126 flow [2025-04-13 23:50:02,579 INFO L116 PetriNetUnfolderBase]: 12/55 cut-off events. [2025-04-13 23:50:02,580 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 23:50:02,580 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 140 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 23:50:02,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 49 transitions, 126 flow [2025-04-13 23:50:02,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 48 transitions, 124 flow [2025-04-13 23:50:02,582 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:02,583 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;@3220e97f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:02,583 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:50:02,585 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:02,585 INFO L116 PetriNetUnfolderBase]: 1/8 cut-off events. [2025-04-13 23:50:02,585 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:02,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:02,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:50:02,586 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 23:50:02,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash 9902841, now seen corresponding path program 1 times [2025-04-13 23:50:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:02,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100728796] [2025-04-13 23:50:02,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:02,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:50:02,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:50:02,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:02,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:02,652 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 23:50:02,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:02,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100728796] [2025-04-13 23:50:02,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100728796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:02,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125458196] [2025-04-13 23:50:02,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:02,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:02,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:02,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:02,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 49 [2025-04-13 23:50:02,654 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 23:50:02,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:02,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 49 [2025-04-13 23:50:02,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:04,446 INFO L116 PetriNetUnfolderBase]: 19076/24945 cut-off events. [2025-04-13 23:50:04,446 INFO L117 PetriNetUnfolderBase]: For 4060/4060 co-relation queries the response was YES. [2025-04-13 23:50:04,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51562 conditions, 24945 events. 19076/24945 cut-off events. For 4060/4060 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 121415 event pairs, 16008 based on Foata normal form. 0/21802 useless extension candidates. Maximal degree in co-relation 5767. Up to 24678 conditions per place. [2025-04-13 23:50:04,621 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 34 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-04-13 23:50:04,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 174 flow [2025-04-13 23:50:04,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:50:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:50:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2025-04-13 23:50:04,622 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2025-04-13 23:50:04,622 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 124 flow. Second operand 2 states and 53 transitions. [2025-04-13 23:50:04,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 174 flow [2025-04-13 23:50:04,628 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 23:50:04,628 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 100 flow [2025-04-13 23:50:04,628 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 23:50:04,629 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2025-04-13 23:50:04,629 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 100 flow [2025-04-13 23:50:04,629 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 23:50:04,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:04,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:04,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:50:04,631 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 23:50:04,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:04,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1504470329, now seen corresponding path program 1 times [2025-04-13 23:50:04,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:04,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122907405] [2025-04-13 23:50:04,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:04,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:50:04,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:50:04,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:04,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:04,690 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 23:50:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:04,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122907405] [2025-04-13 23:50:04,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122907405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:04,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:04,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:50:04,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398768994] [2025-04-13 23:50:04,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:04,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:50:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:04,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:50:04,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:50:04,694 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-04-13 23:50:04,695 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 23:50:04,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:04,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-04-13 23:50:04,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:06,629 INFO L116 PetriNetUnfolderBase]: 24526/32009 cut-off events. [2025-04-13 23:50:06,629 INFO L117 PetriNetUnfolderBase]: For 1831/1831 co-relation queries the response was YES. [2025-04-13 23:50:06,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65284 conditions, 32009 events. 24526/32009 cut-off events. For 1831/1831 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 159673 event pairs, 18409 based on Foata normal form. 0/27419 useless extension candidates. Maximal degree in co-relation 65277. Up to 28203 conditions per place. [2025-04-13 23:50:06,819 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 59 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-04-13 23:50:06,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 289 flow [2025-04-13 23:50:06,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:50:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:50:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-04-13 23:50:06,821 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2025-04-13 23:50:06,822 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 100 flow. Second operand 3 states and 74 transitions. [2025-04-13 23:50:06,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 289 flow [2025-04-13 23:50:06,824 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 23:50:06,827 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 112 flow [2025-04-13 23:50:06,827 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 23:50:06,828 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2025-04-13 23:50:06,828 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 112 flow [2025-04-13 23:50:06,828 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 23:50:06,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:06,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:06,828 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:50:06,828 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 23:50:06,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:06,829 INFO L85 PathProgramCache]: Analyzing trace with hash -581155443, now seen corresponding path program 1 times [2025-04-13 23:50:06,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:06,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860473585] [2025-04-13 23:50:06,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:06,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:06,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:50:06,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:50:06,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:06,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:06,892 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 23:50:06,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:06,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860473585] [2025-04-13 23:50:06,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860473585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:06,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735109173] [2025-04-13 23:50:06,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:06,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:06,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:06,896 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 23:50:06,897 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 23:50:06,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:50:06,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:50:06,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:06,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:06,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:50:06,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:07,000 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 23:50:07,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:07,017 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 23:50:07,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735109173] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:07,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:07,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-13 23:50:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525394956] [2025-04-13 23:50:07,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:07,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:50:07,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:07,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:50:07,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:50:07,018 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-04-13 23:50:07,019 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 23:50:07,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:07,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-04-13 23:50:07,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:08,891 INFO L116 PetriNetUnfolderBase]: 27251/35430 cut-off events. [2025-04-13 23:50:08,891 INFO L117 PetriNetUnfolderBase]: For 5848/5848 co-relation queries the response was YES. [2025-04-13 23:50:09,021 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 176061 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 23:50:09,161 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 84 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2025-04-13 23:50:09,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 91 transitions, 420 flow [2025-04-13 23:50:09,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:50:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:50:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-04-13 23:50:09,163 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-04-13 23:50:09,163 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 112 flow. Second operand 4 states and 104 transitions. [2025-04-13 23:50:09,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 91 transitions, 420 flow [2025-04-13 23:50:09,166 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 23:50:09,167 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 124 flow [2025-04-13 23:50:09,167 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 23:50:09,167 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2025-04-13 23:50:09,167 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 124 flow [2025-04-13 23:50:09,168 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 23:50:09,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:09,168 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:09,176 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 23:50:09,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:09,372 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 23:50:09,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1927965675, now seen corresponding path program 1 times [2025-04-13 23:50:09,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:09,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739994011] [2025-04-13 23:50:09,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:09,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:50:09,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:50:09,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:09,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:09,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:50:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:50:09,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:50:09,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:09,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:50:09,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:50:09,395 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:50:09,395 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 23:50:09,395 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 23:50:09,397 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 23:50:09,397 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:50:09,397 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:50:09,397 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:50:09,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:50:09,397 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 23:50:09,398 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:50:09,398 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 23:50:09,437 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:50:09,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 60 transitions, 160 flow [2025-04-13 23:50:09,445 INFO L116 PetriNetUnfolderBase]: 15/68 cut-off events. [2025-04-13 23:50:09,445 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 23:50:09,445 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 173 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 23:50:09,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 60 transitions, 160 flow [2025-04-13 23:50:09,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 59 transitions, 158 flow [2025-04-13 23:50:09,448 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:50:09,448 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;@3220e97f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:50:09,448 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:50:09,449 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:50:09,449 INFO L116 PetriNetUnfolderBase]: 1/8 cut-off events. [2025-04-13 23:50:09,449 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:50:09,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:09,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 23:50:09,450 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 23:50:09,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:09,450 INFO L85 PathProgramCache]: Analyzing trace with hash 11759171, now seen corresponding path program 1 times [2025-04-13 23:50:09,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:09,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569352033] [2025-04-13 23:50:09,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:09,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 23:50:09,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 23:50:09,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:09,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:09,487 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 23:50:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:09,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569352033] [2025-04-13 23:50:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569352033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:09,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:50:09,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889413326] [2025-04-13 23:50:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:09,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 23:50:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:09,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 23:50:09,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 23:50:09,488 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 60 [2025-04-13 23:50:09,488 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 23:50:09,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:09,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 60 [2025-04-13 23:50:09,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:20,255 INFO L116 PetriNetUnfolderBase]: 172740/213646 cut-off events. [2025-04-13 23:50:20,255 INFO L117 PetriNetUnfolderBase]: For 42638/42638 co-relation queries the response was YES. [2025-04-13 23:50:20,866 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 1116712 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 23:50:21,755 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 42 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2025-04-13 23:50:21,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 220 flow [2025-04-13 23:50:21,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 23:50:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 23:50:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2025-04-13 23:50:21,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-04-13 23:50:21,757 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 158 flow. Second operand 2 states and 65 transitions. [2025-04-13 23:50:21,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 220 flow [2025-04-13 23:50:21,769 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 23:50:21,770 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 124 flow [2025-04-13 23:50:21,770 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 23:50:21,771 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2025-04-13 23:50:21,771 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 124 flow [2025-04-13 23:50:21,771 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 23:50:21,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:21,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:21,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:50:21,771 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 23:50:21,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2121170941, now seen corresponding path program 1 times [2025-04-13 23:50:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:21,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115143162] [2025-04-13 23:50:21,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:21,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:50:21,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:50:21,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:21,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:21,805 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 23:50:21,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:21,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115143162] [2025-04-13 23:50:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115143162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:50:21,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:50:21,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:50:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502422534] [2025-04-13 23:50:21,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:50:21,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:50:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:21,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:50:21,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:50:21,810 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 60 [2025-04-13 23:50:21,811 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 23:50:21,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:21,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 60 [2025-04-13 23:50:21,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:50:35,432 INFO L116 PetriNetUnfolderBase]: 222094/274389 cut-off events. [2025-04-13 23:50:35,432 INFO L117 PetriNetUnfolderBase]: For 14286/14286 co-relation queries the response was YES. [2025-04-13 23:50:36,123 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 1461171 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 23:50:37,248 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 75 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-04-13 23:50:37,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 366 flow [2025-04-13 23:50:37,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:50:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:50:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-04-13 23:50:37,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-04-13 23:50:37,254 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 124 flow. Second operand 3 states and 93 transitions. [2025-04-13 23:50:37,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 366 flow [2025-04-13 23:50:37,313 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 23:50:37,315 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 136 flow [2025-04-13 23:50:37,315 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 23:50:37,316 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2025-04-13 23:50:37,316 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 136 flow [2025-04-13 23:50:37,316 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 23:50:37,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:50:37,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:50:37,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:50:37,317 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 23:50:37,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:50:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1306885067, now seen corresponding path program 1 times [2025-04-13 23:50:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:50:37,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284652406] [2025-04-13 23:50:37,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:50:37,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:50:37,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:50:37,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:37,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:37,400 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 23:50:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:50:37,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284652406] [2025-04-13 23:50:37,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284652406] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:50:37,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916096212] [2025-04-13 23:50:37,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:50:37,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:50:37,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:50:37,403 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 23:50:37,408 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 23:50:37,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:50:37,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:50:37,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:50:37,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:50:37,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:50:37,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:50:37,552 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 23:50:37,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:50:37,570 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 23:50:37,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916096212] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:50:37,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:50:37,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-13 23:50:37,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131579314] [2025-04-13 23:50:37,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:50:37,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:50:37,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:50:37,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:50:37,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:50:37,572 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 60 [2025-04-13 23:50:37,572 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 23:50:37,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:50:37,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 60 [2025-04-13 23:50:37,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand