/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 21:47:17,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 21:47:17,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 21:47:17,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 21:47:17,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 21:47:17,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 21:47:17,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 21:47:17,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 21:47:17,948 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:47:17,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 21:47:17,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 21:47:17,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 21:47:17,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 21:47:17,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 21:47:17,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 21:47:18,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 21:47:18,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 21:47:18,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 21:47:18,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 21:47:18,218 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 21:47:18,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-03-14 21:47:19,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9423832/9cd59ca712c74a81bf0fecdf4132eb9e/FLAG4cc7883cb [2025-03-14 21:47:19,660 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 21:47:19,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-03-14 21:47:19,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9423832/9cd59ca712c74a81bf0fecdf4132eb9e/FLAG4cc7883cb [2025-03-14 21:47:19,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9423832/9cd59ca712c74a81bf0fecdf4132eb9e [2025-03-14 21:47:19,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 21:47:19,701 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 21:47:19,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 21:47:19,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 21:47:19,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 21:47:19,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:47:19" (1/1) ... [2025-03-14 21:47:19,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5915be98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:19, skipping insertion in model container [2025-03-14 21:47:19,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 09:47:19" (1/1) ... [2025-03-14 21:47:19,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 21:47:20,100 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-complex/workstealqueue_mutex-2.i[76469,76482] [2025-03-14 21:47:20,136 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-complex/workstealqueue_mutex-2.i[79042,79055] [2025-03-14 21:47:20,140 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-complex/workstealqueue_mutex-2.i[79451,79464] [2025-03-14 21:47:20,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:47:20,168 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 21:47:20,208 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-complex/workstealqueue_mutex-2.i[76469,76482] [2025-03-14 21:47:20,227 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-complex/workstealqueue_mutex-2.i[79042,79055] [2025-03-14 21:47:20,231 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-complex/workstealqueue_mutex-2.i[79451,79464] [2025-03-14 21:47:20,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 21:47:20,350 INFO L204 MainTranslator]: Completed translation [2025-03-14 21:47:20,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20 WrapperNode [2025-03-14 21:47:20,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 21:47:20,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 21:47:20,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 21:47:20,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 21:47:20,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,449 INFO L138 Inliner]: procedures = 491, calls = 156, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1847 [2025-03-14 21:47:20,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 21:47:20,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 21:47:20,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 21:47:20,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 21:47:20,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 21:47:20,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 21:47:20,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 21:47:20,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 21:47:20,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (1/1) ... [2025-03-14 21:47:20,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 21:47:20,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:47:20,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 21:47:20,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 21:47:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2025-03-14 21:47:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2025-03-14 21:47:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 21:47:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 21:47:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 21:47:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 21:47:20,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 21:47:20,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 21:47:20,629 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 21:47:20,857 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 21:47:20,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 21:47:22,456 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 21:47:22,457 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 21:47:22,783 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 21:47:22,784 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 21:47:22,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:47:22 BoogieIcfgContainer [2025-03-14 21:47:22,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 21:47:22,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 21:47:22,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 21:47:22,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 21:47:22,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 09:47:19" (1/3) ... [2025-03-14 21:47:22,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628345bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:47:22, skipping insertion in model container [2025-03-14 21:47:22,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 09:47:20" (2/3) ... [2025-03-14 21:47:22,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628345bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 09:47:22, skipping insertion in model container [2025-03-14 21:47:22,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 09:47:22" (3/3) ... [2025-03-14 21:47:22,794 INFO L128 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2025-03-14 21:47:22,806 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 21:47:22,808 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG workstealqueue_mutex-2.i that has 2 procedures, 1718 locations, 1 initial locations, 11 loop locations, and 5 error locations. [2025-03-14 21:47:22,808 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 21:47:22,986 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 21:47:23,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:47:23,081 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c760fb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:47:23,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 21:47:23,156 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:47:23,156 INFO L124 PetriNetUnfolderBase]: 1/190 cut-off events. [2025-03-14 21:47:23,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 21:47:23,157 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:47:23,158 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:47:23,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:47:23,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:47:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -738525582, now seen corresponding path program 1 times [2025-03-14 21:47:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:47:23,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095872405] [2025-03-14 21:47:23,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:47:23,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:47:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:47:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:47:23,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:47:23,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095872405] [2025-03-14 21:47:23,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095872405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:47:23,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:47:23,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:47:23,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021157975] [2025-03-14 21:47:23,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:47:23,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:47:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:47:23,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:47:23,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:47:23,688 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1653 out of 1777 [2025-03-14 21:47:23,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1721 places, 1777 transitions, 3561 flow. Second operand has 3 states, 3 states have (on average 1657.0) internal successors, (4971), 3 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:47:23,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:47:23,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1653 of 1777 [2025-03-14 21:47:23,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:47:30,365 INFO L124 PetriNetUnfolderBase]: 1899/25257 cut-off events. [2025-03-14 21:47:30,365 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 21:47:30,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27718 conditions, 25257 events. 1899/25257 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 252716 event pairs, 458 based on Foata normal form. 66/24457 useless extension candidates. Maximal degree in co-relation 27505. Up to 1253 conditions per place. [2025-03-14 21:47:30,537 INFO L140 encePairwiseOnDemand]: 1754/1777 looper letters, 189 selfloop transitions, 12 changer transitions 9/1858 dead transitions. [2025-03-14 21:47:30,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1718 places, 1858 transitions, 4133 flow [2025-03-14 21:47:30,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:47:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:47:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5180 transitions. [2025-03-14 21:47:30,563 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9716751078596886 [2025-03-14 21:47:30,565 INFO L298 CegarLoopForPetriNet]: 1721 programPoint places, -3 predicate places. [2025-03-14 21:47:30,566 INFO L471 AbstractCegarLoop]: Abstraction has has 1718 places, 1858 transitions, 4133 flow [2025-03-14 21:47:30,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1657.0) internal successors, (4971), 3 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:47:30,568 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:47:30,568 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:47:30,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 21:47:30,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:47:30,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:47:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash 878011444, now seen corresponding path program 1 times [2025-03-14 21:47:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:47:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035371113] [2025-03-14 21:47:30,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:47:30,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:47:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:47:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:47:30,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:47:30,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035371113] [2025-03-14 21:47:30,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035371113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:47:30,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855126127] [2025-03-14 21:47:30,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:47:30,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:47:30,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:47:30,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:47:30,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 21:47:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:47:31,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 21:47:31,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:47:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:47:31,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:47:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:47:31,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855126127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:47:31,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:47:31,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 21:47:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394535241] [2025-03-14 21:47:31,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:47:31,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:47:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:47:31,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:47:31,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:47:31,197 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1652 out of 1777 [2025-03-14 21:47:31,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1718 places, 1858 transitions, 4133 flow. Second operand has 10 states, 10 states have (on average 1654.9) internal successors, (16549), 10 states have internal predecessors, (16549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:47:31,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:47:31,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1652 of 1777 [2025-03-14 21:47:31,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:47:37,714 INFO L124 PetriNetUnfolderBase]: 1910/25767 cut-off events. [2025-03-14 21:47:37,714 INFO L125 PetriNetUnfolderBase]: For 1233/1509 co-relation queries the response was YES. [2025-03-14 21:47:37,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30676 conditions, 25767 events. 1910/25767 cut-off events. For 1233/1509 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 258064 event pairs, 780 based on Foata normal form. 5/24843 useless extension candidates. Maximal degree in co-relation 30402. Up to 1248 conditions per place. [2025-03-14 21:47:37,867 INFO L140 encePairwiseOnDemand]: 1756/1777 looper letters, 190 selfloop transitions, 26 changer transitions 9/1872 dead transitions. [2025-03-14 21:47:37,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1726 places, 1872 transitions, 4625 flow [2025-03-14 21:47:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:47:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:47:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15090 transitions. [2025-03-14 21:47:37,890 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9435377977865316 [2025-03-14 21:47:37,891 INFO L298 CegarLoopForPetriNet]: 1721 programPoint places, 5 predicate places. [2025-03-14 21:47:37,891 INFO L471 AbstractCegarLoop]: Abstraction has has 1726 places, 1872 transitions, 4625 flow [2025-03-14 21:47:37,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1654.9) internal successors, (16549), 10 states have internal predecessors, (16549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:47:37,899 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:47:37,899 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:47:37,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 21:47:38,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:47:38,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:47:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:47:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash 270856248, now seen corresponding path program 2 times [2025-03-14 21:47:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:47:38,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152185853] [2025-03-14 21:47:38,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:47:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:47:38,161 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:47:38,161 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:47:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:47:38,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:47:38,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152185853] [2025-03-14 21:47:38,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152185853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:47:38,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339215774] [2025-03-14 21:47:38,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:47:38,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:47:38,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:47:38,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:47:38,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 21:47:38,851 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 21:47:38,851 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:47:38,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 21:47:38,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:47:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:47:38,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:47:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:47:38,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339215774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:47:38,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:47:38,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2025-03-14 21:47:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930195407] [2025-03-14 21:47:38,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:47:38,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 21:47:38,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:47:38,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 21:47:38,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-14 21:47:38,995 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1652 out of 1777 [2025-03-14 21:47:39,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1726 places, 1872 transitions, 4625 flow. Second operand has 11 states, 11 states have (on average 1654.909090909091) internal successors, (18204), 11 states have internal predecessors, (18204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:47:39,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:47:39,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1652 of 1777 [2025-03-14 21:47:39,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:47:46,165 INFO L124 PetriNetUnfolderBase]: 1910/25739 cut-off events. [2025-03-14 21:47:46,166 INFO L125 PetriNetUnfolderBase]: For 3701/4249 co-relation queries the response was YES. [2025-03-14 21:47:46,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33115 conditions, 25739 events. 1910/25739 cut-off events. For 3701/4249 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 257473 event pairs, 780 based on Foata normal form. 10/24819 useless extension candidates. Maximal degree in co-relation 32772. Up to 1252 conditions per place. [2025-03-14 21:47:46,329 INFO L140 encePairwiseOnDemand]: 1756/1777 looper letters, 192 selfloop transitions, 29 changer transitions 9/1877 dead transitions. [2025-03-14 21:47:46,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1737 places, 1877 transitions, 5103 flow [2025-03-14 21:47:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 21:47:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 21:47:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20050 transitions. [2025-03-14 21:47:46,350 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9402551116113299 [2025-03-14 21:47:46,351 INFO L298 CegarLoopForPetriNet]: 1721 programPoint places, 16 predicate places. [2025-03-14 21:47:46,351 INFO L471 AbstractCegarLoop]: Abstraction has has 1737 places, 1877 transitions, 5103 flow [2025-03-14 21:47:46,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1654.909090909091) internal successors, (18204), 11 states have internal predecessors, (18204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:47:46,359 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:47:46,360 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:47:46,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 21:47:46,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-14 21:47:46,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:47:46,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:47:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2039982470, now seen corresponding path program 3 times [2025-03-14 21:47:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:47:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575113275] [2025-03-14 21:47:46,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 21:47:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:47:46,649 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-14 21:47:46,649 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2025-03-14 21:47:46,649 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 21:47:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 21:47:46,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 21:47:46,718 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 21:47:46,719 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-14 21:47:46,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-14 21:47:46,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-14 21:47:46,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-14 21:47:46,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-14 21:47:46,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-14 21:47:46,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 21:47:46,722 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-14 21:47:46,723 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 21:47:46,724 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 21:47:46,826 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 21:47:46,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 21:47:46,843 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c760fb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 21:47:46,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 21:47:46,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 21:47:46,860 INFO L124 PetriNetUnfolderBase]: 1/192 cut-off events. [2025-03-14 21:47:46,860 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 21:47:46,860 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:47:46,860 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:47:46,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:47:46,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:47:46,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1405754128, now seen corresponding path program 1 times [2025-03-14 21:47:46,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:47:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065312118] [2025-03-14 21:47:46,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:47:46,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:47:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:47:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:47:46,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:47:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065312118] [2025-03-14 21:47:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065312118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:47:46,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:47:46,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 21:47:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764847527] [2025-03-14 21:47:46,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:47:46,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 21:47:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:47:46,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 21:47:46,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 21:47:46,999 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1803 out of 1936 [2025-03-14 21:47:47,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1876 places, 1936 transitions, 3888 flow. Second operand has 3 states, 3 states have (on average 1808.6666666666667) internal successors, (5426), 3 states have internal predecessors, (5426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:47:47,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:47:47,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1803 of 1936 [2025-03-14 21:47:47,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:48:53,722 INFO L124 PetriNetUnfolderBase]: 25569/235837 cut-off events. [2025-03-14 21:48:53,722 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-03-14 21:48:56,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266461 conditions, 235837 events. 25569/235837 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 3683616 event pairs, 9916 based on Foata normal form. 610/228245 useless extension candidates. Maximal degree in co-relation 34084. Up to 15885 conditions per place. [2025-03-14 21:48:56,711 INFO L140 encePairwiseOnDemand]: 1913/1936 looper letters, 215 selfloop transitions, 12 changer transitions 0/2030 dead transitions. [2025-03-14 21:48:56,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1873 places, 2030 transitions, 4536 flow [2025-03-14 21:48:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 21:48:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 21:48:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5652 transitions. [2025-03-14 21:48:56,717 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9731404958677686 [2025-03-14 21:48:56,717 INFO L298 CegarLoopForPetriNet]: 1876 programPoint places, -3 predicate places. [2025-03-14 21:48:56,717 INFO L471 AbstractCegarLoop]: Abstraction has has 1873 places, 2030 transitions, 4536 flow [2025-03-14 21:48:56,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1808.6666666666667) internal successors, (5426), 3 states have internal predecessors, (5426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:48:56,718 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:48:56,719 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:48:56,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 21:48:56,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:48:56,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:48:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash 897560121, now seen corresponding path program 1 times [2025-03-14 21:48:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:48:56,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142757706] [2025-03-14 21:48:56,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:48:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:48:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:48:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:48:56,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:48:56,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142757706] [2025-03-14 21:48:56,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142757706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:48:56,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390420952] [2025-03-14 21:48:56,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:48:56,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:48:56,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:48:56,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:48:56,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 21:48:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:48:56,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 21:48:56,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:48:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:48:57,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:48:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:48:57,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390420952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:48:57,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:48:57,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 21:48:57,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957314655] [2025-03-14 21:48:57,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:48:57,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 21:48:57,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:48:57,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 21:48:57,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 21:48:57,052 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1802 out of 1936 [2025-03-14 21:48:57,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1873 places, 2030 transitions, 4536 flow. Second operand has 10 states, 10 states have (on average 1805.0) internal successors, (18050), 10 states have internal predecessors, (18050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:48:57,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:48:57,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1802 of 1936 [2025-03-14 21:48:57,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:50:02,442 INFO L124 PetriNetUnfolderBase]: 27000/243698 cut-off events. [2025-03-14 21:50:02,442 INFO L125 PetriNetUnfolderBase]: For 11818/17103 co-relation queries the response was YES. [2025-03-14 21:50:05,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307478 conditions, 243698 events. 27000/243698 cut-off events. For 11818/17103 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 3805596 event pairs, 9912 based on Foata normal form. 150/234992 useless extension candidates. Maximal degree in co-relation 173329. Up to 16326 conditions per place. [2025-03-14 21:50:06,236 INFO L140 encePairwiseOnDemand]: 1915/1936 looper letters, 234 selfloop transitions, 29 changer transitions 0/2065 dead transitions. [2025-03-14 21:50:06,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1881 places, 2065 transitions, 5198 flow [2025-03-14 21:50:06,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:50:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:50:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16483 transitions. [2025-03-14 21:50:06,251 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.945994031221304 [2025-03-14 21:50:06,252 INFO L298 CegarLoopForPetriNet]: 1876 programPoint places, 5 predicate places. [2025-03-14 21:50:06,252 INFO L471 AbstractCegarLoop]: Abstraction has has 1881 places, 2065 transitions, 5198 flow [2025-03-14 21:50:06,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1805.0) internal successors, (18050), 10 states have internal predecessors, (18050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:50:06,255 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:50:06,255 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:50:06,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 21:50:06,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:50:06,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:50:06,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:50:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -52063939, now seen corresponding path program 2 times [2025-03-14 21:50:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:50:06,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234984075] [2025-03-14 21:50:06,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 21:50:06,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:50:06,489 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 21:50:06,490 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 21:50:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-14 21:50:06,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:50:06,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234984075] [2025-03-14 21:50:06,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234984075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:50:06,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:50:06,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 21:50:06,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600048927] [2025-03-14 21:50:06,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:50:06,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 21:50:06,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:50:06,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 21:50:06,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 21:50:06,617 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1802 out of 1936 [2025-03-14 21:50:06,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1881 places, 2065 transitions, 5198 flow. Second operand has 7 states, 7 states have (on average 1805.5714285714287) internal successors, (12639), 7 states have internal predecessors, (12639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:50:06,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:50:06,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1802 of 1936 [2025-03-14 21:50:06,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:51:14,771 INFO L124 PetriNetUnfolderBase]: 26901/243004 cut-off events. [2025-03-14 21:51:14,771 INFO L125 PetriNetUnfolderBase]: For 34364/40825 co-relation queries the response was YES. [2025-03-14 21:51:17,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338644 conditions, 243004 events. 26901/243004 cut-off events. For 34364/40825 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 3785760 event pairs, 6217 based on Foata normal form. 238/235042 useless extension candidates. Maximal degree in co-relation 265399. Up to 16210 conditions per place. [2025-03-14 21:51:18,691 INFO L140 encePairwiseOnDemand]: 1914/1936 looper letters, 316 selfloop transitions, 24 changer transitions 0/2143 dead transitions. [2025-03-14 21:51:18,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1888 places, 2143 transitions, 6344 flow [2025-03-14 21:51:18,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 21:51:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 21:51:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16519 transitions. [2025-03-14 21:51:18,700 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9480601469237833 [2025-03-14 21:51:18,701 INFO L298 CegarLoopForPetriNet]: 1876 programPoint places, 12 predicate places. [2025-03-14 21:51:18,701 INFO L471 AbstractCegarLoop]: Abstraction has has 1888 places, 2143 transitions, 6344 flow [2025-03-14 21:51:18,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1805.5714285714287) internal successors, (12639), 7 states have internal predecessors, (12639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:51:18,703 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:51:18,704 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:51:18,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 21:51:18,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:51:18,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:51:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1916479846, now seen corresponding path program 1 times [2025-03-14 21:51:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:51:18,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294772364] [2025-03-14 21:51:18,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:51:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:51:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:51:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-14 21:51:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:51:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294772364] [2025-03-14 21:51:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294772364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 21:51:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 21:51:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 21:51:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022037716] [2025-03-14 21:51:18,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 21:51:18,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 21:51:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:51:18,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 21:51:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 21:51:18,958 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1802 out of 1936 [2025-03-14 21:51:18,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1888 places, 2143 transitions, 6344 flow. Second operand has 5 states, 5 states have (on average 1807.6) internal successors, (9038), 5 states have internal predecessors, (9038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:51:18,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:51:18,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1802 of 1936 [2025-03-14 21:51:18,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 21:52:28,247 INFO L124 PetriNetUnfolderBase]: 25028/217671 cut-off events. [2025-03-14 21:52:28,248 INFO L125 PetriNetUnfolderBase]: For 61532/70933 co-relation queries the response was YES. [2025-03-14 21:52:31,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335609 conditions, 217671 events. 25028/217671 cut-off events. For 61532/70933 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 3320343 event pairs, 5971 based on Foata normal form. 466/210810 useless extension candidates. Maximal degree in co-relation 249328. Up to 15016 conditions per place. [2025-03-14 21:52:32,220 INFO L140 encePairwiseOnDemand]: 1918/1936 looper letters, 318 selfloop transitions, 21 changer transitions 0/2142 dead transitions. [2025-03-14 21:52:32,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1893 places, 2142 transitions, 7014 flow [2025-03-14 21:52:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 21:52:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 21:52:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11070 transitions. [2025-03-14 21:52:32,226 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.952995867768595 [2025-03-14 21:52:32,226 INFO L298 CegarLoopForPetriNet]: 1876 programPoint places, 17 predicate places. [2025-03-14 21:52:32,227 INFO L471 AbstractCegarLoop]: Abstraction has has 1893 places, 2142 transitions, 7014 flow [2025-03-14 21:52:32,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1807.6) internal successors, (9038), 5 states have internal predecessors, (9038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:52:32,228 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 21:52:32,228 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 21:52:32,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 21:52:32,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 21:52:32,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 21:52:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash 780934399, now seen corresponding path program 1 times [2025-03-14 21:52:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 21:52:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529976922] [2025-03-14 21:52:32,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:52:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 21:52:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:52:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:52:32,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 21:52:32,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529976922] [2025-03-14 21:52:32,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529976922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 21:52:32,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23747390] [2025-03-14 21:52:32,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 21:52:32,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 21:52:32,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 21:52:32,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 21:52:32,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 21:52:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 21:52:32,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 21:52:32,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 21:52:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:52:32,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 21:52:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 21:52:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23747390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 21:52:32,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 21:52:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2025-03-14 21:52:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189375978] [2025-03-14 21:52:32,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 21:52:32,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 21:52:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 21:52:32,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 21:52:32,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-14 21:52:32,923 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 1802 out of 1936 [2025-03-14 21:52:32,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1893 places, 2142 transitions, 7014 flow. Second operand has 11 states, 11 states have (on average 1806.0) internal successors, (19866), 11 states have internal predecessors, (19866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 21:52:32,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 21:52:32,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1802 of 1936 [2025-03-14 21:52:32,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand