./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f225ad0ddd29038af28d51fbbac3525492e9437e240dca78f58919375937976a --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:17:37,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:17:37,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:17:37,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:17:37,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:17:37,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:17:37,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:17:37,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:17:37,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:17:37,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:17:37,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:17:37,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:17:37,622 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:17:37,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:17:37,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:17:37,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:17:37,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:17:37,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:17:37,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:17:37,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:17:37,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:17:37,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:17:37,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:17:37,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:17:37,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:17:37,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:17:37,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:17:37,625 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f225ad0ddd29038af28d51fbbac3525492e9437e240dca78f58919375937976a [2025-03-14 01:17:37,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:17:37,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:17:37,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:17:37,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:17:37,861 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:17:37,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i [2025-03-14 01:17:38,964 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf59acc5/0e47f01a85e644588a32465f7f0ca868/FLAG42f51fa48 [2025-03-14 01:17:39,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:17:39,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i [2025-03-14 01:17:39,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf59acc5/0e47f01a85e644588a32465f7f0ca868/FLAG42f51fa48 [2025-03-14 01:17:39,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf59acc5/0e47f01a85e644588a32465f7f0ca868 [2025-03-14 01:17:39,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:17:39,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:17:39,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:17:39,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:17:39,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:17:39,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac4823c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39, skipping insertion in model container [2025-03-14 01:17:39,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:17:39,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:17:39,763 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:17:39,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:17:39,822 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:17:39,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39 WrapperNode [2025-03-14 01:17:39,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:17:39,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:17:39,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:17:39,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:17:39,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,854 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-03-14 01:17:39,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:17:39,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:17:39,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:17:39,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:17:39,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:17:39,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:17:39,875 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:17:39,875 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:17:39,876 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (1/1) ... [2025-03-14 01:17:39,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:17:39,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:39,899 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-03-14 01:17:39,900 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-03-14 01:17:39,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:17:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 01:17:39,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 01:17:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:17:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:17:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:17:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:17:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:17:39,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:17:39,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:17:39,917 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:17:39,989 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:17:39,990 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:17:40,141 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:17:40,142 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:17:40,142 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:17:40,157 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:17:40,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:17:40 BoogieIcfgContainer [2025-03-14 01:17:40,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:17:40,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:17:40,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:17:40,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:17:40,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:17:39" (1/3) ... [2025-03-14 01:17:40,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38032a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:17:40, skipping insertion in model container [2025-03-14 01:17:40,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:17:39" (2/3) ... [2025-03-14 01:17:40,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38032a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:17:40, skipping insertion in model container [2025-03-14 01:17:40,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:17:40" (3/3) ... [2025-03-14 01:17:40,164 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-race.i [2025-03-14 01:17:40,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:17:40,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-race.i that has 2 procedures, 110 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-14 01:17:40,176 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:17:40,251 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:40,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 116 transitions, 236 flow [2025-03-14 01:17:40,330 INFO L124 PetriNetUnfolderBase]: 6/123 cut-off events. [2025-03-14 01:17:40,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:40,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 123 events. 6/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 139 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-03-14 01:17:40,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 116 transitions, 236 flow [2025-03-14 01:17:40,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 116 transitions, 236 flow [2025-03-14 01:17:40,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:40,364 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=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;@5f8c837d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:40,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-14 01:17:40,376 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:40,376 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:17:40,376 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:40,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:40,377 INFO L206 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] [2025-03-14 01:17:40,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:40,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash 174401161, now seen corresponding path program 1 times [2025-03-14 01:17:40,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:40,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273943311] [2025-03-14 01:17:40,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:40,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:17:40,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:17:40,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:40,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:41,044 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 01:17:41,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:41,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273943311] [2025-03-14 01:17:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273943311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:41,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:41,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:41,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898834637] [2025-03-14 01:17:41,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:41,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:41,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:41,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:41,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 116 [2025-03-14 01:17:41,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 116 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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 01:17:41,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:41,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 116 [2025-03-14 01:17:41,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:41,286 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2025-03-14 01:17:41,289 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:17:41,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 109 events. 3/109 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 11/111 useless extension candidates. Maximal degree in co-relation 69. Up to 14 conditions per place. [2025-03-14 01:17:41,291 INFO L140 encePairwiseOnDemand]: 106/116 looper letters, 13 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-14 01:17:41,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 106 transitions, 252 flow [2025-03-14 01:17:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:17:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:17:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2025-03-14 01:17:41,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175287356321839 [2025-03-14 01:17:41,312 INFO L175 Difference]: Start difference. First operand has 113 places, 116 transitions, 236 flow. Second operand 6 states and 569 transitions. [2025-03-14 01:17:41,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 106 transitions, 252 flow [2025-03-14 01:17:41,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:41,320 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 226 flow [2025-03-14 01:17:41,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-03-14 01:17:41,327 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -2 predicate places. [2025-03-14 01:17:41,327 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 226 flow [2025-03-14 01:17:41,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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 01:17:41,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:41,328 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:17:41,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:17:41,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:41,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -148451151, now seen corresponding path program 1 times [2025-03-14 01:17:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:41,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390892737] [2025-03-14 01:17:41,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:41,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:17:41,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:17:41,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:41,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:41,382 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 01:17:41,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:41,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390892737] [2025-03-14 01:17:41,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390892737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:41,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:41,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:17:41,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746666078] [2025-03-14 01:17:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:41,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:41,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:41,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:41,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 116 [2025-03-14 01:17:41,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 01:17:41,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:41,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 116 [2025-03-14 01:17:41,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:41,444 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2025-03-14 01:17:41,446 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:17:41,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 121 events. 3/121 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 84. Up to 9 conditions per place. [2025-03-14 01:17:41,447 INFO L140 encePairwiseOnDemand]: 113/116 looper letters, 7 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-14 01:17:41,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 107 transitions, 248 flow [2025-03-14 01:17:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2025-03-14 01:17:41,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-03-14 01:17:41,449 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 226 flow. Second operand 3 states and 316 transitions. [2025-03-14 01:17:41,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 107 transitions, 248 flow [2025-03-14 01:17:41,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:17:41,455 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 228 flow [2025-03-14 01:17:41,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-03-14 01:17:41,456 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -4 predicate places. [2025-03-14 01:17:41,457 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 228 flow [2025-03-14 01:17:41,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 01:17:41,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:41,458 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:17:41,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:17:41,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:41,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 381274216, now seen corresponding path program 1 times [2025-03-14 01:17:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:41,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415199318] [2025-03-14 01:17:41,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:41,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:17:41,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:17:41,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:41,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:41,563 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 01:17:41,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:41,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415199318] [2025-03-14 01:17:41,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415199318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:41,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695781582] [2025-03-14 01:17:41,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:41,567 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 01:17:41,568 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 01:17:41,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:17:41,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:17:41,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:41,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:41,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:17:41,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:41,732 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 01:17:41,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:41,791 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 01:17:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695781582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:41,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:41,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:17:41,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664730167] [2025-03-14 01:17:41,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:41,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:17:41,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:41,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:17:41,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:17:41,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116 [2025-03-14 01:17:41,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 228 flow. Second operand has 10 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 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 01:17:41,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:41,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116 [2025-03-14 01:17:41,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:41,929 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2025-03-14 01:17:41,929 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:17:41,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 136 events. 3/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 2/130 useless extension candidates. Maximal degree in co-relation 119. Up to 9 conditions per place. [2025-03-14 01:17:41,930 INFO L140 encePairwiseOnDemand]: 110/116 looper letters, 11 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-03-14 01:17:41,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 286 flow [2025-03-14 01:17:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:17:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:17:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 913 transitions. [2025-03-14 01:17:41,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8745210727969349 [2025-03-14 01:17:41,934 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 228 flow. Second operand 9 states and 913 transitions. [2025-03-14 01:17:41,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 286 flow [2025-03-14 01:17:41,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:41,937 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 276 flow [2025-03-14 01:17:41,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=276, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2025-03-14 01:17:41,938 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 6 predicate places. [2025-03-14 01:17:41,938 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 276 flow [2025-03-14 01:17:41,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 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 01:17:41,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:41,939 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-14 01:17:41,946 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 01:17:42,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:42,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:42,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:42,145 INFO L85 PathProgramCache]: Analyzing trace with hash -458587384, now seen corresponding path program 2 times [2025-03-14 01:17:42,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:42,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516457475] [2025-03-14 01:17:42,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:42,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:42,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-14 01:17:42,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:17:42,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:42,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:17:42,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:42,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516457475] [2025-03-14 01:17:42,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516457475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:42,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864497817] [2025-03-14 01:17:42,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:42,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:42,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:42,301 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 01:17:42,303 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 01:17:42,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-14 01:17:42,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:17:42,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:42,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:42,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:17:42,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:17:42,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:17:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864497817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:42,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:42,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:17:42,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532941970] [2025-03-14 01:17:42,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:42,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:17:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:42,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:17:42,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:17:42,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116 [2025-03-14 01:17:42,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 276 flow. Second operand has 15 states, 15 states have (on average 101.06666666666666) internal successors, (1516), 15 states have internal predecessors, (1516), 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 01:17:42,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:42,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116 [2025-03-14 01:17:42,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:42,843 INFO L124 PetriNetUnfolderBase]: 3/175 cut-off events. [2025-03-14 01:17:42,844 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:17:42,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 175 events. 3/175 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 3/170 useless extension candidates. Maximal degree in co-relation 185. Up to 9 conditions per place. [2025-03-14 01:17:42,846 INFO L140 encePairwiseOnDemand]: 110/116 looper letters, 14 selfloop transitions, 18 changer transitions 0/127 dead transitions. [2025-03-14 01:17:42,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 127 transitions, 414 flow [2025-03-14 01:17:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:17:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:17:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1817 transitions. [2025-03-14 01:17:42,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702107279693486 [2025-03-14 01:17:42,856 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 276 flow. Second operand 18 states and 1817 transitions. [2025-03-14 01:17:42,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 127 transitions, 414 flow [2025-03-14 01:17:42,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 127 transitions, 402 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:42,862 INFO L231 Difference]: Finished difference. Result has 139 places, 123 transitions, 376 flow [2025-03-14 01:17:42,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=376, PETRI_PLACES=139, PETRI_TRANSITIONS=123} [2025-03-14 01:17:42,863 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 26 predicate places. [2025-03-14 01:17:42,863 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 123 transitions, 376 flow [2025-03-14 01:17:42,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 101.06666666666666) internal successors, (1516), 15 states have internal predecessors, (1516), 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 01:17:42,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:42,865 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2025-03-14 01:17:42,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:17:43,065 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,SelfDestructingSolverStorable3 [2025-03-14 01:17:43,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:17:43,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:43,067 INFO L85 PathProgramCache]: Analyzing trace with hash 107965649, now seen corresponding path program 3 times [2025-03-14 01:17:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:43,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680483293] [2025-03-14 01:17:43,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:17:43,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:43,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 8 equivalence classes. [2025-03-14 01:17:43,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:17:43,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 01:17:43,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:43,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:17:43,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-14 01:17:43,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:17:43,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:43,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:43,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:17:43,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:17:43,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-14 01:17:43,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-14 01:17:43,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-14 01:17:43,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-14 01:17:43,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-14 01:17:43,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-14 01:17:43,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-14 01:17:43,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-14 01:17:43,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-14 01:17:43,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-14 01:17:43,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:17:43,184 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:17:43,187 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:17:43,188 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:17:43,210 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:43,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 180 transitions, 370 flow [2025-03-14 01:17:43,230 INFO L124 PetriNetUnfolderBase]: 11/196 cut-off events. [2025-03-14 01:17:43,230 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:17:43,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 196 events. 11/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 135. Up to 3 conditions per place. [2025-03-14 01:17:43,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 180 transitions, 370 flow [2025-03-14 01:17:43,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 180 transitions, 370 flow [2025-03-14 01:17:43,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:43,235 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=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;@5f8c837d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:43,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-14 01:17:43,238 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:43,238 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:17:43,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:43,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:43,238 INFO L206 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] [2025-03-14 01:17:43,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:43,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1008699203, now seen corresponding path program 1 times [2025-03-14 01:17:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:43,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250811861] [2025-03-14 01:17:43,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:43,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:43,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:17:43,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:17:43,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:43,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:43,399 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 01:17:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:43,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250811861] [2025-03-14 01:17:43,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250811861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:43,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:43,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:43,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697195569] [2025-03-14 01:17:43,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:43,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:43,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:43,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:43,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:43,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 180 [2025-03-14 01:17:43,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 180 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 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 01:17:43,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:43,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 180 [2025-03-14 01:17:43,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:43,589 INFO L124 PetriNetUnfolderBase]: 68/565 cut-off events. [2025-03-14 01:17:43,590 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:17:43,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 565 events. 68/565 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2649 event pairs, 42 based on Foata normal form. 90/566 useless extension candidates. Maximal degree in co-relation 461. Up to 117 conditions per place. [2025-03-14 01:17:43,598 INFO L140 encePairwiseOnDemand]: 167/180 looper letters, 20 selfloop transitions, 5 changer transitions 0/165 dead transitions. [2025-03-14 01:17:43,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 390 flow [2025-03-14 01:17:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:17:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:17:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2025-03-14 01:17:43,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305555555555556 [2025-03-14 01:17:43,600 INFO L175 Difference]: Start difference. First operand has 174 places, 180 transitions, 370 flow. Second operand 6 states and 897 transitions. [2025-03-14 01:17:43,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 390 flow [2025-03-14 01:17:43,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 165 transitions, 390 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:43,604 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 350 flow [2025-03-14 01:17:43,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=170, PETRI_TRANSITIONS=165} [2025-03-14 01:17:43,604 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -4 predicate places. [2025-03-14 01:17:43,605 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 350 flow [2025-03-14 01:17:43,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 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 01:17:43,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:43,606 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2025-03-14 01:17:43,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:17:43,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:43,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash -619562928, now seen corresponding path program 1 times [2025-03-14 01:17:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:43,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464751586] [2025-03-14 01:17:43,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:43,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-14 01:17:43,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-14 01:17:43,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:43,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:43,640 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 01:17:43,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:43,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464751586] [2025-03-14 01:17:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464751586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:43,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:43,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:17:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558466450] [2025-03-14 01:17:43,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:43,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:43,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:43,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:43,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 180 [2025-03-14 01:17:43,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 165 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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 01:17:43,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:43,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 180 [2025-03-14 01:17:43,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:43,705 INFO L124 PetriNetUnfolderBase]: 15/321 cut-off events. [2025-03-14 01:17:43,705 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-14 01:17:43,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 321 events. 15/321 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 898 event pairs, 6 based on Foata normal form. 1/289 useless extension candidates. Maximal degree in co-relation 308. Up to 24 conditions per place. [2025-03-14 01:17:43,710 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 10 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-14 01:17:43,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 378 flow [2025-03-14 01:17:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2025-03-14 01:17:43,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074074074074074 [2025-03-14 01:17:43,711 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 350 flow. Second operand 3 states and 490 transitions. [2025-03-14 01:17:43,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 378 flow [2025-03-14 01:17:43,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 366 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:17:43,717 INFO L231 Difference]: Finished difference. Result has 168 places, 166 transitions, 352 flow [2025-03-14 01:17:43,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=168, PETRI_TRANSITIONS=166} [2025-03-14 01:17:43,717 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -6 predicate places. [2025-03-14 01:17:43,718 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 352 flow [2025-03-14 01:17:43,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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 01:17:43,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:43,719 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2025-03-14 01:17:43,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:17:43,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:43,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:43,720 INFO L85 PathProgramCache]: Analyzing trace with hash 648955515, now seen corresponding path program 1 times [2025-03-14 01:17:43,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:43,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325830831] [2025-03-14 01:17:43,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:43,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:17:43,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:17:43,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:43,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:43,777 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 01:17:43,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:43,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325830831] [2025-03-14 01:17:43,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325830831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:43,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845977193] [2025-03-14 01:17:43,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:43,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:43,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:43,780 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 01:17:43,782 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 01:17:43,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:17:43,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:17:43,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:43,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:43,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:17:43,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:43,862 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 01:17:43,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845977193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:43,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:17:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387908627] [2025-03-14 01:17:43,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:43,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:17:43,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:43,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:17:43,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:17:43,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 180 [2025-03-14 01:17:43,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 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 01:17:43,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:43,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 180 [2025-03-14 01:17:43,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:44,029 INFO L124 PetriNetUnfolderBase]: 15/336 cut-off events. [2025-03-14 01:17:44,030 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:17:44,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 336 events. 15/336 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 871 event pairs, 6 based on Foata normal form. 2/305 useless extension candidates. Maximal degree in co-relation 343. Up to 24 conditions per place. [2025-03-14 01:17:44,031 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 14 selfloop transitions, 9 changer transitions 0/174 dead transitions. [2025-03-14 01:17:44,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 174 transitions, 416 flow [2025-03-14 01:17:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:17:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:17:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1429 transitions. [2025-03-14 01:17:44,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8820987654320988 [2025-03-14 01:17:44,034 INFO L175 Difference]: Start difference. First operand has 168 places, 166 transitions, 352 flow. Second operand 9 states and 1429 transitions. [2025-03-14 01:17:44,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 174 transitions, 416 flow [2025-03-14 01:17:44,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 174 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:44,036 INFO L231 Difference]: Finished difference. Result has 178 places, 172 transitions, 400 flow [2025-03-14 01:17:44,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=400, PETRI_PLACES=178, PETRI_TRANSITIONS=172} [2025-03-14 01:17:44,038 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 4 predicate places. [2025-03-14 01:17:44,038 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 172 transitions, 400 flow [2025-03-14 01:17:44,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 158.0) internal successors, (1580), 10 states have internal predecessors, (1580), 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 01:17:44,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:44,041 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-14 01:17:44,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:17:44,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:44,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:44,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2046702747, now seen corresponding path program 2 times [2025-03-14 01:17:44,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:44,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638813474] [2025-03-14 01:17:44,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:44,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:44,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-14 01:17:44,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:17:44,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:44,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638813474] [2025-03-14 01:17:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638813474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646502563] [2025-03-14 01:17:44,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:44,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:44,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:44,367 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 01:17:44,369 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 01:17:44,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-14 01:17:44,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:17:44,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:44,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:44,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:17:44,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:44,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:44,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646502563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:44,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:44,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:17:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878073752] [2025-03-14 01:17:44,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:44,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:17:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:44,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:17:44,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:17:44,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 180 [2025-03-14 01:17:44,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 172 transitions, 400 flow. Second operand has 15 states, 15 states have (on average 158.13333333333333) internal successors, (2372), 15 states have internal predecessors, (2372), 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 01:17:44,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:44,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 180 [2025-03-14 01:17:44,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:44,846 INFO L124 PetriNetUnfolderBase]: 15/375 cut-off events. [2025-03-14 01:17:44,847 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-14 01:17:44,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 375 events. 15/375 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 873 event pairs, 6 based on Foata normal form. 3/345 useless extension candidates. Maximal degree in co-relation 305. Up to 24 conditions per place. [2025-03-14 01:17:44,849 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 17 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2025-03-14 01:17:44,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 544 flow [2025-03-14 01:17:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:17:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:17:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2846 transitions. [2025-03-14 01:17:44,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8783950617283951 [2025-03-14 01:17:44,855 INFO L175 Difference]: Start difference. First operand has 178 places, 172 transitions, 400 flow. Second operand 18 states and 2846 transitions. [2025-03-14 01:17:44,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 544 flow [2025-03-14 01:17:44,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 186 transitions, 532 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:44,860 INFO L231 Difference]: Finished difference. Result has 198 places, 182 transitions, 500 flow [2025-03-14 01:17:44,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=500, PETRI_PLACES=198, PETRI_TRANSITIONS=182} [2025-03-14 01:17:44,862 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 24 predicate places. [2025-03-14 01:17:44,862 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 182 transitions, 500 flow [2025-03-14 01:17:44,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 158.13333333333333) internal successors, (2372), 15 states have internal predecessors, (2372), 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 01:17:44,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:44,863 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 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] [2025-03-14 01:17:44,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:17:45,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:45,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:17:45,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 932465136, now seen corresponding path program 3 times [2025-03-14 01:17:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:45,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314960141] [2025-03-14 01:17:45,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:17:45,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:45,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 7 equivalence classes. [2025-03-14 01:17:45,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 122 of 122 statements. [2025-03-14 01:17:45,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-14 01:17:45,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:45,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:17:45,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-14 01:17:45,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-14 01:17:45,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:45,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:45,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:17:45,143 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:17:45,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-14 01:17:45,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-14 01:17:45,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-14 01:17:45,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-14 01:17:45,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-14 01:17:45,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:17:45,145 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:17:45,145 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:17:45,145 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:17:45,170 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:45,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 244 transitions, 506 flow [2025-03-14 01:17:45,191 INFO L124 PetriNetUnfolderBase]: 16/269 cut-off events. [2025-03-14 01:17:45,192 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:17:45,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 269 events. 16/269 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 720 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 200. Up to 4 conditions per place. [2025-03-14 01:17:45,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 244 transitions, 506 flow [2025-03-14 01:17:45,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 244 transitions, 506 flow [2025-03-14 01:17:45,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:45,198 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=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;@5f8c837d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:45,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-14 01:17:45,202 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:45,202 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:17:45,202 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:45,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:45,202 INFO L206 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] [2025-03-14 01:17:45,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:17:45,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1753464015, now seen corresponding path program 1 times [2025-03-14 01:17:45,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:45,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733144582] [2025-03-14 01:17:45,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:45,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:45,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:17:45,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:17:45,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:45,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:45,365 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 01:17:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733144582] [2025-03-14 01:17:45,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733144582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:45,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:45,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:45,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496405126] [2025-03-14 01:17:45,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:45,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:45,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:45,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:45,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:45,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 244 [2025-03-14 01:17:45,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 244 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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 01:17:45,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:45,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 244 [2025-03-14 01:17:45,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:45,917 INFO L124 PetriNetUnfolderBase]: 870/4011 cut-off events. [2025-03-14 01:17:45,918 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2025-03-14 01:17:45,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5430 conditions, 4011 events. 870/4011 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 36487 event pairs, 630 based on Foata normal form. 755/4034 useless extension candidates. Maximal degree in co-relation 3233. Up to 1191 conditions per place. [2025-03-14 01:17:45,959 INFO L140 encePairwiseOnDemand]: 228/244 looper letters, 27 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2025-03-14 01:17:45,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 224 transitions, 530 flow [2025-03-14 01:17:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:17:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:17:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1225 transitions. [2025-03-14 01:17:45,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8367486338797814 [2025-03-14 01:17:45,962 INFO L175 Difference]: Start difference. First operand has 235 places, 244 transitions, 506 flow. Second operand 6 states and 1225 transitions. [2025-03-14 01:17:45,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 224 transitions, 530 flow [2025-03-14 01:17:45,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 224 transitions, 528 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:45,966 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 474 flow [2025-03-14 01:17:45,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2025-03-14 01:17:45,967 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, -6 predicate places. [2025-03-14 01:17:45,967 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 474 flow [2025-03-14 01:17:45,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.5) internal successors, (1191), 6 states have internal predecessors, (1191), 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 01:17:45,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:45,968 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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] [2025-03-14 01:17:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:17:45,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:17:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 91473326, now seen corresponding path program 1 times [2025-03-14 01:17:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726664704] [2025-03-14 01:17:45,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:45,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:17:45,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:17:45,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:45,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:45,995 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 01:17:45,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:45,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726664704] [2025-03-14 01:17:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726664704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:45,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:45,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:17:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707855850] [2025-03-14 01:17:45,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:45,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:45,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:45,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:46,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 244 [2025-03-14 01:17:46,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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 01:17:46,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:46,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 244 [2025-03-14 01:17:46,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:46,104 INFO L124 PetriNetUnfolderBase]: 69/939 cut-off events. [2025-03-14 01:17:46,104 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-14 01:17:46,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 939 events. 69/939 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5319 event pairs, 42 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 1016. Up to 87 conditions per place. [2025-03-14 01:17:46,113 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 13 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-03-14 01:17:46,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 225 transitions, 508 flow [2025-03-14 01:17:46,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-03-14 01:17:46,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907103825136612 [2025-03-14 01:17:46,115 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 474 flow. Second operand 3 states and 664 transitions. [2025-03-14 01:17:46,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 225 transitions, 508 flow [2025-03-14 01:17:46,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 225 transitions, 496 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:17:46,118 INFO L231 Difference]: Finished difference. Result has 227 places, 225 transitions, 476 flow [2025-03-14 01:17:46,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=227, PETRI_TRANSITIONS=225} [2025-03-14 01:17:46,120 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, -8 predicate places. [2025-03-14 01:17:46,120 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 225 transitions, 476 flow [2025-03-14 01:17:46,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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 01:17:46,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:46,121 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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] [2025-03-14 01:17:46,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:17:46,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:17:46,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:46,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1212945267, now seen corresponding path program 1 times [2025-03-14 01:17:46,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:46,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949975627] [2025-03-14 01:17:46,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:46,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:46,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:17:46,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:17:46,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:46,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:46,170 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 01:17:46,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:46,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949975627] [2025-03-14 01:17:46,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949975627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:46,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72938582] [2025-03-14 01:17:46,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:46,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:46,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:46,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:17:46,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:17:46,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:17:46,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:17:46,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:46,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:46,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:17:46,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:46,274 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 01:17:46,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:46,302 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 01:17:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72938582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:46,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:46,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:17:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110115362] [2025-03-14 01:17:46,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:46,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:17:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:46,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:17:46,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:17:46,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 244 [2025-03-14 01:17:46,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 225 transitions, 476 flow. Second operand has 10 states, 10 states have (on average 215.1) internal successors, (2151), 10 states have internal predecessors, (2151), 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 01:17:46,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:46,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 244 [2025-03-14 01:17:46,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:46,485 INFO L124 PetriNetUnfolderBase]: 69/954 cut-off events. [2025-03-14 01:17:46,485 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-14 01:17:46,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 954 events. 69/954 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5295 event pairs, 42 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 1051. Up to 87 conditions per place. [2025-03-14 01:17:46,491 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 17 selfloop transitions, 9 changer transitions 0/233 dead transitions. [2025-03-14 01:17:46,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 233 transitions, 546 flow [2025-03-14 01:17:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:17:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:17:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1945 transitions. [2025-03-14 01:17:46,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8857012750455373 [2025-03-14 01:17:46,495 INFO L175 Difference]: Start difference. First operand has 227 places, 225 transitions, 476 flow. Second operand 9 states and 1945 transitions. [2025-03-14 01:17:46,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 233 transitions, 546 flow [2025-03-14 01:17:46,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 233 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:46,497 INFO L231 Difference]: Finished difference. Result has 237 places, 231 transitions, 524 flow [2025-03-14 01:17:46,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=524, PETRI_PLACES=237, PETRI_TRANSITIONS=231} [2025-03-14 01:17:46,498 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, 2 predicate places. [2025-03-14 01:17:46,498 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 231 transitions, 524 flow [2025-03-14 01:17:46,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 215.1) internal successors, (2151), 10 states have internal predecessors, (2151), 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 01:17:46,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:46,499 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2025-03-14 01:17:46,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 01:17:46,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 01:17:46,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:17:46,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1309776339, now seen corresponding path program 2 times [2025-03-14 01:17:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526583742] [2025-03-14 01:17:46,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:46,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-14 01:17:46,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:17:46,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:46,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:46,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:46,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526583742] [2025-03-14 01:17:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526583742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:46,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295218429] [2025-03-14 01:17:46,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:46,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:46,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:46,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:17:46,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:17:46,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-14 01:17:46,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:17:46,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:46,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:46,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:17:46,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:46,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:17:47,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295218429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:47,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:17:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913887683] [2025-03-14 01:17:47,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:47,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:17:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:47,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:17:47,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:17:47,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 244 [2025-03-14 01:17:47,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 231 transitions, 524 flow. Second operand has 15 states, 15 states have (on average 215.2) internal successors, (3228), 15 states have internal predecessors, (3228), 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 01:17:47,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:47,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 244 [2025-03-14 01:17:47,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:47,338 INFO L124 PetriNetUnfolderBase]: 69/993 cut-off events. [2025-03-14 01:17:47,338 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-14 01:17:47,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 993 events. 69/993 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5301 event pairs, 42 based on Foata normal form. 3/887 useless extension candidates. Maximal degree in co-relation 1013. Up to 87 conditions per place. [2025-03-14 01:17:47,346 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 20 selfloop transitions, 18 changer transitions 0/245 dead transitions. [2025-03-14 01:17:47,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 245 transitions, 674 flow [2025-03-14 01:17:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:17:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:17:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3875 transitions. [2025-03-14 01:17:47,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8822859744990893 [2025-03-14 01:17:47,357 INFO L175 Difference]: Start difference. First operand has 237 places, 231 transitions, 524 flow. Second operand 18 states and 3875 transitions. [2025-03-14 01:17:47,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 245 transitions, 674 flow [2025-03-14 01:17:47,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 245 transitions, 662 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:47,362 INFO L231 Difference]: Finished difference. Result has 257 places, 241 transitions, 624 flow [2025-03-14 01:17:47,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=624, PETRI_PLACES=257, PETRI_TRANSITIONS=241} [2025-03-14 01:17:47,363 INFO L279 CegarLoopForPetriNet]: 235 programPoint places, 22 predicate places. [2025-03-14 01:17:47,363 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 241 transitions, 624 flow [2025-03-14 01:17:47,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 215.2) internal successors, (3228), 15 states have internal predecessors, (3228), 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 01:17:47,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:47,365 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 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] [2025-03-14 01:17:47,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 01:17:47,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:47,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-14 01:17:47,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1050297550, now seen corresponding path program 3 times [2025-03-14 01:17:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:47,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181895707] [2025-03-14 01:17:47,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:17:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:47,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-03-14 01:17:47,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-03-14 01:17:47,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-14 01:17:47,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:47,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:17:47,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-14 01:17:47,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-14 01:17:47,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:47,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:47,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:17:47,651 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:17:47,651 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-14 01:17:47,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-14 01:17:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-14 01:17:47,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-14 01:17:47,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-14 01:17:47,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-14 01:17:47,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:17:47,653 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:17:47,653 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:17:47,653 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-14 01:17:47,694 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:47,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 296 places, 308 transitions, 644 flow [2025-03-14 01:17:47,724 INFO L124 PetriNetUnfolderBase]: 21/342 cut-off events. [2025-03-14 01:17:47,724 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:17:47,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 342 events. 21/342 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1104 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 277. Up to 5 conditions per place. [2025-03-14 01:17:47,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 308 transitions, 644 flow [2025-03-14 01:17:47,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 308 transitions, 644 flow [2025-03-14 01:17:47,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:47,735 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=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;@5f8c837d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:47,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-14 01:17:47,738 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:47,738 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:17:47,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:47,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:47,738 INFO L206 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] [2025-03-14 01:17:47,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:17:47,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2059893275, now seen corresponding path program 1 times [2025-03-14 01:17:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:47,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195761114] [2025-03-14 01:17:47,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:47,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:17:47,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:17:47,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:47,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:47,873 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 01:17:47,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195761114] [2025-03-14 01:17:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195761114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:47,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:47,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:47,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569379998] [2025-03-14 01:17:47,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:47,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:47,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:47,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:47,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:48,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 308 [2025-03-14 01:17:48,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 308 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 251.5) internal successors, (1509), 6 states have internal predecessors, (1509), 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 01:17:48,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:48,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 308 [2025-03-14 01:17:48,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:51,565 INFO L124 PetriNetUnfolderBase]: 8893/30356 cut-off events. [2025-03-14 01:17:51,566 INFO L125 PetriNetUnfolderBase]: For 3794/3794 co-relation queries the response was YES. [2025-03-14 01:17:51,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43430 conditions, 30356 events. 8893/30356 cut-off events. For 3794/3794 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 380021 event pairs, 6804 based on Foata normal form. 6319/31189 useless extension candidates. Maximal degree in co-relation 22385. Up to 11130 conditions per place. [2025-03-14 01:17:51,931 INFO L140 encePairwiseOnDemand]: 289/308 looper letters, 34 selfloop transitions, 5 changer transitions 0/283 dead transitions. [2025-03-14 01:17:51,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 672 flow [2025-03-14 01:17:51,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:17:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:17:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-03-14 01:17:51,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8403679653679653 [2025-03-14 01:17:51,935 INFO L175 Difference]: Start difference. First operand has 296 places, 308 transitions, 644 flow. Second operand 6 states and 1553 transitions. [2025-03-14 01:17:51,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 672 flow [2025-03-14 01:17:51,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 283 transitions, 666 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-14 01:17:51,941 INFO L231 Difference]: Finished difference. Result has 288 places, 283 transitions, 598 flow [2025-03-14 01:17:51,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=598, PETRI_PLACES=288, PETRI_TRANSITIONS=283} [2025-03-14 01:17:51,943 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -8 predicate places. [2025-03-14 01:17:51,943 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 283 transitions, 598 flow [2025-03-14 01:17:51,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.5) internal successors, (1509), 6 states have internal predecessors, (1509), 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 01:17:51,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:51,944 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:17:51,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:17:51,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:17:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:51,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1492154955, now seen corresponding path program 1 times [2025-03-14 01:17:51,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:51,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731987223] [2025-03-14 01:17:51,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:51,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:51,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:17:51,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:17:51,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:51,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:51,975 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 01:17:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731987223] [2025-03-14 01:17:51,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731987223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:51,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:51,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:17:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658307807] [2025-03-14 01:17:51,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:51,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:17:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:51,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:17:51,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:17:51,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 308 [2025-03-14 01:17:51,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 283 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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 01:17:51,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:51,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 308 [2025-03-14 01:17:51,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:52,341 INFO L124 PetriNetUnfolderBase]: 285/2847 cut-off events. [2025-03-14 01:17:52,341 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-14 01:17:52,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 2847 events. 285/2847 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 23884 event pairs, 204 based on Foata normal form. 1/2510 useless extension candidates. Maximal degree in co-relation 3248. Up to 330 conditions per place. [2025-03-14 01:17:52,374 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 16 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-14 01:17:52,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 284 transitions, 638 flow [2025-03-14 01:17:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:17:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:17:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2025-03-14 01:17:52,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069264069264069 [2025-03-14 01:17:52,377 INFO L175 Difference]: Start difference. First operand has 288 places, 283 transitions, 598 flow. Second operand 3 states and 838 transitions. [2025-03-14 01:17:52,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 284 transitions, 638 flow [2025-03-14 01:17:52,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 284 transitions, 626 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:17:52,380 INFO L231 Difference]: Finished difference. Result has 286 places, 284 transitions, 600 flow [2025-03-14 01:17:52,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=286, PETRI_TRANSITIONS=284} [2025-03-14 01:17:52,381 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, -10 predicate places. [2025-03-14 01:17:52,381 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 284 transitions, 600 flow [2025-03-14 01:17:52,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 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 01:17:52,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:52,382 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:17:52,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:17:52,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:17:52,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1207964642, now seen corresponding path program 1 times [2025-03-14 01:17:52,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:52,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082067011] [2025-03-14 01:17:52,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:52,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:52,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:17:52,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:17:52,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:52,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:52,508 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 01:17:52,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:52,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082067011] [2025-03-14 01:17:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082067011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:52,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705040749] [2025-03-14 01:17:52,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:52,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:52,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:52,511 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:17:52,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 01:17:52,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:17:52,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:17:52,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:52,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:52,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:17:52,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:52,615 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 01:17:52,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:52,641 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 01:17:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705040749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:52,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:17:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958930662] [2025-03-14 01:17:52,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:52,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:17:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:52,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:17:52,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:17:52,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 308 [2025-03-14 01:17:52,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 284 transitions, 600 flow. Second operand has 10 states, 10 states have (on average 272.2) internal successors, (2722), 10 states have internal predecessors, (2722), 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 01:17:52,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:52,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 308 [2025-03-14 01:17:52,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:53,005 INFO L124 PetriNetUnfolderBase]: 285/2862 cut-off events. [2025-03-14 01:17:53,005 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-14 01:17:53,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 2862 events. 285/2862 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 23829 event pairs, 204 based on Foata normal form. 2/2526 useless extension candidates. Maximal degree in co-relation 3283. Up to 330 conditions per place. [2025-03-14 01:17:53,041 INFO L140 encePairwiseOnDemand]: 302/308 looper letters, 20 selfloop transitions, 9 changer transitions 0/292 dead transitions. [2025-03-14 01:17:53,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 676 flow [2025-03-14 01:17:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:17:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:17:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2461 transitions. [2025-03-14 01:17:53,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8878066378066378 [2025-03-14 01:17:53,043 INFO L175 Difference]: Start difference. First operand has 286 places, 284 transitions, 600 flow. Second operand 9 states and 2461 transitions. [2025-03-14 01:17:53,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 676 flow [2025-03-14 01:17:53,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 292 transitions, 674 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:53,047 INFO L231 Difference]: Finished difference. Result has 296 places, 290 transitions, 648 flow [2025-03-14 01:17:53,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=648, PETRI_PLACES=296, PETRI_TRANSITIONS=290} [2025-03-14 01:17:53,048 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 0 predicate places. [2025-03-14 01:17:53,048 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 290 transitions, 648 flow [2025-03-14 01:17:53,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 272.2) internal successors, (2722), 10 states have internal predecessors, (2722), 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 01:17:53,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:53,049 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 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] [2025-03-14 01:17:53,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-14 01:17:53,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:53,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:17:53,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash 966936894, now seen corresponding path program 2 times [2025-03-14 01:17:53,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878540740] [2025-03-14 01:17:53,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:53,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:17:53,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:17:53,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:53,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:17:53,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878540740] [2025-03-14 01:17:53,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878540740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:17:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911663865] [2025-03-14 01:17:53,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:17:53,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:53,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:17:53,353 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:17:53,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 01:17:53,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:17:53,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:17:53,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:17:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:53,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:17:53,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:17:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:17:53,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:17:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:17:53,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911663865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:17:53,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:17:53,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-14 01:17:53,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781684976] [2025-03-14 01:17:53,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:17:53,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 01:17:53,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:53,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 01:17:53,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:17:53,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 308 [2025-03-14 01:17:53,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 290 transitions, 648 flow. Second operand has 15 states, 15 states have (on average 272.26666666666665) internal successors, (4084), 15 states have internal predecessors, (4084), 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 01:17:53,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:53,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 308 [2025-03-14 01:17:53,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:17:54,180 INFO L124 PetriNetUnfolderBase]: 285/2901 cut-off events. [2025-03-14 01:17:54,180 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-03-14 01:17:54,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3429 conditions, 2901 events. 285/2901 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 23926 event pairs, 204 based on Foata normal form. 3/2566 useless extension candidates. Maximal degree in co-relation 3245. Up to 330 conditions per place. [2025-03-14 01:17:54,204 INFO L140 encePairwiseOnDemand]: 302/308 looper letters, 23 selfloop transitions, 18 changer transitions 0/304 dead transitions. [2025-03-14 01:17:54,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 304 transitions, 804 flow [2025-03-14 01:17:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:17:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:17:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4904 transitions. [2025-03-14 01:17:54,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8845598845598845 [2025-03-14 01:17:54,207 INFO L175 Difference]: Start difference. First operand has 296 places, 290 transitions, 648 flow. Second operand 18 states and 4904 transitions. [2025-03-14 01:17:54,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 304 transitions, 804 flow [2025-03-14 01:17:54,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 304 transitions, 792 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:17:54,210 INFO L231 Difference]: Finished difference. Result has 316 places, 300 transitions, 748 flow [2025-03-14 01:17:54,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=748, PETRI_PLACES=316, PETRI_TRANSITIONS=300} [2025-03-14 01:17:54,211 INFO L279 CegarLoopForPetriNet]: 296 programPoint places, 20 predicate places. [2025-03-14 01:17:54,211 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 300 transitions, 748 flow [2025-03-14 01:17:54,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 272.26666666666665) internal successors, (4084), 15 states have internal predecessors, (4084), 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 01:17:54,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:54,212 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:17:54,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-14 01:17:54,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:17:54,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:17:54,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1391436053, now seen corresponding path program 3 times [2025-03-14 01:17:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:54,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032702530] [2025-03-14 01:17:54,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:17:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:54,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-03-14 01:17:54,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:17:54,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 01:17:54,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:54,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:17:54,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-14 01:17:54,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-14 01:17:54,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:54,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:17:54,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:17:54,480 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-14 01:17:54,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-14 01:17:54,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-14 01:17:54,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-14 01:17:54,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-14 01:17:54,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-14 01:17:54,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-14 01:17:54,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-14 01:17:54,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:17:54,481 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-14 01:17:54,481 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:17:54,481 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-14 01:17:54,515 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:17:54,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 372 transitions, 784 flow [2025-03-14 01:17:54,552 INFO L124 PetriNetUnfolderBase]: 26/415 cut-off events. [2025-03-14 01:17:54,552 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-14 01:17:54,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 415 events. 26/415 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1492 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 355. Up to 6 conditions per place. [2025-03-14 01:17:54,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 372 transitions, 784 flow [2025-03-14 01:17:54,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 372 transitions, 784 flow [2025-03-14 01:17:54,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:17:54,559 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=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;@5f8c837d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:17:54,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-14 01:17:54,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:17:54,561 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-14 01:17:54,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:17:54,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:17:54,561 INFO L206 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] [2025-03-14 01:17:54,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:17:54,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:17:54,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1927986983, now seen corresponding path program 1 times [2025-03-14 01:17:54,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:17:54,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928489499] [2025-03-14 01:17:54,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:17:54,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:17:54,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:17:54,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:17:54,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:17:54,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:17:54,676 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 01:17:54,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:17:54,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928489499] [2025-03-14 01:17:54,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928489499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:17:54,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:17:54,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:17:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154830416] [2025-03-14 01:17:54,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:17:54,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:17:54,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:17:54,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:17:54,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:17:54,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 372 [2025-03-14 01:17:54,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 372 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 304.5) internal successors, (1827), 6 states have internal predecessors, (1827), 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 01:17:54,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:17:54,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 372 [2025-03-14 01:17:54,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:18:23,750 INFO L124 PetriNetUnfolderBase]: 81869/231410 cut-off events. [2025-03-14 01:18:23,751 INFO L125 PetriNetUnfolderBase]: For 40121/40121 co-relation queries the response was YES. [2025-03-14 01:18:26,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345291 conditions, 231410 events. 81869/231410 cut-off events. For 40121/40121 co-relation queries the response was YES. Maximal size of possible extension queue 6614. Compared 3527804 event pairs, 64428 based on Foata normal form. 52388/244848 useless extension candidates. Maximal degree in co-relation 43774. Up to 97530 conditions per place. [2025-03-14 01:18:27,861 INFO L140 encePairwiseOnDemand]: 350/372 looper letters, 41 selfloop transitions, 5 changer transitions 0/342 dead transitions. [2025-03-14 01:18:27,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 342 transitions, 816 flow [2025-03-14 01:18:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:18:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:18:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1881 transitions. [2025-03-14 01:18:27,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.842741935483871 [2025-03-14 01:18:27,867 INFO L175 Difference]: Start difference. First operand has 357 places, 372 transitions, 784 flow. Second operand 6 states and 1881 transitions. [2025-03-14 01:18:27,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 342 transitions, 816 flow [2025-03-14 01:18:27,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 342 transitions, 804 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-14 01:18:27,883 INFO L231 Difference]: Finished difference. Result has 347 places, 342 transitions, 722 flow [2025-03-14 01:18:27,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=722, PETRI_PLACES=347, PETRI_TRANSITIONS=342} [2025-03-14 01:18:27,884 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, -10 predicate places. [2025-03-14 01:18:27,884 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 342 transitions, 722 flow [2025-03-14 01:18:27,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.5) internal successors, (1827), 6 states have internal predecessors, (1827), 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 01:18:27,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:27,885 INFO L206 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] [2025-03-14 01:18:27,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:18:27,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-14 01:18:27,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash 368515997, now seen corresponding path program 1 times [2025-03-14 01:18:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:27,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642573376] [2025-03-14 01:18:27,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:27,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:18:27,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:18:27,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:27,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:18:27,928 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 01:18:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:18:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642573376] [2025-03-14 01:18:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642573376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:18:27,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:18:27,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:18:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875524533] [2025-03-14 01:18:27,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:18:27,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:18:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:18:27,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:18:27,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:18:27,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 372 [2025-03-14 01:18:27,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 342 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 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 01:18:27,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:18:27,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 372 [2025-03-14 01:18:27,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand