/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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All -i ../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:43:05,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:43:05,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 21:43:05,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:43:05,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:43:05,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:43:05,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:43:05,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:43:05,846 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:43:05,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:43:05,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:43:05,847 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:43:05,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:43:05,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:43:05,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:43:05,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:43:05,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:43:05,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:43:05,848 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:43:05,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:43:05,848 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:43:05,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:43:05,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:43:05,848 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:43:05,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:43:05,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:43:05,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:43:05,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:43:05,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:43:05,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:43:05,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:43:05,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:43:05,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 21:43:06,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:43:06,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:43:06,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:43:06,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:43:06,095 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:43:06,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i [2025-03-14 21:43:07,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a72d34f/8d76ec3a2d454144b226a33e593e4e09/FLAGcb7bc8c4f [2025-03-14 21:43:07,465 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:43:07,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i [2025-03-14 21:43:07,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a72d34f/8d76ec3a2d454144b226a33e593e4e09/FLAGcb7bc8c4f [2025-03-14 21:43:07,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a72d34f/8d76ec3a2d454144b226a33e593e4e09 [2025-03-14 21:43:07,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:43:07,845 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:43:07,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:43:07,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:43:07,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:43:07,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:43:07" (1/1) ... [2025-03-14 21:43:07,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7866fcbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:07, skipping insertion in model container [2025-03-14 21:43:07,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:43:07" (1/1) ... [2025-03-14 21:43:07,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:43:08,077 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/14_spin2003.i[30419,30432] [2025-03-14 21:43:08,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:43:08,092 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:43:08,126 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/14_spin2003.i[30419,30432] [2025-03-14 21:43:08,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:43:08,156 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:43:08,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08 WrapperNode [2025-03-14 21:43:08,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:43:08,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:43:08,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:43:08,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:43:08,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,185 INFO L138 Inliner]: procedures = 161, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-03-14 21:43:08,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:43:08,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:43:08,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:43:08,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:43:08,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:43:08,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:43:08,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:43:08,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:43:08,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (1/1) ... [2025-03-14 21:43:08,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:43:08,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:43:08,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 21:43:08,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 21:43:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 21:43:08,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 21:43:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:43:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:43:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:43:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:43:08,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:43:08,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:43:08,275 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 21:43:08,347 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:43:08,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:43:08,412 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:43:08,412 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:43:08,422 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:43:08,423 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-14 21:43:08,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:43:08 BoogieIcfgContainer [2025-03-14 21:43:08,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:43:08,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:43:08,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:43:08,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:43:08,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:43:07" (1/3) ... [2025-03-14 21:43:08,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f748b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:43:08, skipping insertion in model container [2025-03-14 21:43:08,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:43:08" (2/3) ... [2025-03-14 21:43:08,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f748b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:43:08, skipping insertion in model container [2025-03-14 21:43:08,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:43:08" (3/3) ... [2025-03-14 21:43:08,432 INFO L128 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2025-03-14 21:43:08,441 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:43:08,442 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-14 21:43:08,442 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:43:08,475 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 21:43:08,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:43:08,511 INFO L333 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=All, 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;@6b49c5d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:43:08,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 21:43:08,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:43:08,532 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-14 21:43:08,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 21:43:08,534 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:08,534 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:08,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-14 21:43:08,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 213371700, now seen corresponding path program 1 times [2025-03-14 21:43:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:08,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616697655] [2025-03-14 21:43:08,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:08,602 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 21:43:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:08,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 21:43:08,632 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 21:43:08,633 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-14 21:43:08,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-14 21:43:08,634 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-14 21:43:08,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:43:08,635 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-14 21:43:08,638 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 21:43:08,638 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 21:43:08,662 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 21:43:08,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:43:08,666 INFO L333 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=All, 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;@6b49c5d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:43:08,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 21:43:08,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:43:08,682 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-03-14 21:43:08,682 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 21:43:08,682 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:08,682 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:08,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:43:08,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash -778262413, now seen corresponding path program 1 times [2025-03-14 21:43:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:08,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026545417] [2025-03-14 21:43:08,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:43:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:43:08,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:43:08,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026545417] [2025-03-14 21:43:08,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026545417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:43:08,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:43:08,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:43:08,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852651092] [2025-03-14 21:43:08,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:43:08,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:43:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:43:08,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:43:08,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:43:08,858 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 55 [2025-03-14 21:43:08,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-03-14 21:43:08,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:43:08,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 55 [2025-03-14 21:43:08,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:43:08,924 INFO L124 PetriNetUnfolderBase]: 34/165 cut-off events. [2025-03-14 21:43:08,924 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 21:43:08,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 165 events. 34/165 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 607 event pairs, 20 based on Foata normal form. 65/227 useless extension candidates. Maximal degree in co-relation 203. Up to 69 conditions per place. [2025-03-14 21:43:08,931 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 21 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-14 21:43:08,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 183 flow [2025-03-14 21:43:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:43:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:43:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-03-14 21:43:08,945 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8424242424242424 [2025-03-14 21:43:08,947 INFO L298 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-03-14 21:43:08,947 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 183 flow [2025-03-14 21:43:08,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-03-14 21:43:08,947 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:08,947 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:08,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 21:43:08,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-14 21:43:08,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1497536359, now seen corresponding path program 1 times [2025-03-14 21:43:08,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:08,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547968535] [2025-03-14 21:43:08,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:08,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:08,961 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 21:43:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:08,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 21:43:08,978 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 21:43:08,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-14 21:43:08,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-14 21:43:08,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-14 21:43:08,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-14 21:43:08,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 21:43:08,979 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 21:43:08,979 WARN L336 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 21:43:08,980 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 21:43:08,998 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 21:43:09,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:43:09,001 INFO L333 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=All, 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;@6b49c5d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:43:09,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 21:43:09,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:43:09,010 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-03-14 21:43:09,010 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 21:43:09,010 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:09,010 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:09,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:43:09,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash 900171557, now seen corresponding path program 1 times [2025-03-14 21:43:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:09,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563523576] [2025-03-14 21:43:09,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:43:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:43:09,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:43:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563523576] [2025-03-14 21:43:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563523576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:43:09,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:43:09,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:43:09,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579606051] [2025-03-14 21:43:09,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:43:09,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:43:09,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:43:09,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:43:09,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:43:09,079 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 70 [2025-03-14 21:43:09,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-03-14 21:43:09,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:43:09,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 70 [2025-03-14 21:43:09,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:43:09,269 INFO L124 PetriNetUnfolderBase]: 627/1553 cut-off events. [2025-03-14 21:43:09,269 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2025-03-14 21:43:09,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1553 events. 627/1553 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11161 event pairs, 355 based on Foata normal form. 617/2121 useless extension candidates. Maximal degree in co-relation 2297. Up to 757 conditions per place. [2025-03-14 21:43:09,281 INFO L140 encePairwiseOnDemand]: 56/70 looper letters, 32 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2025-03-14 21:43:09,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 262 flow [2025-03-14 21:43:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:43:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:43:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2025-03-14 21:43:09,284 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8238095238095238 [2025-03-14 21:43:09,286 INFO L298 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2025-03-14 21:43:09,286 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 77 transitions, 262 flow [2025-03-14 21:43:09,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-03-14 21:43:09,286 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:09,286 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:09,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:43:09,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-14 21:43:09,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2029058090, now seen corresponding path program 1 times [2025-03-14 21:43:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:09,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692048293] [2025-03-14 21:43:09,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:09,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:09,308 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 21:43:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:09,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 21:43:09,320 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 21:43:09,320 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-14 21:43:09,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 21:43:09,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-14 21:43:09,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 21:43:09,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 21:43:09,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 21:43:09,320 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-14 21:43:09,321 WARN L336 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 21:43:09,321 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 21:43:09,347 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 21:43:09,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:43:09,352 INFO L333 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=All, 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;@6b49c5d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:43:09,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 21:43:09,355 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:43:09,356 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2025-03-14 21:43:09,356 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 21:43:09,356 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:09,357 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:09,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:43:09,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:09,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1415492891, now seen corresponding path program 1 times [2025-03-14 21:43:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:09,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438379901] [2025-03-14 21:43:09,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:43:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:43:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:43:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438379901] [2025-03-14 21:43:09,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438379901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:43:09,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:43:09,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:43:09,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342702856] [2025-03-14 21:43:09,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:43:09,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:43:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:43:09,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:43:09,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:43:09,420 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 85 [2025-03-14 21:43:09,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-03-14 21:43:09,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:43:09,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 85 [2025-03-14 21:43:09,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:43:10,628 INFO L124 PetriNetUnfolderBase]: 7843/15029 cut-off events. [2025-03-14 21:43:10,628 INFO L125 PetriNetUnfolderBase]: For 4465/4465 co-relation queries the response was YES. [2025-03-14 21:43:10,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28905 conditions, 15029 events. 7843/15029 cut-off events. For 4465/4465 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 133863 event pairs, 4364 based on Foata normal form. 5507/19936 useless extension candidates. Maximal degree in co-relation 23133. Up to 7424 conditions per place. [2025-03-14 21:43:10,773 INFO L140 encePairwiseOnDemand]: 67/85 looper letters, 43 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2025-03-14 21:43:10,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 96 transitions, 345 flow [2025-03-14 21:43:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:43:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:43:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2025-03-14 21:43:10,777 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8117647058823529 [2025-03-14 21:43:10,777 INFO L298 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-03-14 21:43:10,778 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 96 transitions, 345 flow [2025-03-14 21:43:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-03-14 21:43:10,778 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:10,778 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:10,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 21:43:10,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:43:10,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 230917911, now seen corresponding path program 1 times [2025-03-14 21:43:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837752867] [2025-03-14 21:43:10,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:43:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:43:10,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:43:10,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837752867] [2025-03-14 21:43:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837752867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:43:10,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:43:10,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:43:10,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500967523] [2025-03-14 21:43:10,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:43:10,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:43:10,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:43:10,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:43:10,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:43:10,889 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 85 [2025-03-14 21:43:10,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 96 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-03-14 21:43:10,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:43:10,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 85 [2025-03-14 21:43:10,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:43:10,956 INFO L124 PetriNetUnfolderBase]: 102/492 cut-off events. [2025-03-14 21:43:10,957 INFO L125 PetriNetUnfolderBase]: For 1172/1192 co-relation queries the response was YES. [2025-03-14 21:43:10,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 492 events. 102/492 cut-off events. For 1172/1192 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3083 event pairs, 34 based on Foata normal form. 248/737 useless extension candidates. Maximal degree in co-relation 478. Up to 263 conditions per place. [2025-03-14 21:43:10,959 INFO L140 encePairwiseOnDemand]: 77/85 looper letters, 16 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2025-03-14 21:43:10,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 322 flow [2025-03-14 21:43:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:43:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:43:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2025-03-14 21:43:10,961 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7803921568627451 [2025-03-14 21:43:10,961 INFO L298 CegarLoopForPetriNet]: 90 programPoint places, -12 predicate places. [2025-03-14 21:43:10,962 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 322 flow [2025-03-14 21:43:10,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-03-14 21:43:10,962 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:10,962 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:10,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 21:43:10,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:43:10,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash -100396761, now seen corresponding path program 1 times [2025-03-14 21:43:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650137086] [2025-03-14 21:43:10,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:10,975 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 21:43:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:10,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 21:43:10,990 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 21:43:10,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-14 21:43:10,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-14 21:43:10,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-14 21:43:10,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-14 21:43:10,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-14 21:43:10,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-14 21:43:10,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 21:43:10,990 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-14 21:43:10,991 WARN L336 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 21:43:10,991 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-14 21:43:11,010 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 21:43:11,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:43:11,012 INFO L333 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=All, 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;@6b49c5d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:43:11,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 21:43:11,015 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:43:11,015 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2025-03-14 21:43:11,015 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 21:43:11,015 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:11,015 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:11,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:43:11,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1001724745, now seen corresponding path program 1 times [2025-03-14 21:43:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:11,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523300269] [2025-03-14 21:43:11,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:43:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:43:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:43:11,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523300269] [2025-03-14 21:43:11,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523300269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:43:11,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:43:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:43:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665436487] [2025-03-14 21:43:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:43:11,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:43:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:43:11,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:43:11,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:43:11,055 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 100 [2025-03-14 21:43:11,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-03-14 21:43:11,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:43:11,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 100 [2025-03-14 21:43:11,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:43:19,130 INFO L124 PetriNetUnfolderBase]: 82238/136546 cut-off events. [2025-03-14 21:43:19,130 INFO L125 PetriNetUnfolderBase]: For 53459/53459 co-relation queries the response was YES. [2025-03-14 21:43:19,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269260 conditions, 136546 events. 82238/136546 cut-off events. For 53459/53459 co-relation queries the response was YES. Maximal size of possible extension queue 5378. Compared 1350662 event pairs, 45221 based on Foata normal form. 46603/176735 useless extension candidates. Maximal degree in co-relation 214230. Up to 67130 conditions per place. [2025-03-14 21:43:20,302 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 54 selfloop transitions, 11 changer transitions 0/115 dead transitions. [2025-03-14 21:43:20,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 115 transitions, 432 flow [2025-03-14 21:43:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:43:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:43:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2025-03-14 21:43:20,305 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8033333333333333 [2025-03-14 21:43:20,308 INFO L298 CegarLoopForPetriNet]: 106 programPoint places, -7 predicate places. [2025-03-14 21:43:20,308 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 115 transitions, 432 flow [2025-03-14 21:43:20,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-03-14 21:43:20,308 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:20,308 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:20,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 21:43:20,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:43:20,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash -939198931, now seen corresponding path program 1 times [2025-03-14 21:43:20,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:20,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147605369] [2025-03-14 21:43:20,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:20,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:43:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:43:20,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:43:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147605369] [2025-03-14 21:43:20,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147605369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:43:20,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:43:20,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:43:20,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146644973] [2025-03-14 21:43:20,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:43:20,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:43:20,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:43:20,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:43:20,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:43:20,365 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 100 [2025-03-14 21:43:20,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 115 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-03-14 21:43:20,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:43:20,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 100 [2025-03-14 21:43:20,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:43:20,452 INFO L124 PetriNetUnfolderBase]: 294/1213 cut-off events. [2025-03-14 21:43:20,452 INFO L125 PetriNetUnfolderBase]: For 4423/4463 co-relation queries the response was YES. [2025-03-14 21:43:20,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3829 conditions, 1213 events. 294/1213 cut-off events. For 4423/4463 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9706 event pairs, 98 based on Foata normal form. 888/2095 useless extension candidates. Maximal degree in co-relation 1447. Up to 695 conditions per place. [2025-03-14 21:43:20,458 INFO L140 encePairwiseOnDemand]: 90/100 looper letters, 19 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2025-03-14 21:43:20,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 84 transitions, 408 flow [2025-03-14 21:43:20,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:43:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:43:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2025-03-14 21:43:20,459 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.78 [2025-03-14 21:43:20,461 INFO L298 CegarLoopForPetriNet]: 106 programPoint places, -15 predicate places. [2025-03-14 21:43:20,461 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 408 flow [2025-03-14 21:43:20,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-03-14 21:43:20,461 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:20,461 INFO L221 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:20,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 21:43:20,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-14 21:43:20,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -102905136, now seen corresponding path program 1 times [2025-03-14 21:43:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:20,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930464805] [2025-03-14 21:43:20,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:20,471 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 21:43:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:43:20,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 21:43:20,480 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 21:43:20,480 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-14 21:43:20,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-14 21:43:20,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-03-14 21:43:20,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-14 21:43:20,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-14 21:43:20,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-14 21:43:20,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-14 21:43:20,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 21:43:20,483 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-14 21:43:20,483 WARN L336 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 21:43:20,483 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-14 21:43:20,504 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 21:43:20,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:43:20,510 INFO L333 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=All, 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;@6b49c5d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:43:20,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-14 21:43:20,512 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:43:20,512 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-03-14 21:43:20,512 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 21:43:20,512 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:43:20,512 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:43:20,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 21:43:20,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:43:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash -575156037, now seen corresponding path program 1 times [2025-03-14 21:43:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:43:20,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898731897] [2025-03-14 21:43:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:43:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:43:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:43:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:43:20,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:43:20,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898731897] [2025-03-14 21:43:20,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898731897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:43:20,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:43:20,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:43:20,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123946883] [2025-03-14 21:43:20,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:43:20,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:43:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:43:20,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:43:20,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:43:20,543 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 115 [2025-03-14 21:43:20,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-03-14 21:43:20,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:43:20,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 115 [2025-03-14 21:43:20,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand