/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:23:39,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:23:39,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:23:39,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:23:39,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:23:39,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:23:39,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:23:39,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:23:39,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:23:39,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:23:39,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:23:39,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:23:39,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:23:39,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:23:39,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:23:39,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:23:39,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:23:39,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:23:39,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:23:39,244 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:23:39,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:23:39,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:23:39,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:23:39,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:23:39,606 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:23:39,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2025-04-13 19:23:40,942 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24054c744/03b3659b909f4851873789946608cd0c/FLAG337397d8e [2025-04-13 19:23:41,180 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:23:41,180 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2025-04-13 19:23:41,195 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24054c744/03b3659b909f4851873789946608cd0c/FLAG337397d8e [2025-04-13 19:23:42,143 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24054c744/03b3659b909f4851873789946608cd0c [2025-04-13 19:23:42,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:23:42,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:23:42,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:23:42,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:23:42,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:23:42,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ec19f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42, skipping insertion in model container [2025-04-13 19:23:42,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:23:42,433 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/45_monabsex1_vs.i[30633,30646] [2025-04-13 19:23:42,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:23:42,447 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:23:42,484 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/45_monabsex1_vs.i[30633,30646] [2025-04-13 19:23:42,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:23:42,505 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:23:42,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42 WrapperNode [2025-04-13 19:23:42,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:23:42,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:23:42,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:23:42,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:23:42,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,531 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-04-13 19:23:42,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:23:42,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:23:42,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:23:42,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:23:42,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,547 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:23:42,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:23:42,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:23:42,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:23:42,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:23:42,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (1/1) ... [2025-04-13 19:23:42,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:23:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:23:42,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:23:42,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:23:42,606 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:23:42,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:23:42,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:23:42,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:23:42,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:23:42,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:23:42,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:23:42,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:23:42,607 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:23:42,679 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:23:42,680 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:23:42,729 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:23:42,729 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:23:42,729 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:23:42,775 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-13 19:23:42,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:23:42 BoogieIcfgContainer [2025-04-13 19:23:42,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:23:42,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:23:42,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:23:42,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:23:42,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:23:42" (1/3) ... [2025-04-13 19:23:42,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e565a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:23:42, skipping insertion in model container [2025-04-13 19:23:42,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:23:42" (2/3) ... [2025-04-13 19:23:42,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e565a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:23:42, skipping insertion in model container [2025-04-13 19:23:42,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:23:42" (3/3) ... [2025-04-13 19:23:42,781 INFO L128 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2025-04-13 19:23:42,790 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:23:42,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 45_monabsex1_vs.i that has 2 procedures, 10 locations, 9 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-13 19:23:42,791 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:23:42,821 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:23:42,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 13 places, 10 transitions, 24 flow [2025-04-13 19:23:42,853 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 19:23:42,855 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:23:42,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 12 events. 0/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 19:23:42,856 INFO L82 GeneralOperation]: Start removeDead. Operand has 13 places, 10 transitions, 24 flow [2025-04-13 19:23:42,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 13 places, 10 transitions, 24 flow [2025-04-13 19:23:42,862 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:23:42,868 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;@3294043a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:23:42,868 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:23:42,871 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:23:42,871 INFO L116 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-04-13 19:23:42,871 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:23:42,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:42,871 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-04-13 19:23:42,872 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 19:23:42,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:42,875 INFO L85 PathProgramCache]: Analyzing trace with hash 110648394, now seen corresponding path program 1 times [2025-04-13 19:23:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:42,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223982915] [2025-04-13 19:23:42,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:42,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:42,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:23:42,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:23:42,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:42,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:42,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:23:42,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:23:42,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:23:42,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:42,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:42,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:23:42,976 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:23:42,977 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 19:23:42,978 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 19:23:42,978 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 19:23:42,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:23:42,979 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 19:23:42,981 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:23:42,981 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:23:42,992 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:23:42,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 42 flow [2025-04-13 19:23:43,005 INFO L116 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-04-13 19:23:43,005 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:23:43,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 20 events. 0/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-04-13 19:23:43,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 16 transitions, 42 flow [2025-04-13 19:23:43,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 42 flow [2025-04-13 19:23:43,007 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:23:43,007 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;@3294043a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:23:43,007 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:23:43,011 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:23:43,011 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 19:23:43,011 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:23:43,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:43,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:23:43,011 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:23:43,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:43,011 INFO L85 PathProgramCache]: Analyzing trace with hash -391373094, now seen corresponding path program 1 times [2025-04-13 19:23:43,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:43,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901791780] [2025-04-13 19:23:43,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:43,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:23:43,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:23:43,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:43,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:43,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901791780] [2025-04-13 19:23:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901791780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:43,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:43,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:43,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167621773] [2025-04-13 19:23:43,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:43,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:43,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:43,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:43,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:43,106 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2025-04-13 19:23:43,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:43,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:43,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2025-04-13 19:23:43,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:43,182 INFO L116 PetriNetUnfolderBase]: 109/215 cut-off events. [2025-04-13 19:23:43,183 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 19:23:43,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 215 events. 109/215 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 796 event pairs, 45 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 328. Up to 116 conditions per place. [2025-04-13 19:23:43,203 INFO L140 encePairwiseOnDemand]: 11/16 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-04-13 19:23:43,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 109 flow [2025-04-13 19:23:43,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:23:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:23:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-13 19:23:43,217 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-04-13 19:23:43,218 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 42 flow. Second operand 3 states and 29 transitions. [2025-04-13 19:23:43,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 109 flow [2025-04-13 19:23:43,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:23:43,223 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 62 flow [2025-04-13 19:23:43,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2025-04-13 19:23:43,226 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2025-04-13 19:23:43,226 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 62 flow [2025-04-13 19:23:43,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:43,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:43,227 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-04-13 19:23:43,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:23:43,227 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:23:43,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash 752043573, now seen corresponding path program 1 times [2025-04-13 19:23:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:43,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268880397] [2025-04-13 19:23:43,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:43,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:23:43,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:23:43,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:43,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:43,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:23:43,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:23:43,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:23:43,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:43,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:43,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:23:43,267 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:23:43,267 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:23:43,268 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:23:43,268 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 19:23:43,268 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:23:43,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:23:43,268 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:23:43,268 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:23:43,268 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:23:43,286 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:23:43,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2025-04-13 19:23:43,293 INFO L116 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-04-13 19:23:43,293 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:23:43,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-04-13 19:23:43,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 22 transitions, 62 flow [2025-04-13 19:23:43,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-13 19:23:43,294 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:23:43,296 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;@3294043a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:23:43,296 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:23:43,301 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:23:43,301 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 19:23:43,301 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:23:43,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:43,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:23:43,305 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:23:43,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 259611893, now seen corresponding path program 1 times [2025-04-13 19:23:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:43,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732113914] [2025-04-13 19:23:43,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:43,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:23:43,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:23:43,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:43,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:43,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732113914] [2025-04-13 19:23:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732113914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:43,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:43,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:43,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978396688] [2025-04-13 19:23:43,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:43,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:43,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:43,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:43,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:43,361 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2025-04-13 19:23:43,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:43,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:43,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2025-04-13 19:23:43,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:43,587 INFO L116 PetriNetUnfolderBase]: 1343/2070 cut-off events. [2025-04-13 19:23:43,587 INFO L117 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-04-13 19:23:43,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 2070 events. 1343/2070 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10050 event pairs, 681 based on Foata normal form. 0/1764 useless extension candidates. Maximal degree in co-relation 2280. Up to 1272 conditions per place. [2025-04-13 19:23:43,603 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 31 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2025-04-13 19:23:43,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 172 flow [2025-04-13 19:23:43,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:23:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:23:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 19:23:43,604 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-04-13 19:23:43,604 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 41 transitions. [2025-04-13 19:23:43,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 172 flow [2025-04-13 19:23:43,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 168 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-13 19:23:43,606 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 88 flow [2025-04-13 19:23:43,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-04-13 19:23:43,607 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2025-04-13 19:23:43,607 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 88 flow [2025-04-13 19:23:43,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:43,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:43,607 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:43,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:23:43,607 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:23:43,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 370025796, now seen corresponding path program 1 times [2025-04-13 19:23:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:43,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989690550] [2025-04-13 19:23:43,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:43,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:23:43,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:23:43,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:43,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:43,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989690550] [2025-04-13 19:23:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989690550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:43,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:43,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409126022] [2025-04-13 19:23:43,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:43,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:43,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:43,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:43,652 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2025-04-13 19:23:43,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:43,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:43,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2025-04-13 19:23:43,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:43,854 INFO L116 PetriNetUnfolderBase]: 1689/2637 cut-off events. [2025-04-13 19:23:43,854 INFO L117 PetriNetUnfolderBase]: For 1047/1047 co-relation queries the response was YES. [2025-04-13 19:23:43,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 2637 events. 1689/2637 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13520 event pairs, 787 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 5575. Up to 1546 conditions per place. [2025-04-13 19:23:43,873 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 33 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2025-04-13 19:23:43,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 221 flow [2025-04-13 19:23:43,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:23:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:23:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 19:23:43,874 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-04-13 19:23:43,874 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 88 flow. Second operand 3 states and 38 transitions. [2025-04-13 19:23:43,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 221 flow [2025-04-13 19:23:43,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:23:43,885 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 128 flow [2025-04-13 19:23:43,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2025-04-13 19:23:43,886 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2025-04-13 19:23:43,886 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 128 flow [2025-04-13 19:23:43,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:43,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:43,886 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 19:23:43,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:23:43,887 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:23:43,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:43,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1414542735, now seen corresponding path program 1 times [2025-04-13 19:23:43,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:43,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731120842] [2025-04-13 19:23:43,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:43,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:43,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:23:43,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:23:43,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:43,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:43,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:23:43,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:23:43,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:23:43,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:43,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:43,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:23:43,921 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:23:43,921 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:23:43,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:23:43,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:23:43,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:23:43,924 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:23:43,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:23:43,924 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 19:23:43,924 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:23:43,924 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:23:43,941 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:23:43,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 84 flow [2025-04-13 19:23:43,947 INFO L116 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-04-13 19:23:43,947 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:23:43,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 36 events. 0/36 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-04-13 19:23:43,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 28 transitions, 84 flow [2025-04-13 19:23:43,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 84 flow [2025-04-13 19:23:43,949 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:23:43,950 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;@3294043a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:23:43,951 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:23:43,954 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:23:43,954 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 19:23:43,954 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:23:43,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:43,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:23:43,954 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:23:43,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1088102581, now seen corresponding path program 1 times [2025-04-13 19:23:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:43,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031177524] [2025-04-13 19:23:43,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:43,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:23:43,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:23:43,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:43,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:43,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:43,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031177524] [2025-04-13 19:23:43,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031177524] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:43,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:43,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:43,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313552358] [2025-04-13 19:23:43,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:43,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:43,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:43,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:43,994 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 19:23:43,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:43,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:43,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 19:23:43,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:44,849 INFO L116 PetriNetUnfolderBase]: 12243/16840 cut-off events. [2025-04-13 19:23:44,850 INFO L117 PetriNetUnfolderBase]: For 3653/3653 co-relation queries the response was YES. [2025-04-13 19:23:44,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35374 conditions, 16840 events. 12243/16840 cut-off events. For 3653/3653 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90149 event pairs, 6745 based on Foata normal form. 0/14174 useless extension candidates. Maximal degree in co-relation 5360. Up to 10936 conditions per place. [2025-04-13 19:23:44,952 INFO L140 encePairwiseOnDemand]: 21/28 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-04-13 19:23:44,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 239 flow [2025-04-13 19:23:44,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:23:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:23:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-13 19:23:44,954 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-04-13 19:23:44,954 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 84 flow. Second operand 3 states and 53 transitions. [2025-04-13 19:23:44,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 239 flow [2025-04-13 19:23:44,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 227 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 19:23:44,957 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 114 flow [2025-04-13 19:23:44,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-04-13 19:23:44,958 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2025-04-13 19:23:44,958 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 114 flow [2025-04-13 19:23:44,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:44,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:44,958 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:44,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:23:44,958 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:23:44,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1976010655, now seen corresponding path program 1 times [2025-04-13 19:23:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:44,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972460425] [2025-04-13 19:23:44,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:44,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:23:44,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:23:44,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:44,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:45,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:45,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972460425] [2025-04-13 19:23:45,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972460425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:45,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:45,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:45,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496060671] [2025-04-13 19:23:45,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:45,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:45,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:45,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:45,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:45,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 19:23:45,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:45,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:45,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 19:23:45,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:46,125 INFO L116 PetriNetUnfolderBase]: 16953/23450 cut-off events. [2025-04-13 19:23:46,125 INFO L117 PetriNetUnfolderBase]: For 9851/9851 co-relation queries the response was YES. [2025-04-13 19:23:46,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55876 conditions, 23450 events. 16953/23450 cut-off events. For 9851/9851 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 133462 event pairs, 8455 based on Foata normal form. 0/20680 useless extension candidates. Maximal degree in co-relation 49761. Up to 15062 conditions per place. [2025-04-13 19:23:46,245 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 45 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2025-04-13 19:23:46,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 300 flow [2025-04-13 19:23:46,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:23:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:23:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-04-13 19:23:46,247 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-04-13 19:23:46,247 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 114 flow. Second operand 3 states and 50 transitions. [2025-04-13 19:23:46,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 300 flow [2025-04-13 19:23:46,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:23:46,293 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 172 flow [2025-04-13 19:23:46,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-04-13 19:23:46,294 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2025-04-13 19:23:46,294 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 172 flow [2025-04-13 19:23:46,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:46,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:46,294 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:46,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:23:46,295 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:23:46,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash 552421396, now seen corresponding path program 1 times [2025-04-13 19:23:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:46,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001781876] [2025-04-13 19:23:46,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:46,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:23:46,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:23:46,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:46,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:46,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:46,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001781876] [2025-04-13 19:23:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001781876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:46,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:46,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:46,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533598830] [2025-04-13 19:23:46,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:46,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:46,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:46,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:46,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:46,344 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 19:23:46,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:46,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:46,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 19:23:46,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:47,530 INFO L116 PetriNetUnfolderBase]: 22305/31049 cut-off events. [2025-04-13 19:23:47,530 INFO L117 PetriNetUnfolderBase]: For 20707/20707 co-relation queries the response was YES. [2025-04-13 19:23:47,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79820 conditions, 31049 events. 22305/31049 cut-off events. For 20707/20707 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 185286 event pairs, 10801 based on Foata normal form. 0/27827 useless extension candidates. Maximal degree in co-relation 71245. Up to 19502 conditions per place. [2025-04-13 19:23:47,673 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 49 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2025-04-13 19:23:47,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 409 flow [2025-04-13 19:23:47,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:23:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:23:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-13 19:23:47,675 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-13 19:23:47,675 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 172 flow. Second operand 3 states and 49 transitions. [2025-04-13 19:23:47,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 409 flow [2025-04-13 19:23:47,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 381 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:23:47,726 INFO L231 Difference]: Finished difference. Result has 44 places, 46 transitions, 278 flow [2025-04-13 19:23:47,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=44, PETRI_TRANSITIONS=46} [2025-04-13 19:23:47,728 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2025-04-13 19:23:47,728 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 278 flow [2025-04-13 19:23:47,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:47,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:47,728 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:47,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:23:47,728 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:23:47,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash 233464049, now seen corresponding path program 1 times [2025-04-13 19:23:47,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:47,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568202229] [2025-04-13 19:23:47,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:47,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:47,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:23:47,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:23:47,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:47,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:47,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:47,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568202229] [2025-04-13 19:23:47,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568202229] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:47,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:47,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:23:47,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348794968] [2025-04-13 19:23:47,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:47,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:23:47,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:47,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:23:47,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:23:47,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 19:23:47,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:47,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:47,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 19:23:47,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:49,988 INFO L116 PetriNetUnfolderBase]: 38199/53543 cut-off events. [2025-04-13 19:23:49,988 INFO L117 PetriNetUnfolderBase]: For 51743/51743 co-relation queries the response was YES. [2025-04-13 19:23:50,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150159 conditions, 53543 events. 38199/53543 cut-off events. For 51743/51743 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 356784 event pairs, 6385 based on Foata normal form. 0/48341 useless extension candidates. Maximal degree in co-relation 150074. Up to 16776 conditions per place. [2025-04-13 19:23:50,434 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 113 selfloop transitions, 33 changer transitions 0/147 dead transitions. [2025-04-13 19:23:50,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 147 transitions, 1084 flow [2025-04-13 19:23:50,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:23:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:23:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-13 19:23:50,435 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-04-13 19:23:50,435 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 278 flow. Second operand 6 states and 114 transitions. [2025-04-13 19:23:50,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 147 transitions, 1084 flow [2025-04-13 19:23:50,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 147 transitions, 1016 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:23:50,571 INFO L231 Difference]: Finished difference. Result has 51 places, 70 transitions, 575 flow [2025-04-13 19:23:50,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=51, PETRI_TRANSITIONS=70} [2025-04-13 19:23:50,572 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2025-04-13 19:23:50,572 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 70 transitions, 575 flow [2025-04-13 19:23:50,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:50,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:50,572 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:50,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:23:50,572 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:23:50,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:50,573 INFO L85 PathProgramCache]: Analyzing trace with hash 570515579, now seen corresponding path program 2 times [2025-04-13 19:23:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:50,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495146539] [2025-04-13 19:23:50,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:23:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:50,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:23:50,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:23:50,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:23:50,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:50,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:50,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495146539] [2025-04-13 19:23:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495146539] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:50,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:23:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439243336] [2025-04-13 19:23:50,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:50,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:23:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:50,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:23:50,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:23:50,630 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2025-04-13 19:23:50,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 70 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:50,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:50,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2025-04-13 19:23:50,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:53,247 INFO L116 PetriNetUnfolderBase]: 41715/58936 cut-off events. [2025-04-13 19:23:53,247 INFO L117 PetriNetUnfolderBase]: For 95225/95225 co-relation queries the response was YES. [2025-04-13 19:23:53,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183311 conditions, 58936 events. 41715/58936 cut-off events. For 95225/95225 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 404791 event pairs, 5243 based on Foata normal form. 740/55052 useless extension candidates. Maximal degree in co-relation 96155. Up to 19534 conditions per place. [2025-04-13 19:23:53,554 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 128 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2025-04-13 19:23:53,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 179 transitions, 1515 flow [2025-04-13 19:23:53,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:23:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:23:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-04-13 19:23:53,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2025-04-13 19:23:53,555 INFO L175 Difference]: Start difference. First operand has 51 places, 70 transitions, 575 flow. Second operand 7 states and 128 transitions. [2025-04-13 19:23:53,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 179 transitions, 1515 flow [2025-04-13 19:23:53,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:23:53,810 INFO L231 Difference]: Finished difference. Result has 61 places, 95 transitions, 1039 flow [2025-04-13 19:23:53,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1039, PETRI_PLACES=61, PETRI_TRANSITIONS=95} [2025-04-13 19:23:53,810 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-04-13 19:23:53,810 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 95 transitions, 1039 flow [2025-04-13 19:23:53,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:53,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:53,811 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:53,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:23:53,811 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:23:53,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash -54932802, now seen corresponding path program 1 times [2025-04-13 19:23:53,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:53,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010667549] [2025-04-13 19:23:53,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:53,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:53,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:23:53,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:23:53,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:53,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:53,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:23:53,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:23:53,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:23:53,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:53,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:23:53,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:23:53,825 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:23:53,826 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:23:53,826 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:23:53,826 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:23:53,826 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:23:53,826 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:23:53,826 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:23:53,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:23:53,826 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-04-13 19:23:53,826 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:23:53,826 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:23:53,847 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:23:53,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 108 flow [2025-04-13 19:23:53,851 INFO L116 PetriNetUnfolderBase]: 0/44 cut-off events. [2025-04-13 19:23:53,851 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:23:53,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 44 events. 0/44 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 104 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-04-13 19:23:53,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 34 transitions, 108 flow [2025-04-13 19:23:53,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 34 transitions, 108 flow [2025-04-13 19:23:53,852 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:23:53,856 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;@3294043a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:23:53,856 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:23:53,857 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:23:53,857 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 19:23:53,857 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:23:53,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:53,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:23:53,857 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:23:53,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2094084075, now seen corresponding path program 1 times [2025-04-13 19:23:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:53,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633982145] [2025-04-13 19:23:53,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:53,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:23:53,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:23:53,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:53,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:53,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633982145] [2025-04-13 19:23:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633982145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:53,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936103084] [2025-04-13 19:23:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:53,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:53,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:53,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:53,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 19:23:53,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:53,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:53,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 19:23:53,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:23:58,063 INFO L116 PetriNetUnfolderBase]: 97851/126043 cut-off events. [2025-04-13 19:23:58,063 INFO L117 PetriNetUnfolderBase]: For 36230/36230 co-relation queries the response was YES. [2025-04-13 19:23:58,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264858 conditions, 126043 events. 97851/126043 cut-off events. For 36230/36230 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 715957 event pairs, 56393 based on Foata normal form. 0/105265 useless extension candidates. Maximal degree in co-relation 35315. Up to 84136 conditions per place. [2025-04-13 19:23:58,819 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 53 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-04-13 19:23:58,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 310 flow [2025-04-13 19:23:58,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:23:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:23:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-13 19:23:58,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2025-04-13 19:23:58,820 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 108 flow. Second operand 3 states and 65 transitions. [2025-04-13 19:23:58,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 310 flow [2025-04-13 19:23:58,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 286 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-13 19:23:58,829 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 140 flow [2025-04-13 19:23:58,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-04-13 19:23:58,829 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2025-04-13 19:23:58,829 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 140 flow [2025-04-13 19:23:58,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:58,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:23:58,830 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:23:58,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:23:58,830 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:23:58,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:23:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1933475994, now seen corresponding path program 1 times [2025-04-13 19:23:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:23:58,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645828820] [2025-04-13 19:23:58,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:23:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:23:58,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:23:58,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:23:58,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:23:58,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:23:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:23:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:23:58,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645828820] [2025-04-13 19:23:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645828820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:23:58,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:23:58,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:23:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111761660] [2025-04-13 19:23:58,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:23:58,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:23:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:23:58,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:23:58,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:23:58,859 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 19:23:58,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:23:58,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:23:58,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 19:23:58,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:24:05,617 INFO L116 PetriNetUnfolderBase]: 140281/181269 cut-off events. [2025-04-13 19:24:05,618 INFO L117 PetriNetUnfolderBase]: For 76649/76649 co-relation queries the response was YES. [2025-04-13 19:24:05,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429056 conditions, 181269 events. 140281/181269 cut-off events. For 76649/76649 co-relation queries the response was YES. Maximal size of possible extension queue 5212. Compared 1083938 event pairs, 73535 based on Foata normal form. 0/157427 useless extension candidates. Maximal degree in co-relation 382197. Up to 121118 conditions per place. [2025-04-13 19:24:06,674 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 57 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2025-04-13 19:24:06,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 379 flow [2025-04-13 19:24:06,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:24:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:24:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-04-13 19:24:06,675 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-04-13 19:24:06,675 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 140 flow. Second operand 3 states and 62 transitions. [2025-04-13 19:24:06,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 379 flow [2025-04-13 19:24:07,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:24:07,908 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 216 flow [2025-04-13 19:24:07,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-04-13 19:24:07,908 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2025-04-13 19:24:07,908 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 216 flow [2025-04-13 19:24:07,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:24:07,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:24:07,909 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:24:07,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:24:07,909 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:24:07,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:24:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1646609775, now seen corresponding path program 1 times [2025-04-13 19:24:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:24:07,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274002284] [2025-04-13 19:24:07,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:24:07,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:24:07,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:24:07,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:24:07,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:24:07,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:24:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:24:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:24:07,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274002284] [2025-04-13 19:24:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274002284] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:24:07,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:24:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:24:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661363766] [2025-04-13 19:24:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:24:07,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:24:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:24:07,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:24:07,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:24:07,937 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 19:24:07,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:24:07,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:24:07,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 19:24:07,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:24:18,508 INFO L116 PetriNetUnfolderBase]: 196129/254181 cut-off events. [2025-04-13 19:24:18,509 INFO L117 PetriNetUnfolderBase]: For 186455/186455 co-relation queries the response was YES. [2025-04-13 19:24:19,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651913 conditions, 254181 events. 196129/254181 cut-off events. For 186455/186455 co-relation queries the response was YES. Maximal size of possible extension queue 7578. Compared 1584631 event pairs, 98961 based on Foata normal form. 0/223119 useless extension candidates. Maximal degree in co-relation 579637. Up to 169070 conditions per place. [2025-04-13 19:24:19,907 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 63 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2025-04-13 19:24:19,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 532 flow [2025-04-13 19:24:19,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:24:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:24:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-13 19:24:19,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2025-04-13 19:24:19,909 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 216 flow. Second operand 3 states and 61 transitions. [2025-04-13 19:24:19,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 532 flow [2025-04-13 19:24:21,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:24:21,540 INFO L231 Difference]: Finished difference. Result has 52 places, 59 transitions, 366 flow [2025-04-13 19:24:21,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=52, PETRI_TRANSITIONS=59} [2025-04-13 19:24:21,540 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2025-04-13 19:24:21,541 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 59 transitions, 366 flow [2025-04-13 19:24:21,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:24:21,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:24:21,541 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:24:21,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:24:21,541 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:24:21,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:24:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1045655798, now seen corresponding path program 1 times [2025-04-13 19:24:21,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:24:21,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431140252] [2025-04-13 19:24:21,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:24:21,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:24:21,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:24:21,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:24:21,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:24:21,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:24:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:24:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:24:21,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431140252] [2025-04-13 19:24:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431140252] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:24:21,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:24:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:24:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505758158] [2025-04-13 19:24:21,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:24:21,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:24:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:24:21,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:24:21,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:24:21,601 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 19:24:21,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 59 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:24:21,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:24:21,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 19:24:21,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:24:41,117 INFO L116 PetriNetUnfolderBase]: 338673/440445 cut-off events. [2025-04-13 19:24:41,118 INFO L117 PetriNetUnfolderBase]: For 450437/450437 co-relation queries the response was YES. [2025-04-13 19:24:42,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232962 conditions, 440445 events. 338673/440445 cut-off events. For 450437/450437 co-relation queries the response was YES. Maximal size of possible extension queue 13514. Compared 2998898 event pairs, 47625 based on Foata normal form. 0/388515 useless extension candidates. Maximal degree in co-relation 1232856. Up to 141454 conditions per place. [2025-04-13 19:24:44,120 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 148 selfloop transitions, 43 changer transitions 0/192 dead transitions. [2025-04-13 19:24:44,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 192 transitions, 1430 flow [2025-04-13 19:24:44,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:24:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:24:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-04-13 19:24:44,121 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-04-13 19:24:44,121 INFO L175 Difference]: Start difference. First operand has 52 places, 59 transitions, 366 flow. Second operand 6 states and 144 transitions. [2025-04-13 19:24:44,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 192 transitions, 1430 flow [2025-04-13 19:24:50,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 192 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:24:50,500 INFO L231 Difference]: Finished difference. Result has 59 places, 89 transitions, 747 flow [2025-04-13 19:24:50,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=747, PETRI_PLACES=59, PETRI_TRANSITIONS=89} [2025-04-13 19:24:50,500 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2025-04-13 19:24:50,500 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 89 transitions, 747 flow [2025-04-13 19:24:50,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:24:50,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:24:50,500 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:24:50,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 19:24:50,501 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:24:50,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:24:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1650538028, now seen corresponding path program 2 times [2025-04-13 19:24:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:24:50,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614845536] [2025-04-13 19:24:50,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:24:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:24:50,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:24:50,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:24:50,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:24:50,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:24:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:24:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:24:50,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614845536] [2025-04-13 19:24:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614845536] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:24:50,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:24:50,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:24:50,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504079790] [2025-04-13 19:24:50,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:24:50,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:24:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:24:50,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:24:50,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:24:50,542 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 19:24:50,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 89 transitions, 747 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:24:50,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:24:50,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 19:24:50,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:25:14,897 INFO L116 PetriNetUnfolderBase]: 375521/490751 cut-off events. [2025-04-13 19:25:14,897 INFO L117 PetriNetUnfolderBase]: For 792583/792583 co-relation queries the response was YES. [2025-04-13 19:25:16,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509843 conditions, 490751 events. 375521/490751 cut-off events. For 792583/792583 co-relation queries the response was YES. Maximal size of possible extension queue 15133. Compared 3431843 event pairs, 39679 based on Foata normal form. 4484/445811 useless extension candidates. Maximal degree in co-relation 803403. Up to 146070 conditions per place. [2025-04-13 19:25:18,262 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 170 selfloop transitions, 67 changer transitions 0/238 dead transitions. [2025-04-13 19:25:18,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 238 transitions, 2036 flow [2025-04-13 19:25:18,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:25:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:25:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2025-04-13 19:25:18,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6890756302521008 [2025-04-13 19:25:18,264 INFO L175 Difference]: Start difference. First operand has 59 places, 89 transitions, 747 flow. Second operand 7 states and 164 transitions. [2025-04-13 19:25:18,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 238 transitions, 2036 flow [2025-04-13 19:25:26,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 238 transitions, 2036 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:25:26,453 INFO L231 Difference]: Finished difference. Result has 69 places, 123 transitions, 1383 flow [2025-04-13 19:25:26,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1383, PETRI_PLACES=69, PETRI_TRANSITIONS=123} [2025-04-13 19:25:26,453 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-04-13 19:25:26,453 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 123 transitions, 1383 flow [2025-04-13 19:25:26,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:25:26,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:25:26,454 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:25:26,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 19:25:26,454 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:25:26,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:25:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1830721714, now seen corresponding path program 1 times [2025-04-13 19:25:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:25:26,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080950691] [2025-04-13 19:25:26,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:25:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:25:26,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:25:26,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:25:26,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:25:26,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:25:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:25:26,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:25:26,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080950691] [2025-04-13 19:25:26,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080950691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:25:26,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:25:26,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:25:26,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050259065] [2025-04-13 19:25:26,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:25:26,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:25:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:25:26,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:25:26,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:25:26,481 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 19:25:26,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 123 transitions, 1383 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:25:26,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:25:26,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 19:25:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:26:03,832 INFO L116 PetriNetUnfolderBase]: 506099/665281 cut-off events. [2025-04-13 19:26:03,833 INFO L117 PetriNetUnfolderBase]: For 2232466/2232466 co-relation queries the response was YES. [2025-04-13 19:26:05,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243448 conditions, 665281 events. 506099/665281 cut-off events. For 2232466/2232466 co-relation queries the response was YES. Maximal size of possible extension queue 21150. Compared 4761388 event pairs, 242865 based on Foata normal form. 0/606183 useless extension candidates. Maximal degree in co-relation 1175239. Up to 436290 conditions per place. [2025-04-13 19:26:09,006 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 136 selfloop transitions, 78 changer transitions 0/215 dead transitions. [2025-04-13 19:26:09,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 215 transitions, 2827 flow [2025-04-13 19:26:09,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:26:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:26:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-13 19:26:09,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-04-13 19:26:09,007 INFO L175 Difference]: Start difference. First operand has 69 places, 123 transitions, 1383 flow. Second operand 3 states and 60 transitions. [2025-04-13 19:26:09,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 215 transitions, 2827 flow [2025-04-13 19:27:03,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 215 transitions, 2719 flow, removed 26 selfloop flow, removed 1 redundant places. [2025-04-13 19:27:03,536 INFO L231 Difference]: Finished difference. Result has 72 places, 178 transitions, 2477 flow [2025-04-13 19:27:03,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2477, PETRI_PLACES=72, PETRI_TRANSITIONS=178} [2025-04-13 19:27:03,537 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2025-04-13 19:27:03,537 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 178 transitions, 2477 flow [2025-04-13 19:27:03,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:27:03,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:27:03,537 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:27:03,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 19:27:03,538 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:27:03,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:27:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash -455691285, now seen corresponding path program 1 times [2025-04-13 19:27:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:27:03,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188347098] [2025-04-13 19:27:03,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:27:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:27:03,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:27:03,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:27:03,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:27:03,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:27:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:27:03,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:27:03,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188347098] [2025-04-13 19:27:03,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188347098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:27:03,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:27:03,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:27:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586969199] [2025-04-13 19:27:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:27:03,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:27:03,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:27:03,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:27:03,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:27:03,588 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2025-04-13 19:27:03,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 178 transitions, 2477 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:27:03,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:27:03,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2025-04-13 19:27:03,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand