./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/qw2004-2.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-lit/qw2004-2.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 a0f042164bf78d3595348b117153fa7346585efa21c060e488a9879023a64e1b --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:29:48,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:29:48,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:29:48,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:29:48,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:29:48,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:29:48,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:29:48,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:29:48,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:29:48,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:29:48,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:29:48,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:29:48,719 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:29:48,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:29:48,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:29:48,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:29:48,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:29:48,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:29:48,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:29:48,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:29:48,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:29:48,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:29:48,720 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:29:48,721 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:29:48,721 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:29:48,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:29:48,721 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:29:48,721 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:29:48,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:29:48,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:29:48,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:29:48,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:29:48,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:29:48,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:29:48,722 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:29:48,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:29:48,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:29:48,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:29:48,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:29:48,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:29:48,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:29:48,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:29:48,722 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 -> a0f042164bf78d3595348b117153fa7346585efa21c060e488a9879023a64e1b [2025-03-14 01:29:48,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:29:48,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:29:48,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:29:48,975 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:29:48,975 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:29:48,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004-2.i [2025-03-14 01:29:50,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15c0fbfd/b76ac68f78af4178bd8c55f8c27d1c9f/FLAGc0b192815 [2025-03-14 01:29:50,462 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:29:50,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2.i [2025-03-14 01:29:50,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15c0fbfd/b76ac68f78af4178bd8c55f8c27d1c9f/FLAGc0b192815 [2025-03-14 01:29:50,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15c0fbfd/b76ac68f78af4178bd8c55f8c27d1c9f [2025-03-14 01:29:50,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:29:50,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:29:50,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:29:50,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:29:50,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:29:50,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5994ae07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50, skipping insertion in model container [2025-03-14 01:29:50,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:29:50,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:29:50,752 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:29:50,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:29:50,842 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:29:50,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50 WrapperNode [2025-03-14 01:29:50,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:29:50,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:29:50,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:29:50,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:29:50,852 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:29:50" (1/1) ... [2025-03-14 01:29:50,866 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:29:50" (1/1) ... [2025-03-14 01:29:50,886 INFO L138 Inliner]: procedures = 174, calls = 29, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 170 [2025-03-14 01:29:50,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:29:50,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:29:50,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:29:50,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:29:50,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:29:50,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:29:50,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:29:50,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:29:50,916 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (1/1) ... [2025-03-14 01:29:50,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:29:50,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:29:50,947 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:29:50,952 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:29:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-03-14 01:29:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-03-14 01:29:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:29:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:29:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:29:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:29:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:29:50,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:29:50,973 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:29:51,059 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:29:51,061 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:29:51,303 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:29:51,304 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:29:51,305 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:29:51,369 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:29:51,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:29:51 BoogieIcfgContainer [2025-03-14 01:29:51,370 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:29:51,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:29:51,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:29:51,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:29:51,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:29:50" (1/3) ... [2025-03-14 01:29:51,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7606ea11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:29:51, skipping insertion in model container [2025-03-14 01:29:51,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:29:50" (2/3) ... [2025-03-14 01:29:51,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7606ea11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:29:51, skipping insertion in model container [2025-03-14 01:29:51,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:29:51" (3/3) ... [2025-03-14 01:29:51,378 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004-2.i [2025-03-14 01:29:51,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:29:51,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004-2.i that has 2 procedures, 147 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-03-14 01:29:51,393 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:29:51,450 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:29:51,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 153 transitions, 310 flow [2025-03-14 01:29:51,538 INFO L124 PetriNetUnfolderBase]: 7/152 cut-off events. [2025-03-14 01:29:51,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:51,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 152 events. 7/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 227 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2025-03-14 01:29:51,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 153 transitions, 310 flow [2025-03-14 01:29:51,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 152 transitions, 307 flow [2025-03-14 01:29:51,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:29:51,573 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;@5671fae1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:29:51,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-14 01:29:51,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:29:51,579 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-03-14 01:29:51,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:51,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:51,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:29:51,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:51,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash 587542606, now seen corresponding path program 1 times [2025-03-14 01:29:51,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:51,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473918604] [2025-03-14 01:29:51,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:51,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:29:51,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:29:51,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:51,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:51,736 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:29:51,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473918604] [2025-03-14 01:29:51,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473918604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:51,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:51,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:51,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372619201] [2025-03-14 01:29:51,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:51,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:51,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:51,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:51,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2025-03-14 01:29:51,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 152 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:29:51,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:51,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2025-03-14 01:29:51,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:51,922 INFO L124 PetriNetUnfolderBase]: 37/402 cut-off events. [2025-03-14 01:29:51,922 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:29:51,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 402 events. 37/402 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1671 event pairs, 17 based on Foata normal form. 15/369 useless extension candidates. Maximal degree in co-relation 421. Up to 64 conditions per place. [2025-03-14 01:29:51,930 INFO L140 encePairwiseOnDemand]: 134/153 looper letters, 14 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2025-03-14 01:29:51,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 133 transitions, 301 flow [2025-03-14 01:29:51,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2025-03-14 01:29:51,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8496732026143791 [2025-03-14 01:29:51,948 INFO L175 Difference]: Start difference. First operand has 149 places, 152 transitions, 307 flow. Second operand 3 states and 390 transitions. [2025-03-14 01:29:51,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 133 transitions, 301 flow [2025-03-14 01:29:51,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 133 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:29:51,956 INFO L231 Difference]: Finished difference. Result has 134 places, 133 transitions, 272 flow [2025-03-14 01:29:51,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=134, PETRI_TRANSITIONS=133} [2025-03-14 01:29:51,963 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -15 predicate places. [2025-03-14 01:29:51,963 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 133 transitions, 272 flow [2025-03-14 01:29:51,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:29:51,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:51,963 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] [2025-03-14 01:29:51,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:29:51,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:51,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:51,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2004547305, now seen corresponding path program 1 times [2025-03-14 01:29:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190222912] [2025-03-14 01:29:51,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:51,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:29:51,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:29:51,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:51,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:52,021 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:29:52,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:52,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190222912] [2025-03-14 01:29:52,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190222912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:52,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:52,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340525685] [2025-03-14 01:29:52,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:52,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:52,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:52,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:52,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:52,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2025-03-14 01:29:52,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 133 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:29:52,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:52,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2025-03-14 01:29:52,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:52,096 INFO L124 PetriNetUnfolderBase]: 37/401 cut-off events. [2025-03-14 01:29:52,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:52,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 401 events. 37/401 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1672 event pairs, 17 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 449. Up to 64 conditions per place. [2025-03-14 01:29:52,102 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 14 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-03-14 01:29:52,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 302 flow [2025-03-14 01:29:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-03-14 01:29:52,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2025-03-14 01:29:52,106 INFO L175 Difference]: Start difference. First operand has 134 places, 133 transitions, 272 flow. Second operand 3 states and 374 transitions. [2025-03-14 01:29:52,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 302 flow [2025-03-14 01:29:52,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:52,109 INFO L231 Difference]: Finished difference. Result has 133 places, 132 transitions, 270 flow [2025-03-14 01:29:52,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=133, PETRI_TRANSITIONS=132} [2025-03-14 01:29:52,110 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -16 predicate places. [2025-03-14 01:29:52,111 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 270 flow [2025-03-14 01:29:52,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:29:52,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:52,111 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] [2025-03-14 01:29:52,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:29:52,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:52,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:52,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1854051665, now seen corresponding path program 1 times [2025-03-14 01:29:52,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:52,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624327157] [2025-03-14 01:29:52,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:52,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:29:52,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:29:52,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:52,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:52,165 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:29:52,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624327157] [2025-03-14 01:29:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624327157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:52,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:52,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:52,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721510924] [2025-03-14 01:29:52,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:52,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:52,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:52,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:52,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2025-03-14 01:29:52,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:29:52,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:52,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2025-03-14 01:29:52,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:52,241 INFO L124 PetriNetUnfolderBase]: 37/400 cut-off events. [2025-03-14 01:29:52,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:52,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 400 events. 37/400 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1673 event pairs, 17 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 443. Up to 64 conditions per place. [2025-03-14 01:29:52,245 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 14 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2025-03-14 01:29:52,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 131 transitions, 300 flow [2025-03-14 01:29:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-03-14 01:29:52,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2025-03-14 01:29:52,247 INFO L175 Difference]: Start difference. First operand has 133 places, 132 transitions, 270 flow. Second operand 3 states and 374 transitions. [2025-03-14 01:29:52,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 131 transitions, 300 flow [2025-03-14 01:29:52,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:52,249 INFO L231 Difference]: Finished difference. Result has 132 places, 131 transitions, 268 flow [2025-03-14 01:29:52,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=132, PETRI_TRANSITIONS=131} [2025-03-14 01:29:52,250 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -17 predicate places. [2025-03-14 01:29:52,250 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 131 transitions, 268 flow [2025-03-14 01:29:52,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:29:52,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:52,251 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] [2025-03-14 01:29:52,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:29:52,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:52,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -200708958, now seen corresponding path program 1 times [2025-03-14 01:29:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:52,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73568800] [2025-03-14 01:29:52,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:52,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:29:52,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:29:52,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:52,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:52,301 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:29:52,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:52,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73568800] [2025-03-14 01:29:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73568800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:52,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631921428] [2025-03-14 01:29:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:52,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:52,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:52,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:52,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2025-03-14 01:29:52,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 131 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:29:52,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:52,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2025-03-14 01:29:52,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:52,408 INFO L124 PetriNetUnfolderBase]: 52/426 cut-off events. [2025-03-14 01:29:52,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:52,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 426 events. 52/426 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1886 event pairs, 27 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 494. Up to 94 conditions per place. [2025-03-14 01:29:52,411 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 16 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2025-03-14 01:29:52,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 130 transitions, 302 flow [2025-03-14 01:29:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-03-14 01:29:52,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8061002178649237 [2025-03-14 01:29:52,413 INFO L175 Difference]: Start difference. First operand has 132 places, 131 transitions, 268 flow. Second operand 3 states and 370 transitions. [2025-03-14 01:29:52,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 130 transitions, 302 flow [2025-03-14 01:29:52,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 130 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:52,415 INFO L231 Difference]: Finished difference. Result has 131 places, 130 transitions, 266 flow [2025-03-14 01:29:52,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=131, PETRI_TRANSITIONS=130} [2025-03-14 01:29:52,416 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -18 predicate places. [2025-03-14 01:29:52,416 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 130 transitions, 266 flow [2025-03-14 01:29:52,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:29:52,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:52,417 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, 1] [2025-03-14 01:29:52,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:29:52,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:52,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:52,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2011787243, now seen corresponding path program 1 times [2025-03-14 01:29:52,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:52,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567050470] [2025-03-14 01:29:52,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:52,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:29:52,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:29:52,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:52,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:52,553 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:29:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567050470] [2025-03-14 01:29:52,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567050470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:52,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:52,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:29:52,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823619449] [2025-03-14 01:29:52,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:52,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:29:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:52,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:29:52,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:29:52,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 153 [2025-03-14 01:29:52,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 130 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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:29:52,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:52,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 153 [2025-03-14 01:29:52,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:52,679 INFO L124 PetriNetUnfolderBase]: 55/439 cut-off events. [2025-03-14 01:29:52,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:29:52,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 439 events. 55/439 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2069 event pairs, 13 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 503. Up to 53 conditions per place. [2025-03-14 01:29:52,683 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 23 selfloop transitions, 7 changer transitions 0/144 dead transitions. [2025-03-14 01:29:52,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 144 transitions, 354 flow [2025-03-14 01:29:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:29:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:29:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2025-03-14 01:29:52,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8261437908496732 [2025-03-14 01:29:52,686 INFO L175 Difference]: Start difference. First operand has 131 places, 130 transitions, 266 flow. Second operand 5 states and 632 transitions. [2025-03-14 01:29:52,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 144 transitions, 354 flow [2025-03-14 01:29:52,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 144 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:52,690 INFO L231 Difference]: Finished difference. Result has 137 places, 135 transitions, 310 flow [2025-03-14 01:29:52,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=137, PETRI_TRANSITIONS=135} [2025-03-14 01:29:52,691 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -12 predicate places. [2025-03-14 01:29:52,691 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 310 flow [2025-03-14 01:29:52,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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:29:52,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:52,692 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, 1, 1, 1] [2025-03-14 01:29:52,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:29:52,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:52,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2082853677, now seen corresponding path program 1 times [2025-03-14 01:29:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791862217] [2025-03-14 01:29:52,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:52,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:52,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-14 01:29:52,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-14 01:29:52,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:52,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:52,725 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:29:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791862217] [2025-03-14 01:29:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791862217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104046454] [2025-03-14 01:29:52,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:52,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:52,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:52,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:52,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 153 [2025-03-14 01:29:52,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 135 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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:29:52,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:52,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 153 [2025-03-14 01:29:52,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:52,860 INFO L124 PetriNetUnfolderBase]: 63/604 cut-off events. [2025-03-14 01:29:52,862 INFO L125 PetriNetUnfolderBase]: For 40/43 co-relation queries the response was YES. [2025-03-14 01:29:52,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 604 events. 63/604 cut-off events. For 40/43 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3235 event pairs, 17 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 724. Up to 76 conditions per place. [2025-03-14 01:29:52,866 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 22 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-03-14 01:29:52,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 380 flow [2025-03-14 01:29:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-03-14 01:29:52,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8431372549019608 [2025-03-14 01:29:52,868 INFO L175 Difference]: Start difference. First operand has 137 places, 135 transitions, 310 flow. Second operand 3 states and 387 transitions. [2025-03-14 01:29:52,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 143 transitions, 380 flow [2025-03-14 01:29:52,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 143 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:29:52,872 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 332 flow [2025-03-14 01:29:52,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-03-14 01:29:52,873 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -8 predicate places. [2025-03-14 01:29:52,874 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 332 flow [2025-03-14 01:29:52,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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:29:52,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:52,874 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:29:52,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:29:52,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:52,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash 190929595, now seen corresponding path program 1 times [2025-03-14 01:29:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:52,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523043617] [2025-03-14 01:29:52,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:52,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:52,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-14 01:29:52,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-14 01:29:52,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:52,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:52,993 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:29:52,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:52,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523043617] [2025-03-14 01:29:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523043617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:52,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:52,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:29:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705805237] [2025-03-14 01:29:52,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:52,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:29:52,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:52,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:29:52,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:29:53,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2025-03-14 01:29:53,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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:29:53,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:53,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2025-03-14 01:29:53,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:53,201 INFO L124 PetriNetUnfolderBase]: 166/881 cut-off events. [2025-03-14 01:29:53,202 INFO L125 PetriNetUnfolderBase]: For 61/64 co-relation queries the response was YES. [2025-03-14 01:29:53,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 881 events. 166/881 cut-off events. For 61/64 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5838 event pairs, 6 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 1239. Up to 167 conditions per place. [2025-03-14 01:29:53,207 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 25 selfloop transitions, 3 changer transitions 30/174 dead transitions. [2025-03-14 01:29:53,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 174 transitions, 536 flow [2025-03-14 01:29:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:29:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:29:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1228 transitions. [2025-03-14 01:29:53,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8026143790849674 [2025-03-14 01:29:53,211 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 332 flow. Second operand 10 states and 1228 transitions. [2025-03-14 01:29:53,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 174 transitions, 536 flow [2025-03-14 01:29:53,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 174 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:29:53,233 INFO L231 Difference]: Finished difference. Result has 155 places, 138 transitions, 361 flow [2025-03-14 01:29:53,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=155, PETRI_TRANSITIONS=138} [2025-03-14 01:29:53,234 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, 6 predicate places. [2025-03-14 01:29:53,234 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 138 transitions, 361 flow [2025-03-14 01:29:53,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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:29:53,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:53,234 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:29:53,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:29:53,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:53,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash 675354624, now seen corresponding path program 1 times [2025-03-14 01:29:53,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:53,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161139265] [2025-03-14 01:29:53,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:53,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-14 01:29:53,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-14 01:29:53,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:53,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:53,275 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:29:53,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:53,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161139265] [2025-03-14 01:29:53,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161139265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:53,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:53,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:29:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095458402] [2025-03-14 01:29:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:53,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:29:53,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:53,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:29:53,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:29:53,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2025-03-14 01:29:53,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 138 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:29:53,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:53,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2025-03-14 01:29:53,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:53,386 INFO L124 PetriNetUnfolderBase]: 105/797 cut-off events. [2025-03-14 01:29:53,387 INFO L125 PetriNetUnfolderBase]: For 312/319 co-relation queries the response was YES. [2025-03-14 01:29:53,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 797 events. 105/797 cut-off events. For 312/319 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4781 event pairs, 33 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 1220. Up to 159 conditions per place. [2025-03-14 01:29:53,391 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 20 selfloop transitions, 4 changer transitions 7/146 dead transitions. [2025-03-14 01:29:53,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 146 transitions, 449 flow [2025-03-14 01:29:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:29:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:29:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2025-03-14 01:29:53,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8344226579520697 [2025-03-14 01:29:53,394 INFO L175 Difference]: Start difference. First operand has 155 places, 138 transitions, 361 flow. Second operand 3 states and 383 transitions. [2025-03-14 01:29:53,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 146 transitions, 449 flow [2025-03-14 01:29:53,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 440 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-14 01:29:53,401 INFO L231 Difference]: Finished difference. Result has 147 places, 136 transitions, 366 flow [2025-03-14 01:29:53,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=147, PETRI_TRANSITIONS=136} [2025-03-14 01:29:53,402 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, -2 predicate places. [2025-03-14 01:29:53,402 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 136 transitions, 366 flow [2025-03-14 01:29:53,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:29:53,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:53,404 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, 1, 1, 1, 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:29:53,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:29:53,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:53,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1009020480, now seen corresponding path program 1 times [2025-03-14 01:29:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:53,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356585064] [2025-03-14 01:29:53,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:53,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:53,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-14 01:29:53,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:29:53,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:53,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:53,510 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:29:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356585064] [2025-03-14 01:29:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356585064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:53,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:53,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:29:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056904932] [2025-03-14 01:29:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:53,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:29:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:53,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:29:53,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:29:53,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 153 [2025-03-14 01:29:53,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 136 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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:29:53,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:53,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 153 [2025-03-14 01:29:53,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:53,683 INFO L124 PetriNetUnfolderBase]: 101/979 cut-off events. [2025-03-14 01:29:53,683 INFO L125 PetriNetUnfolderBase]: For 341/353 co-relation queries the response was YES. [2025-03-14 01:29:53,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 979 events. 101/979 cut-off events. For 341/353 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6372 event pairs, 62 based on Foata normal form. 4/930 useless extension candidates. Maximal degree in co-relation 1467. Up to 173 conditions per place. [2025-03-14 01:29:53,687 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 21 selfloop transitions, 0 changer transitions 20/154 dead transitions. [2025-03-14 01:29:53,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 154 transitions, 506 flow [2025-03-14 01:29:53,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:29:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:29:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2025-03-14 01:29:53,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8006535947712419 [2025-03-14 01:29:53,689 INFO L175 Difference]: Start difference. First operand has 147 places, 136 transitions, 366 flow. Second operand 6 states and 735 transitions. [2025-03-14 01:29:53,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 154 transitions, 506 flow [2025-03-14 01:29:53,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 154 transitions, 492 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:29:53,695 INFO L231 Difference]: Finished difference. Result has 153 places, 134 transitions, 360 flow [2025-03-14 01:29:53,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=153, PETRI_TRANSITIONS=134} [2025-03-14 01:29:53,696 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, 4 predicate places. [2025-03-14 01:29:53,696 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 134 transitions, 360 flow [2025-03-14 01:29:53,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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:29:53,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:53,697 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, 1, 1, 1, 1, 1, 1, 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:29:53,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:29:53,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:53,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2128171456, now seen corresponding path program 1 times [2025-03-14 01:29:53,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:53,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920827830] [2025-03-14 01:29:53,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:53,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:53,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-14 01:29:53,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-14 01:29:53,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:53,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:53,904 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:29:53,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:53,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920827830] [2025-03-14 01:29:53,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920827830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:53,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:53,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:29:53,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315534266] [2025-03-14 01:29:53,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:53,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:29:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:53,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:29:53,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:29:53,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 153 [2025-03-14 01:29:53,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 134 transitions, 360 flow. Second operand has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 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:29:53,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:53,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 153 [2025-03-14 01:29:53,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:54,462 INFO L124 PetriNetUnfolderBase]: 252/2308 cut-off events. [2025-03-14 01:29:54,462 INFO L125 PetriNetUnfolderBase]: For 366/375 co-relation queries the response was YES. [2025-03-14 01:29:54,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3400 conditions, 2308 events. 252/2308 cut-off events. For 366/375 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 20761 event pairs, 73 based on Foata normal form. 0/2203 useless extension candidates. Maximal degree in co-relation 3383. Up to 272 conditions per place. [2025-03-14 01:29:54,474 INFO L140 encePairwiseOnDemand]: 139/153 looper letters, 61 selfloop transitions, 7 changer transitions 75/247 dead transitions. [2025-03-14 01:29:54,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 247 transitions, 945 flow [2025-03-14 01:29:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 01:29:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 01:29:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2866 transitions. [2025-03-14 01:29:54,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.749281045751634 [2025-03-14 01:29:54,482 INFO L175 Difference]: Start difference. First operand has 153 places, 134 transitions, 360 flow. Second operand 25 states and 2866 transitions. [2025-03-14 01:29:54,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 247 transitions, 945 flow [2025-03-14 01:29:54,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 247 transitions, 935 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:29:54,489 INFO L231 Difference]: Finished difference. Result has 191 places, 137 transitions, 443 flow [2025-03-14 01:29:54,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=443, PETRI_PLACES=191, PETRI_TRANSITIONS=137} [2025-03-14 01:29:54,490 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, 42 predicate places. [2025-03-14 01:29:54,490 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 137 transitions, 443 flow [2025-03-14 01:29:54,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 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:29:54,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:54,491 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, 1, 1, 1, 1, 1, 1, 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:29:54,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:29:54,492 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:54,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash -989291902, now seen corresponding path program 2 times [2025-03-14 01:29:54,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:54,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600562587] [2025-03-14 01:29:54,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:29:54,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:54,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 1 equivalence classes. [2025-03-14 01:29:54,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-14 01:29:54,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:29:54,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:29:54,576 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:29:54,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:29:54,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600562587] [2025-03-14 01:29:54,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600562587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:29:54,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:29:54,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:29:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582938033] [2025-03-14 01:29:54,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:29:54,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:29:54,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:29:54,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:29:54,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:29:54,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 153 [2025-03-14 01:29:54,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 137 transitions, 443 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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:29:54,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:29:54,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 153 [2025-03-14 01:29:54,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:29:54,678 INFO L124 PetriNetUnfolderBase]: 60/838 cut-off events. [2025-03-14 01:29:54,678 INFO L125 PetriNetUnfolderBase]: For 904/925 co-relation queries the response was YES. [2025-03-14 01:29:54,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 838 events. 60/838 cut-off events. For 904/925 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5110 event pairs, 29 based on Foata normal form. 9/800 useless extension candidates. Maximal degree in co-relation 1486. Up to 96 conditions per place. [2025-03-14 01:29:54,682 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 20 selfloop transitions, 1 changer transitions 7/142 dead transitions. [2025-03-14 01:29:54,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 142 transitions, 515 flow [2025-03-14 01:29:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:29:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:29:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2025-03-14 01:29:54,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8284313725490197 [2025-03-14 01:29:54,684 INFO L175 Difference]: Start difference. First operand has 191 places, 137 transitions, 443 flow. Second operand 4 states and 507 transitions. [2025-03-14 01:29:54,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 142 transitions, 515 flow [2025-03-14 01:29:54,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 142 transitions, 484 flow, removed 11 selfloop flow, removed 12 redundant places. [2025-03-14 01:29:54,688 INFO L231 Difference]: Finished difference. Result has 164 places, 133 transitions, 394 flow [2025-03-14 01:29:54,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=394, PETRI_PLACES=164, PETRI_TRANSITIONS=133} [2025-03-14 01:29:54,689 INFO L279 CegarLoopForPetriNet]: 149 programPoint places, 15 predicate places. [2025-03-14 01:29:54,689 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 133 transitions, 394 flow [2025-03-14 01:29:54,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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:29:54,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:29:54,690 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, 1, 1, 1, 1, 1, 1, 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:29:54,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:29:54,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:29:54,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:29:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1768038901, now seen corresponding path program 1 times [2025-03-14 01:29:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:29:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436856342] [2025-03-14 01:29:54,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:29:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:29:54,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-14 01:29:54,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-14 01:29:54,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:54,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:29:54,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:29:54,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-14 01:29:54,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-14 01:29:54,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:29:54,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:29:54,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:29:54,736 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:29:54,737 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-14 01:29:54,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-14 01:29:54,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-14 01:29:54,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-14 01:29:54,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-14 01:29:54,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:29:54,739 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:29:54,788 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:29:54,788 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:29:54,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:29:54 BasicIcfg [2025-03-14 01:29:54,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:29:54,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:29:54,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:29:54,795 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:29:54,795 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:29:51" (3/4) ... [2025-03-14 01:29:54,796 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 01:29:54,849 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 14. [2025-03-14 01:29:54,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:29:54,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:29:54,883 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:29:54,884 INFO L158 Benchmark]: Toolchain (without parser) took 4395.61ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 111.6MB in the beginning and 229.2MB in the end (delta: -117.7MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2025-03-14 01:29:54,884 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:29:54,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.07ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 91.4MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:29:54,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.55ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:29:54,884 INFO L158 Benchmark]: Boogie Preprocessor took 22.58ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 89.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:29:54,884 INFO L158 Benchmark]: IcfgBuilder took 458.26ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 64.9MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 01:29:54,888 INFO L158 Benchmark]: TraceAbstraction took 3422.45ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 63.9MB in the beginning and 241.2MB in the end (delta: -177.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-14 01:29:54,888 INFO L158 Benchmark]: Witness Printer took 88.38ms. Allocated memory is still 335.5MB. Free memory was 241.2MB in the beginning and 229.2MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:29:54,891 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.07ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 91.4MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.55ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.58ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 89.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 458.26ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 64.9MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3422.45ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 63.9MB in the beginning and 241.2MB in the end (delta: -177.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Witness Printer took 88.38ms. Allocated memory is still 335.5MB. Free memory was 241.2MB in the beginning and 229.2MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 751]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int stoppingFlag; VAL [stoppingFlag=0] [L698] 0 volatile int pendingIo; VAL [pendingIo=0, stoppingFlag=0] [L699] 0 volatile int stoppingEvent; VAL [pendingIo=0, stoppingEvent=0, stoppingFlag=0] [L700] 0 volatile int stopped; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L755] 0 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L756] 0 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L757] 0 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L758] 0 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L759] 0 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L760] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L761] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L744] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L746] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L726] CALL, EXPR 1 dec() [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L722] 1 return tmp; VAL [\result=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L727] COND TRUE 1 pending == 0 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L729] 1 stoppingEvent = 1 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L746] RET 1 BCSP_IoDecrement() [L748] 1 int lse = stoppingEvent; VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L750] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) VAL [\old(cond)=1, cond=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L750] RET 1 assume_abort_if_not(lse) [L751] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L709] 0 int lp = pendingIo; VAL [lp=0, lsf=0, pendingIo=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L712] 0 pendingIo = lp + 1 VAL [lp=0, lsf=0, pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] [L715] 0 return 0; VAL [\result=0, lsf=0, pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L736] COND TRUE 0 status == 0 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L737] 0 !stopped VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L751] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] Now there is a data race on ~stopped~0 between C: !stopped [737] and C: stopped = 1 [751] - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 187 locations, 27 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 563 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 863 IncrementalHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 73 mSDtfsCounter, 863 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=10, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-14 01:29:54,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)