./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/ldv-races/race-3_2-container_of-global.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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:59:35,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:59:35,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:59:35,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:59:35,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:59:35,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:59:35,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:59:35,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:59:35,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:59:35,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:59:35,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:59:35,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:59:35,347 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:59:35,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:59:35,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:59:35,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:59:35,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:59:35,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:59:35,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:59:35,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:59:35,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:59:35,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:35,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:59:35,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:59:35,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:59:35,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:59:35,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:59:35,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:59:35,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:59:35,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:59:35,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:59:35,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:59:35,350 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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2025-03-17 10:59:35,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:59:35,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:59:35,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:59:35,596 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:59:35,596 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:59:35,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-03-17 10:59:36,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770342fc1/8aaebc74272b4e8d9a0446797ab21fd1/FLAGe1be22fe1 [2025-03-17 10:59:37,177 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:59:37,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-03-17 10:59:37,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770342fc1/8aaebc74272b4e8d9a0446797ab21fd1/FLAGe1be22fe1 [2025-03-17 10:59:37,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/770342fc1/8aaebc74272b4e8d9a0446797ab21fd1 [2025-03-17 10:59:37,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:59:37,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:59:37,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:37,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:59:37,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:59:37,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486eb593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37, skipping insertion in model container [2025-03-17 10:59:37,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:59:37,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:37,596 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:59:37,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:37,686 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:59:37,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37 WrapperNode [2025-03-17 10:59:37,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:37,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:37,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:59:37,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:59:37,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,745 INFO L138 Inliner]: procedures = 246, calls = 44, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 219 [2025-03-17 10:59:37,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:37,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:59:37,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:59:37,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:59:37,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:59:37,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:59:37,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:59:37,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:59:37,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (1/1) ... [2025-03-17 10:59:37,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:37,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:59:37,845 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-17 10:59:37,850 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-17 10:59:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-17 10:59:37,870 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-17 10:59:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 10:59:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:59:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:59:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 10:59:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:59:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:59:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:59:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 10:59:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:59:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:59:37,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:59:37,872 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:59:38,087 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:59:38,089 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:59:38,453 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:59:38,453 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:59:38,504 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:59:38,507 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:59:38,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:38 BoogieIcfgContainer [2025-03-17 10:59:38,508 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:59:38,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:59:38,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:59:38,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:59:38,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:59:37" (1/3) ... [2025-03-17 10:59:38,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a70b399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:38, skipping insertion in model container [2025-03-17 10:59:38,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:37" (2/3) ... [2025-03-17 10:59:38,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a70b399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:38, skipping insertion in model container [2025-03-17 10:59:38,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:38" (3/3) ... [2025-03-17 10:59:38,517 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2025-03-17 10:59:38,529 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:59:38,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 271 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-03-17 10:59:38,530 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:59:38,624 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 10:59:38,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 296 places, 304 transitions, 622 flow [2025-03-17 10:59:38,769 INFO L124 PetriNetUnfolderBase]: 18/387 cut-off events. [2025-03-17 10:59:38,771 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:59:38,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 387 events. 18/387 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 693 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 224. Up to 4 conditions per place. [2025-03-17 10:59:38,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 304 transitions, 622 flow [2025-03-17 10:59:38,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 301 transitions, 614 flow [2025-03-17 10:59:38,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:59:38,800 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;@68d900cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:59:38,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-17 10:59:38,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:59:38,809 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-17 10:59:38,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:38,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:38,810 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-17 10:59:38,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash -222525202, now seen corresponding path program 1 times [2025-03-17 10:59:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:38,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123478248] [2025-03-17 10:59:38,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:38,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:38,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:59:39,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:59:39,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:39,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:39,617 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-17 10:59:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123478248] [2025-03-17 10:59:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123478248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:39,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:39,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505553243] [2025-03-17 10:59:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:39,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:39,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:39,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:39,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:40,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 304 [2025-03-17 10:59:40,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 301 transitions, 614 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 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-17 10:59:40,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:40,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 304 [2025-03-17 10:59:40,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:40,385 INFO L124 PetriNetUnfolderBase]: 424/1667 cut-off events. [2025-03-17 10:59:40,385 INFO L125 PetriNetUnfolderBase]: For 20/30 co-relation queries the response was YES. [2025-03-17 10:59:40,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 1667 events. 424/1667 cut-off events. For 20/30 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 10730 event pairs, 423 based on Foata normal form. 60/1586 useless extension candidates. Maximal degree in co-relation 2154. Up to 755 conditions per place. [2025-03-17 10:59:40,399 INFO L140 encePairwiseOnDemand]: 280/304 looper letters, 44 selfloop transitions, 5 changer transitions 12/264 dead transitions. [2025-03-17 10:59:40,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 264 transitions, 638 flow [2025-03-17 10:59:40,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1448 transitions. [2025-03-17 10:59:40,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.793859649122807 [2025-03-17 10:59:40,417 INFO L175 Difference]: Start difference. First operand has 294 places, 301 transitions, 614 flow. Second operand 6 states and 1448 transitions. [2025-03-17 10:59:40,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 264 transitions, 638 flow [2025-03-17 10:59:40,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 264 transitions, 630 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 10:59:40,430 INFO L231 Difference]: Finished difference. Result has 270 places, 252 transitions, 518 flow [2025-03-17 10:59:40,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=270, PETRI_TRANSITIONS=252} [2025-03-17 10:59:40,436 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -24 predicate places. [2025-03-17 10:59:40,437 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 252 transitions, 518 flow [2025-03-17 10:59:40,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 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-17 10:59:40,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:40,438 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] [2025-03-17 10:59:40,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:59:40,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:40,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:40,439 INFO L85 PathProgramCache]: Analyzing trace with hash -890056058, now seen corresponding path program 1 times [2025-03-17 10:59:40,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:40,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840804195] [2025-03-17 10:59:40,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:40,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 10:59:40,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:59:40,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:40,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:40,831 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-17 10:59:40,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840804195] [2025-03-17 10:59:40,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840804195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:40,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:40,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481896598] [2025-03-17 10:59:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:40,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:40,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:41,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 304 [2025-03-17 10:59:41,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 252 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 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-17 10:59:41,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:41,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 304 [2025-03-17 10:59:41,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:41,369 INFO L124 PetriNetUnfolderBase]: 424/1654 cut-off events. [2025-03-17 10:59:41,370 INFO L125 PetriNetUnfolderBase]: For 5/15 co-relation queries the response was YES. [2025-03-17 10:59:41,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 1654 events. 424/1654 cut-off events. For 5/15 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 10645 event pairs, 423 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 2383. Up to 755 conditions per place. [2025-03-17 10:59:41,377 INFO L140 encePairwiseOnDemand]: 298/304 looper letters, 44 selfloop transitions, 5 changer transitions 0/251 dead transitions. [2025-03-17 10:59:41,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 251 transitions, 614 flow [2025-03-17 10:59:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1430 transitions. [2025-03-17 10:59:41,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7839912280701754 [2025-03-17 10:59:41,380 INFO L175 Difference]: Start difference. First operand has 270 places, 252 transitions, 518 flow. Second operand 6 states and 1430 transitions. [2025-03-17 10:59:41,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 251 transitions, 614 flow [2025-03-17 10:59:41,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 251 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:59:41,384 INFO L231 Difference]: Finished difference. Result has 257 places, 251 transitions, 516 flow [2025-03-17 10:59:41,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=516, PETRI_PLACES=257, PETRI_TRANSITIONS=251} [2025-03-17 10:59:41,385 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -37 predicate places. [2025-03-17 10:59:41,385 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 251 transitions, 516 flow [2025-03-17 10:59:41,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 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-17 10:59:41,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:41,386 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] [2025-03-17 10:59:41,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:59:41,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:41,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash 222878511, now seen corresponding path program 1 times [2025-03-17 10:59:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648260872] [2025-03-17 10:59:41,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:41,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 10:59:41,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 10:59:41,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:41,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:41,702 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-17 10:59:41,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:41,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648260872] [2025-03-17 10:59:41,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648260872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:41,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:41,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519378227] [2025-03-17 10:59:41,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:41,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:41,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:41,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:41,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:42,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 304 [2025-03-17 10:59:42,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 251 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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-17 10:59:42,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:42,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 304 [2025-03-17 10:59:42,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:42,177 INFO L124 PetriNetUnfolderBase]: 232/815 cut-off events. [2025-03-17 10:59:42,177 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-03-17 10:59:42,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 815 events. 232/815 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3942 event pairs, 210 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1193. Up to 415 conditions per place. [2025-03-17 10:59:42,183 INFO L140 encePairwiseOnDemand]: 296/304 looper letters, 28 selfloop transitions, 7 changer transitions 0/254 dead transitions. [2025-03-17 10:59:42,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 254 transitions, 593 flow [2025-03-17 10:59:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1524 transitions. [2025-03-17 10:59:42,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355263157894737 [2025-03-17 10:59:42,187 INFO L175 Difference]: Start difference. First operand has 257 places, 251 transitions, 516 flow. Second operand 6 states and 1524 transitions. [2025-03-17 10:59:42,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 254 transitions, 593 flow [2025-03-17 10:59:42,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 254 transitions, 583 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:59:42,194 INFO L231 Difference]: Finished difference. Result has 257 places, 253 transitions, 534 flow [2025-03-17 10:59:42,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=257, PETRI_TRANSITIONS=253} [2025-03-17 10:59:42,195 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -37 predicate places. [2025-03-17 10:59:42,196 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 253 transitions, 534 flow [2025-03-17 10:59:42,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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-17 10:59:42,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:42,197 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] [2025-03-17 10:59:42,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:59:42,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:42,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1057486428, now seen corresponding path program 1 times [2025-03-17 10:59:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853942837] [2025-03-17 10:59:42,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:42,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 10:59:42,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 10:59:42,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:42,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:42,564 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-17 10:59:42,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853942837] [2025-03-17 10:59:42,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853942837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:42,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571149788] [2025-03-17 10:59:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:42,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:42,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:42,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:42,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 304 [2025-03-17 10:59:42,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 253 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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-17 10:59:42,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:42,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 304 [2025-03-17 10:59:42,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:43,015 INFO L124 PetriNetUnfolderBase]: 232/814 cut-off events. [2025-03-17 10:59:43,015 INFO L125 PetriNetUnfolderBase]: For 80/84 co-relation queries the response was YES. [2025-03-17 10:59:43,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 814 events. 232/814 cut-off events. For 80/84 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3888 event pairs, 210 based on Foata normal form. 2/789 useless extension candidates. Maximal degree in co-relation 1000. Up to 415 conditions per place. [2025-03-17 10:59:43,020 INFO L140 encePairwiseOnDemand]: 296/304 looper letters, 28 selfloop transitions, 7 changer transitions 0/253 dead transitions. [2025-03-17 10:59:43,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 253 transitions, 605 flow [2025-03-17 10:59:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1524 transitions. [2025-03-17 10:59:43,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355263157894737 [2025-03-17 10:59:43,025 INFO L175 Difference]: Start difference. First operand has 257 places, 253 transitions, 534 flow. Second operand 6 states and 1524 transitions. [2025-03-17 10:59:43,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 253 transitions, 605 flow [2025-03-17 10:59:43,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 253 transitions, 595 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 10:59:43,029 INFO L231 Difference]: Finished difference. Result has 257 places, 252 transitions, 536 flow [2025-03-17 10:59:43,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=536, PETRI_PLACES=257, PETRI_TRANSITIONS=252} [2025-03-17 10:59:43,030 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -37 predicate places. [2025-03-17 10:59:43,031 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 252 transitions, 536 flow [2025-03-17 10:59:43,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 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-17 10:59:43,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:43,032 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] [2025-03-17 10:59:43,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:59:43,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:43,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1816539765, now seen corresponding path program 1 times [2025-03-17 10:59:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:43,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569144944] [2025-03-17 10:59:43,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:43,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 10:59:43,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 10:59:43,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:43,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 10:59:43,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:43,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569144944] [2025-03-17 10:59:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569144944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:43,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:43,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554409696] [2025-03-17 10:59:43,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:43,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:43,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:43,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:43,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:43,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 304 [2025-03-17 10:59:43,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 252 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-17 10:59:43,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:43,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 304 [2025-03-17 10:59:43,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:43,182 INFO L124 PetriNetUnfolderBase]: 65/531 cut-off events. [2025-03-17 10:59:43,182 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-17 10:59:43,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 531 events. 65/531 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2162 event pairs, 40 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 290. Up to 130 conditions per place. [2025-03-17 10:59:43,186 INFO L140 encePairwiseOnDemand]: 301/304 looper letters, 19 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-03-17 10:59:43,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 251 transitions, 576 flow [2025-03-17 10:59:43,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2025-03-17 10:59:43,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8793859649122807 [2025-03-17 10:59:43,188 INFO L175 Difference]: Start difference. First operand has 257 places, 252 transitions, 536 flow. Second operand 3 states and 802 transitions. [2025-03-17 10:59:43,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 251 transitions, 576 flow [2025-03-17 10:59:43,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 251 transitions, 562 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:59:43,191 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 524 flow [2025-03-17 10:59:43,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=253, PETRI_TRANSITIONS=251} [2025-03-17 10:59:43,192 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -41 predicate places. [2025-03-17 10:59:43,193 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 524 flow [2025-03-17 10:59:43,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-17 10:59:43,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:43,193 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-17 10:59:43,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:59:43,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:43,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:43,194 INFO L85 PathProgramCache]: Analyzing trace with hash -910025245, now seen corresponding path program 1 times [2025-03-17 10:59:43,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:43,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968840140] [2025-03-17 10:59:43,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:43,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:59:43,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:59:43,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:43,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:43,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968840140] [2025-03-17 10:59:43,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968840140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:43,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:43,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130124808] [2025-03-17 10:59:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:43,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:43,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:43,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:43,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 304 [2025-03-17 10:59:43,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-17 10:59:43,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:43,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 304 [2025-03-17 10:59:43,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:43,364 INFO L124 PetriNetUnfolderBase]: 67/535 cut-off events. [2025-03-17 10:59:43,364 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2025-03-17 10:59:43,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 535 events. 67/535 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2129 event pairs, 36 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 559. Up to 128 conditions per place. [2025-03-17 10:59:43,366 INFO L140 encePairwiseOnDemand]: 301/304 looper letters, 21 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-03-17 10:59:43,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 253 transitions, 576 flow [2025-03-17 10:59:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2025-03-17 10:59:43,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8848684210526315 [2025-03-17 10:59:43,369 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 524 flow. Second operand 3 states and 807 transitions. [2025-03-17 10:59:43,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 253 transitions, 576 flow [2025-03-17 10:59:43,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 253 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:43,372 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 522 flow [2025-03-17 10:59:43,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2025-03-17 10:59:43,373 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -42 predicate places. [2025-03-17 10:59:43,373 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 522 flow [2025-03-17 10:59:43,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-17 10:59:43,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:43,374 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-17 10:59:43,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:59:43,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:43,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:43,374 INFO L85 PathProgramCache]: Analyzing trace with hash -60205405, now seen corresponding path program 1 times [2025-03-17 10:59:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176924877] [2025-03-17 10:59:43,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:43,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 10:59:43,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 10:59:43,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:43,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:43,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:43,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176924877] [2025-03-17 10:59:43,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176924877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:43,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:43,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:43,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486330646] [2025-03-17 10:59:43,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:43,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:43,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:43,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:43,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:43,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 304 [2025-03-17 10:59:43,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 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-17 10:59:43,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:43,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 304 [2025-03-17 10:59:43,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:43,551 INFO L124 PetriNetUnfolderBase]: 75/567 cut-off events. [2025-03-17 10:59:43,552 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-17 10:59:43,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 567 events. 75/567 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1899 event pairs, 18 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 590. Up to 90 conditions per place. [2025-03-17 10:59:43,555 INFO L140 encePairwiseOnDemand]: 302/304 looper letters, 20 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2025-03-17 10:59:43,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 255 transitions, 578 flow [2025-03-17 10:59:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 818 transitions. [2025-03-17 10:59:43,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8969298245614035 [2025-03-17 10:59:43,557 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 522 flow. Second operand 3 states and 818 transitions. [2025-03-17 10:59:43,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 255 transitions, 578 flow [2025-03-17 10:59:43,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 255 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:43,561 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 518 flow [2025-03-17 10:59:43,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2025-03-17 10:59:43,562 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -43 predicate places. [2025-03-17 10:59:43,563 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 518 flow [2025-03-17 10:59:43,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 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-17 10:59:43,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:43,564 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, 1, 1] [2025-03-17 10:59:43,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:59:43,564 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:43,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1925413177, now seen corresponding path program 1 times [2025-03-17 10:59:43,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:43,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203600801] [2025-03-17 10:59:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:43,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 10:59:43,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 10:59:43,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:43,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:43,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:43,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203600801] [2025-03-17 10:59:43,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203600801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:43,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:43,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:43,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069736287] [2025-03-17 10:59:43,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:43,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:43,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:43,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:44,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 304 [2025-03-17 10:59:44,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 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-17 10:59:44,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:44,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 304 [2025-03-17 10:59:44,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:44,528 INFO L124 PetriNetUnfolderBase]: 519/1563 cut-off events. [2025-03-17 10:59:44,529 INFO L125 PetriNetUnfolderBase]: For 153/155 co-relation queries the response was YES. [2025-03-17 10:59:44,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 1563 events. 519/1563 cut-off events. For 153/155 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8499 event pairs, 317 based on Foata normal form. 0/1502 useless extension candidates. Maximal degree in co-relation 2541. Up to 835 conditions per place. [2025-03-17 10:59:44,537 INFO L140 encePairwiseOnDemand]: 291/304 looper letters, 50 selfloop transitions, 30 changer transitions 0/278 dead transitions. [2025-03-17 10:59:44,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 278 transitions, 752 flow [2025-03-17 10:59:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1465 transitions. [2025-03-17 10:59:44,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8031798245614035 [2025-03-17 10:59:44,540 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 518 flow. Second operand 6 states and 1465 transitions. [2025-03-17 10:59:44,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 278 transitions, 752 flow [2025-03-17 10:59:44,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 278 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:59:44,544 INFO L231 Difference]: Finished difference. Result has 260 places, 278 transitions, 735 flow [2025-03-17 10:59:44,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=735, PETRI_PLACES=260, PETRI_TRANSITIONS=278} [2025-03-17 10:59:44,547 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -34 predicate places. [2025-03-17 10:59:44,548 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 278 transitions, 735 flow [2025-03-17 10:59:44,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 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-17 10:59:44,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:44,549 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, 1, 1] [2025-03-17 10:59:44,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:59:44,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:44,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash 597029372, now seen corresponding path program 1 times [2025-03-17 10:59:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:44,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368535120] [2025-03-17 10:59:44,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:44,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:44,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 10:59:44,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 10:59:44,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:44,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:44,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:44,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:44,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368535120] [2025-03-17 10:59:44,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368535120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:44,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:44,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:44,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035957461] [2025-03-17 10:59:44,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:44,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:44,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:44,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:44,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:44,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 304 [2025-03-17 10:59:44,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 278 transitions, 735 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-17 10:59:44,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:44,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 304 [2025-03-17 10:59:44,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:44,764 INFO L124 PetriNetUnfolderBase]: 468/1564 cut-off events. [2025-03-17 10:59:44,764 INFO L125 PetriNetUnfolderBase]: For 967/1110 co-relation queries the response was YES. [2025-03-17 10:59:44,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 1564 events. 468/1564 cut-off events. For 967/1110 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9365 event pairs, 176 based on Foata normal form. 6/1507 useless extension candidates. Maximal degree in co-relation 1993. Up to 568 conditions per place. [2025-03-17 10:59:44,774 INFO L140 encePairwiseOnDemand]: 300/304 looper letters, 42 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-03-17 10:59:44,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 279 transitions, 826 flow [2025-03-17 10:59:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2025-03-17 10:59:44,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870614035087719 [2025-03-17 10:59:44,776 INFO L175 Difference]: Start difference. First operand has 260 places, 278 transitions, 735 flow. Second operand 3 states and 809 transitions. [2025-03-17 10:59:44,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 279 transitions, 826 flow [2025-03-17 10:59:44,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 279 transitions, 810 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:44,783 INFO L231 Difference]: Finished difference. Result has 261 places, 278 transitions, 729 flow [2025-03-17 10:59:44,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=729, PETRI_PLACES=261, PETRI_TRANSITIONS=278} [2025-03-17 10:59:44,784 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -33 predicate places. [2025-03-17 10:59:44,784 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 278 transitions, 729 flow [2025-03-17 10:59:44,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-17 10:59:44,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:44,785 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:44,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:59:44,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1492426131, now seen corresponding path program 1 times [2025-03-17 10:59:44,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:44,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762694018] [2025-03-17 10:59:44,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:44,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:44,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 10:59:44,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 10:59:44,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:44,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:44,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:44,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762694018] [2025-03-17 10:59:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762694018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:44,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:44,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019751847] [2025-03-17 10:59:44,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:44,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:44,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:44,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:44,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 304 [2025-03-17 10:59:44,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 278 transitions, 729 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 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-17 10:59:44,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:44,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 304 [2025-03-17 10:59:44,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:44,975 INFO L124 PetriNetUnfolderBase]: 332/1160 cut-off events. [2025-03-17 10:59:44,975 INFO L125 PetriNetUnfolderBase]: For 514/551 co-relation queries the response was YES. [2025-03-17 10:59:44,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 1160 events. 332/1160 cut-off events. For 514/551 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6023 event pairs, 108 based on Foata normal form. 2/1124 useless extension candidates. Maximal degree in co-relation 2086. Up to 403 conditions per place. [2025-03-17 10:59:44,982 INFO L140 encePairwiseOnDemand]: 301/304 looper letters, 50 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-17 10:59:44,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 285 transitions, 867 flow [2025-03-17 10:59:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2025-03-17 10:59:44,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8881578947368421 [2025-03-17 10:59:44,984 INFO L175 Difference]: Start difference. First operand has 261 places, 278 transitions, 729 flow. Second operand 3 states and 810 transitions. [2025-03-17 10:59:44,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 285 transitions, 867 flow [2025-03-17 10:59:44,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 285 transitions, 867 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:44,993 INFO L231 Difference]: Finished difference. Result has 262 places, 277 transitions, 731 flow [2025-03-17 10:59:44,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=731, PETRI_PLACES=262, PETRI_TRANSITIONS=277} [2025-03-17 10:59:44,994 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -32 predicate places. [2025-03-17 10:59:44,994 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 277 transitions, 731 flow [2025-03-17 10:59:44,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 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-17 10:59:44,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:44,995 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:44,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:59:44,995 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:44,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash -329580433, now seen corresponding path program 1 times [2025-03-17 10:59:44,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:44,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804364886] [2025-03-17 10:59:44,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:45,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 10:59:45,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 10:59:45,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:45,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:45,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804364886] [2025-03-17 10:59:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804364886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:45,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:45,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:45,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405940737] [2025-03-17 10:59:45,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:45,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:45,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:45,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:45,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 304 [2025-03-17 10:59:45,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 277 transitions, 731 flow. Second operand has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 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-17 10:59:45,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:45,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 304 [2025-03-17 10:59:45,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:46,002 INFO L124 PetriNetUnfolderBase]: 828/2343 cut-off events. [2025-03-17 10:59:46,002 INFO L125 PetriNetUnfolderBase]: For 1078/1093 co-relation queries the response was YES. [2025-03-17 10:59:46,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5293 conditions, 2343 events. 828/2343 cut-off events. For 1078/1093 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14848 event pairs, 419 based on Foata normal form. 0/2260 useless extension candidates. Maximal degree in co-relation 4956. Up to 1225 conditions per place. [2025-03-17 10:59:46,015 INFO L140 encePairwiseOnDemand]: 291/304 looper letters, 74 selfloop transitions, 30 changer transitions 0/306 dead transitions. [2025-03-17 10:59:46,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 306 transitions, 1061 flow [2025-03-17 10:59:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1465 transitions. [2025-03-17 10:59:46,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8031798245614035 [2025-03-17 10:59:46,018 INFO L175 Difference]: Start difference. First operand has 262 places, 277 transitions, 731 flow. Second operand 6 states and 1465 transitions. [2025-03-17 10:59:46,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 306 transitions, 1061 flow [2025-03-17 10:59:46,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 306 transitions, 1057 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:46,023 INFO L231 Difference]: Finished difference. Result has 270 places, 306 transitions, 993 flow [2025-03-17 10:59:46,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=993, PETRI_PLACES=270, PETRI_TRANSITIONS=306} [2025-03-17 10:59:46,024 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -24 predicate places. [2025-03-17 10:59:46,024 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 306 transitions, 993 flow [2025-03-17 10:59:46,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 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-17 10:59:46,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:46,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:46,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:59:46,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:46,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1259983270, now seen corresponding path program 1 times [2025-03-17 10:59:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:46,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81408605] [2025-03-17 10:59:46,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:46,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 10:59:46,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 10:59:46,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:46,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:46,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81408605] [2025-03-17 10:59:46,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81408605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:46,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:46,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181616541] [2025-03-17 10:59:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:46,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:46,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:46,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:46,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 304 [2025-03-17 10:59:46,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 306 transitions, 993 flow. Second operand has 6 states, 6 states have (on average 243.33333333333334) internal successors, (1460), 6 states have internal predecessors, (1460), 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-17 10:59:46,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:46,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 304 [2025-03-17 10:59:46,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:47,109 INFO L124 PetriNetUnfolderBase]: 925/2867 cut-off events. [2025-03-17 10:59:47,110 INFO L125 PetriNetUnfolderBase]: For 2137/2162 co-relation queries the response was YES. [2025-03-17 10:59:47,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7383 conditions, 2867 events. 925/2867 cut-off events. For 2137/2162 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 20011 event pairs, 307 based on Foata normal form. 0/2750 useless extension candidates. Maximal degree in co-relation 6298. Up to 1290 conditions per place. [2025-03-17 10:59:47,130 INFO L140 encePairwiseOnDemand]: 287/304 looper letters, 96 selfloop transitions, 27 changer transitions 0/335 dead transitions. [2025-03-17 10:59:47,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 335 transitions, 1413 flow [2025-03-17 10:59:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1511 transitions. [2025-03-17 10:59:47,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283991228070176 [2025-03-17 10:59:47,134 INFO L175 Difference]: Start difference. First operand has 270 places, 306 transitions, 993 flow. Second operand 6 states and 1511 transitions. [2025-03-17 10:59:47,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 335 transitions, 1413 flow [2025-03-17 10:59:47,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 335 transitions, 1349 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:47,144 INFO L231 Difference]: Finished difference. Result has 279 places, 327 transitions, 1185 flow [2025-03-17 10:59:47,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1185, PETRI_PLACES=279, PETRI_TRANSITIONS=327} [2025-03-17 10:59:47,145 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -15 predicate places. [2025-03-17 10:59:47,145 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 327 transitions, 1185 flow [2025-03-17 10:59:47,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.33333333333334) internal successors, (1460), 6 states have internal predecessors, (1460), 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-17 10:59:47,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:47,146 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, 1, 1, 1, 1, 1, 1, 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-17 10:59:47,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:59:47,146 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:47,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash 679863165, now seen corresponding path program 1 times [2025-03-17 10:59:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:47,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254015965] [2025-03-17 10:59:47,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:47,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 10:59:47,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 10:59:47,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:47,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:47,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254015965] [2025-03-17 10:59:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254015965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:47,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:47,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606569193] [2025-03-17 10:59:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:47,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:59:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:47,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:59:47,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:59:47,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 304 [2025-03-17 10:59:47,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 327 transitions, 1185 flow. Second operand has 6 states, 6 states have (on average 243.33333333333334) internal successors, (1460), 6 states have internal predecessors, (1460), 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-17 10:59:47,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:47,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 304 [2025-03-17 10:59:47,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:48,383 INFO L124 PetriNetUnfolderBase]: 1209/3471 cut-off events. [2025-03-17 10:59:48,383 INFO L125 PetriNetUnfolderBase]: For 4819/5045 co-relation queries the response was YES. [2025-03-17 10:59:48,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10179 conditions, 3471 events. 1209/3471 cut-off events. For 4819/5045 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 24952 event pairs, 352 based on Foata normal form. 10/3350 useless extension candidates. Maximal degree in co-relation 8782. Up to 1593 conditions per place. [2025-03-17 10:59:48,445 INFO L140 encePairwiseOnDemand]: 287/304 looper letters, 110 selfloop transitions, 39 changer transitions 37/372 dead transitions. [2025-03-17 10:59:48,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 372 transitions, 1881 flow [2025-03-17 10:59:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1511 transitions. [2025-03-17 10:59:48,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283991228070176 [2025-03-17 10:59:48,449 INFO L175 Difference]: Start difference. First operand has 279 places, 327 transitions, 1185 flow. Second operand 6 states and 1511 transitions. [2025-03-17 10:59:48,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 372 transitions, 1881 flow [2025-03-17 10:59:48,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 372 transitions, 1849 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-17 10:59:48,460 INFO L231 Difference]: Finished difference. Result has 288 places, 327 transitions, 1572 flow [2025-03-17 10:59:48,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1572, PETRI_PLACES=288, PETRI_TRANSITIONS=327} [2025-03-17 10:59:48,461 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -6 predicate places. [2025-03-17 10:59:48,461 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 327 transitions, 1572 flow [2025-03-17 10:59:48,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.33333333333334) internal successors, (1460), 6 states have internal predecessors, (1460), 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-17 10:59:48,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:48,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:59:48,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:59:48,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:48,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:48,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1025793808, now seen corresponding path program 1 times [2025-03-17 10:59:48,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:48,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485176086] [2025-03-17 10:59:48,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:48,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:48,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 10:59:48,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 10:59:48,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:48,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485176086] [2025-03-17 10:59:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485176086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:48,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:59:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683209163] [2025-03-17 10:59:48,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:48,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:59:48,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:48,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:59:48,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:59:48,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 304 [2025-03-17 10:59:48,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 327 transitions, 1572 flow. Second operand has 5 states, 5 states have (on average 260.2) internal successors, (1301), 5 states have internal predecessors, (1301), 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-17 10:59:48,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:48,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 304 [2025-03-17 10:59:48,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:48,734 INFO L124 PetriNetUnfolderBase]: 167/626 cut-off events. [2025-03-17 10:59:48,734 INFO L125 PetriNetUnfolderBase]: For 1273/1370 co-relation queries the response was YES. [2025-03-17 10:59:48,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 626 events. 167/626 cut-off events. For 1273/1370 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3088 event pairs, 15 based on Foata normal form. 6/610 useless extension candidates. Maximal degree in co-relation 1625. Up to 179 conditions per place. [2025-03-17 10:59:48,738 INFO L140 encePairwiseOnDemand]: 299/304 looper letters, 43 selfloop transitions, 4 changer transitions 0/178 dead transitions. [2025-03-17 10:59:48,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 178 transitions, 702 flow [2025-03-17 10:59:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:59:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:59:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1590 transitions. [2025-03-17 10:59:48,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717105263157895 [2025-03-17 10:59:48,741 INFO L175 Difference]: Start difference. First operand has 288 places, 327 transitions, 1572 flow. Second operand 6 states and 1590 transitions. [2025-03-17 10:59:48,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 178 transitions, 702 flow [2025-03-17 10:59:48,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 178 transitions, 562 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-17 10:59:48,745 INFO L231 Difference]: Finished difference. Result has 176 places, 150 transitions, 348 flow [2025-03-17 10:59:48,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=176, PETRI_TRANSITIONS=150} [2025-03-17 10:59:48,745 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -118 predicate places. [2025-03-17 10:59:48,745 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 348 flow [2025-03-17 10:59:48,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 260.2) internal successors, (1301), 5 states have internal predecessors, (1301), 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-17 10:59:48,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:48,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:59:48,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:59:48,750 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-17 10:59:48,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash 32634259, now seen corresponding path program 1 times [2025-03-17 10:59:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:48,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176351849] [2025-03-17 10:59:48,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:48,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 10:59:48,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 10:59:48,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:48,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 10:59:48,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:48,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176351849] [2025-03-17 10:59:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176351849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:48,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:48,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785098489] [2025-03-17 10:59:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:48,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:48,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:48,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:48,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 304 [2025-03-17 10:59:48,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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-17 10:59:48,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:48,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 304 [2025-03-17 10:59:48,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:48,856 INFO L124 PetriNetUnfolderBase]: 39/300 cut-off events. [2025-03-17 10:59:48,856 INFO L125 PetriNetUnfolderBase]: For 57/72 co-relation queries the response was YES. [2025-03-17 10:59:48,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 300 events. 39/300 cut-off events. For 57/72 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 928 event pairs, 23 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 503. Up to 76 conditions per place. [2025-03-17 10:59:48,857 INFO L140 encePairwiseOnDemand]: 302/304 looper letters, 0 selfloop transitions, 0 changer transitions 152/152 dead transitions. [2025-03-17 10:59:48,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 152 transitions, 394 flow [2025-03-17 10:59:48,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2025-03-17 10:59:48,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8925438596491229 [2025-03-17 10:59:48,859 INFO L175 Difference]: Start difference. First operand has 176 places, 150 transitions, 348 flow. Second operand 3 states and 814 transitions. [2025-03-17 10:59:48,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 152 transitions, 394 flow [2025-03-17 10:59:48,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 152 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 10:59:48,860 INFO L231 Difference]: Finished difference. Result has 173 places, 0 transitions, 0 flow [2025-03-17 10:59:48,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=173, PETRI_TRANSITIONS=0} [2025-03-17 10:59:48,861 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -121 predicate places. [2025-03-17 10:59:48,861 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 0 transitions, 0 flow [2025-03-17 10:59:48,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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-17 10:59:48,864 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-03-17 10:59:48,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-03-17 10:59:48,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-03-17 10:59:48,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-03-17 10:59:48,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-03-17 10:59:48,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-03-17 10:59:48,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:59:48,867 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:48,871 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:59:48,872 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:59:48,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:59:48 BasicIcfg [2025-03-17 10:59:48,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:59:48,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:59:48,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:59:48,879 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:59:48,879 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:38" (3/4) ... [2025-03-17 10:59:48,880 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 10:59:48,883 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-17 10:59:48,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-17 10:59:48,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 10:59:48,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 10:59:48,891 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 10:59:48,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:59:48,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:59:48,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:59:48,968 INFO L158 Benchmark]: Toolchain (without parser) took 11726.45ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 119.8MB in the beginning and 184.3MB in the end (delta: -64.6MB). Peak memory consumption was 209.8MB. Max. memory is 16.1GB. [2025-03-17 10:59:48,968 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:48,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.49ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 88.0MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 10:59:48,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.94ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 84.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:48,970 INFO L158 Benchmark]: Boogie Preprocessor took 47.97ms. Allocated memory is still 167.8MB. Free memory was 84.7MB in the beginning and 81.7MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:48,970 INFO L158 Benchmark]: IcfgBuilder took 710.48ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 42.8MB in the end (delta: 38.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 10:59:48,970 INFO L158 Benchmark]: TraceAbstraction took 10368.17ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 42.4MB in the beginning and 192.7MB in the end (delta: -150.3MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. [2025-03-17 10:59:48,970 INFO L158 Benchmark]: Witness Printer took 88.25ms. Allocated memory is still 444.6MB. Free memory was 192.7MB in the beginning and 184.3MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:48,971 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 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.49ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 88.0MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.94ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 84.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.97ms. Allocated memory is still 167.8MB. Free memory was 84.7MB in the beginning and 81.7MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 710.48ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 42.8MB in the end (delta: 38.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10368.17ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 42.4MB in the beginning and 192.7MB in the end (delta: -150.3MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. * Witness Printer took 88.25ms. Allocated memory is still 444.6MB. Free memory was 192.7MB in the beginning and 184.3MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3923]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3924]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3925]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3926]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3933]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3942]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3964]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3943]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3934]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3965]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3966]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3960]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3967]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3904]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3908]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3911]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3914]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 311 locations, 326 edges, 29 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: 10.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1576 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 905 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 664 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3637 IncrementalHoareTripleChecker+Invalid, 4301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 664 mSolverCounterUnsat, 42 mSDtfsCounter, 3637 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1572occurred in iteration=13, InterpolantAutomatonStates: 72, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1261 NumberOfCodeBlocks, 1261 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1246 ConstructedInterpolants, 0 QuantifiedInterpolants, 1984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 63/63 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 - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 10:59:48,988 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 Result: TRUE