./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 798a7b37 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-?-798a7b3-m [2025-03-04 06:40:32,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:40:32,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:40:32,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:40:32,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:40:32,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:40:32,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:40:32,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:40:32,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:40:32,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:40:32,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:40:32,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:40:32,995 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:40:32,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:40:32,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:40:32,995 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:40:32,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:40:32,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:40:32,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:40:32,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:40:32,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:40:32,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:40:32,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:40:32,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:40:32,998 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-04 06:40:33,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:40:33,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:40:33,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:40:33,253 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:40:33,253 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:40:33,254 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-04 06:40:34,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfa6f9f4/9dc93c9dfdb34de0905e53713ae8683c/FLAG37d2a17de [2025-03-04 06:40:34,783 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:40:34,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-03-04 06:40:34,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfa6f9f4/9dc93c9dfdb34de0905e53713ae8683c/FLAG37d2a17de [2025-03-04 06:40:34,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bfa6f9f4/9dc93c9dfdb34de0905e53713ae8683c [2025-03-04 06:40:34,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:40:34,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:40:34,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:40:34,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:40:34,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:40:34,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:40:34" (1/1) ... [2025-03-04 06:40:34,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40405fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:34, skipping insertion in model container [2025-03-04 06:40:34,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:40:34" (1/1) ... [2025-03-04 06:40:34,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:40:35,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:40:35,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:40:35,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:40:35,297 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:40:35,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35 WrapperNode [2025-03-04 06:40:35,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:40:35,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:40:35,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:40:35,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:40:35,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,339 INFO L138 Inliner]: procedures = 246, calls = 44, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 219 [2025-03-04 06:40:35,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:40:35,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:40:35,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:40:35,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:40:35,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:40:35,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:40:35,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:40:35,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:40:35,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (1/1) ... [2025-03-04 06:40:35,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:40:35,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:40:35,411 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-04 06:40:35,420 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-04 06:40:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-04 06:40:35,439 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-04 06:40:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:40:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:40:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:40:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:40:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:40:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:40:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:40:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:40:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:40:35,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:40:35,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:40:35,442 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:40:35,687 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:40:35,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:40:36,094 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:40:36,094 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:40:36,146 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:40:36,148 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:40:36,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:36 BoogieIcfgContainer [2025-03-04 06:40:36,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:40:36,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:40:36,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:40:36,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:40:36,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:40:34" (1/3) ... [2025-03-04 06:40:36,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d98ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:40:36, skipping insertion in model container [2025-03-04 06:40:36,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:35" (2/3) ... [2025-03-04 06:40:36,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d98ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:40:36, skipping insertion in model container [2025-03-04 06:40:36,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:36" (3/3) ... [2025-03-04 06:40:36,157 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2025-03-04 06:40:36,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:40:36,172 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 272 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-03-04 06:40:36,172 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:40:36,275 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:40:36,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 624 flow [2025-03-04 06:40:36,399 INFO L124 PetriNetUnfolderBase]: 18/389 cut-off events. [2025-03-04 06:40:36,401 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:40:36,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 389 events. 18/389 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 700 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 225. Up to 4 conditions per place. [2025-03-04 06:40:36,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 305 transitions, 624 flow [2025-03-04 06:40:36,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 302 transitions, 616 flow [2025-03-04 06:40:36,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:36,430 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;@3093d931, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:36,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 06:40:36,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:36,441 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-03-04 06:40:36,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:36,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:36,442 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-04 06:40:36,442 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-04 06:40:36,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1432301260, now seen corresponding path program 1 times [2025-03-04 06:40:36,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:36,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826636514] [2025-03-04 06:40:36,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:36,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:36,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:40:36,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:40:36,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:36,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:37,304 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-04 06:40:37,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826636514] [2025-03-04 06:40:37,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826636514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:37,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:37,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501579665] [2025-03-04 06:40:37,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:37,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:37,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:37,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:37,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305 [2025-03-04 06:40:37,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 302 transitions, 616 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-04 06:40:37,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:37,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305 [2025-03-04 06:40:37,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:38,068 INFO L124 PetriNetUnfolderBase]: 424/1621 cut-off events. [2025-03-04 06:40:38,068 INFO L125 PetriNetUnfolderBase]: For 20/22 co-relation queries the response was YES. [2025-03-04 06:40:38,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 1621 events. 424/1621 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10268 event pairs, 423 based on Foata normal form. 60/1573 useless extension candidates. Maximal degree in co-relation 2107. Up to 755 conditions per place. [2025-03-04 06:40:38,084 INFO L140 encePairwiseOnDemand]: 281/305 looper letters, 44 selfloop transitions, 5 changer transitions 12/265 dead transitions. [2025-03-04 06:40:38,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 265 transitions, 640 flow [2025-03-04 06:40:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1454 transitions. [2025-03-04 06:40:38,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7945355191256831 [2025-03-04 06:40:38,105 INFO L175 Difference]: Start difference. First operand has 295 places, 302 transitions, 616 flow. Second operand 6 states and 1454 transitions. [2025-03-04 06:40:38,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 265 transitions, 640 flow [2025-03-04 06:40:38,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 265 transitions, 632 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:40:38,121 INFO L231 Difference]: Finished difference. Result has 271 places, 253 transitions, 520 flow [2025-03-04 06:40:38,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=271, PETRI_TRANSITIONS=253} [2025-03-04 06:40:38,127 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places. [2025-03-04 06:40:38,127 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 253 transitions, 520 flow [2025-03-04 06:40:38,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-04 06:40:38,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:38,128 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-04 06:40:38,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:40:38,129 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-04 06:40:38,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1547785665, now seen corresponding path program 1 times [2025-03-04 06:40:38,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:38,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648473089] [2025-03-04 06:40:38,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:38,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:38,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:40:38,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:40:38,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:38,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:38,581 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-04 06:40:38,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:38,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648473089] [2025-03-04 06:40:38,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648473089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:38,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:38,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500186191] [2025-03-04 06:40:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:38,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:38,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:38,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:38,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 305 [2025-03-04 06:40:38,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 253 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-04 06:40:38,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:38,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 305 [2025-03-04 06:40:38,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:39,112 INFO L124 PetriNetUnfolderBase]: 424/1608 cut-off events. [2025-03-04 06:40:39,113 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-03-04 06:40:39,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 1608 events. 424/1608 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 10227 event pairs, 423 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 2337. Up to 755 conditions per place. [2025-03-04 06:40:39,122 INFO L140 encePairwiseOnDemand]: 299/305 looper letters, 44 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2025-03-04 06:40:39,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 252 transitions, 616 flow [2025-03-04 06:40:39,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1436 transitions. [2025-03-04 06:40:39,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7846994535519126 [2025-03-04 06:40:39,127 INFO L175 Difference]: Start difference. First operand has 271 places, 253 transitions, 520 flow. Second operand 6 states and 1436 transitions. [2025-03-04 06:40:39,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 252 transitions, 616 flow [2025-03-04 06:40:39,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:40:39,133 INFO L231 Difference]: Finished difference. Result has 258 places, 252 transitions, 518 flow [2025-03-04 06:40:39,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=518, PETRI_PLACES=258, PETRI_TRANSITIONS=252} [2025-03-04 06:40:39,136 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2025-03-04 06:40:39,136 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 252 transitions, 518 flow [2025-03-04 06:40:39,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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-04 06:40:39,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:39,137 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-04 06:40:39,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:40:39,137 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-04 06:40:39,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1197698700, now seen corresponding path program 1 times [2025-03-04 06:40:39,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:39,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536869667] [2025-03-04 06:40:39,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:39,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:40:39,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:40:39,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:39,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:39,468 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-04 06:40:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536869667] [2025-03-04 06:40:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536869667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:39,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:39,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756487806] [2025-03-04 06:40:39,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:39,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:39,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:39,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:39,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:39,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305 [2025-03-04 06:40:39,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 252 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-04 06:40:39,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:39,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305 [2025-03-04 06:40:39,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:39,956 INFO L124 PetriNetUnfolderBase]: 232/817 cut-off events. [2025-03-04 06:40:39,957 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-03-04 06:40:39,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 817 events. 232/817 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3895 event pairs, 210 based on Foata normal form. 0/789 useless extension candidates. Maximal degree in co-relation 1195. Up to 415 conditions per place. [2025-03-04 06:40:39,962 INFO L140 encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/255 dead transitions. [2025-03-04 06:40:39,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 255 transitions, 595 flow [2025-03-04 06:40:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2025-03-04 06:40:39,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2025-03-04 06:40:39,967 INFO L175 Difference]: Start difference. First operand has 258 places, 252 transitions, 518 flow. Second operand 6 states and 1530 transitions. [2025-03-04 06:40:39,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 255 transitions, 595 flow [2025-03-04 06:40:39,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 255 transitions, 585 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:40:39,972 INFO L231 Difference]: Finished difference. Result has 258 places, 254 transitions, 536 flow [2025-03-04 06:40:39,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=536, PETRI_PLACES=258, PETRI_TRANSITIONS=254} [2025-03-04 06:40:39,973 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2025-03-04 06:40:39,974 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 254 transitions, 536 flow [2025-03-04 06:40:39,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-04 06:40:39,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:39,975 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-04 06:40:39,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:40:39,975 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-04 06:40:39,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash 770905336, now seen corresponding path program 1 times [2025-03-04 06:40:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508532492] [2025-03-04 06:40:39,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:39,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:40:40,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:40:40,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:40,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:40,327 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-04 06:40:40,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:40,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508532492] [2025-03-04 06:40:40,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508532492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:40,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:40,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:40,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887556923] [2025-03-04 06:40:40,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:40,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:40,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:40,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:40,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 305 [2025-03-04 06:40:40,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 254 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-04 06:40:40,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:40,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 305 [2025-03-04 06:40:40,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:40,873 INFO L124 PetriNetUnfolderBase]: 232/816 cut-off events. [2025-03-04 06:40:40,873 INFO L125 PetriNetUnfolderBase]: For 80/84 co-relation queries the response was YES. [2025-03-04 06:40:40,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 816 events. 232/816 cut-off events. For 80/84 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3891 event pairs, 210 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 1001. Up to 415 conditions per place. [2025-03-04 06:40:40,879 INFO L140 encePairwiseOnDemand]: 297/305 looper letters, 28 selfloop transitions, 7 changer transitions 0/254 dead transitions. [2025-03-04 06:40:40,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 254 transitions, 607 flow [2025-03-04 06:40:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2025-03-04 06:40:40,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2025-03-04 06:40:40,884 INFO L175 Difference]: Start difference. First operand has 258 places, 254 transitions, 536 flow. Second operand 6 states and 1530 transitions. [2025-03-04 06:40:40,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 254 transitions, 607 flow [2025-03-04 06:40:40,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 254 transitions, 597 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:40:40,888 INFO L231 Difference]: Finished difference. Result has 258 places, 253 transitions, 538 flow [2025-03-04 06:40:40,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2025-03-04 06:40:40,889 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -37 predicate places. [2025-03-04 06:40:40,890 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 538 flow [2025-03-04 06:40:40,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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-04 06:40:40,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:40,891 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-04 06:40:40,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:40:40,892 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-04 06:40:40,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1360502104, now seen corresponding path program 1 times [2025-03-04 06:40:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:40,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081528011] [2025-03-04 06:40:40,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:40,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:40,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:40:40,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:40:40,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:40,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:40,967 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-04 06:40:40,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:40,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081528011] [2025-03-04 06:40:40,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081528011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:40,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480486410] [2025-03-04 06:40:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:40,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:40,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:40,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:40,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:40,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 305 [2025-03-04 06:40:40,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 538 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-04 06:40:40,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:40,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 305 [2025-03-04 06:40:40,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:41,055 INFO L124 PetriNetUnfolderBase]: 65/533 cut-off events. [2025-03-04 06:40:41,056 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-04 06:40:41,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 533 events. 65/533 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2179 event pairs, 40 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 291. Up to 130 conditions per place. [2025-03-04 06:40:41,059 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 19 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2025-03-04 06:40:41,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 252 transitions, 578 flow [2025-03-04 06:40:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2025-03-04 06:40:41,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2025-03-04 06:40:41,061 INFO L175 Difference]: Start difference. First operand has 258 places, 253 transitions, 538 flow. Second operand 3 states and 805 transitions. [2025-03-04 06:40:41,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 252 transitions, 578 flow [2025-03-04 06:40:41,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 252 transitions, 564 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:40:41,065 INFO L231 Difference]: Finished difference. Result has 254 places, 252 transitions, 526 flow [2025-03-04 06:40:41,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=254, PETRI_TRANSITIONS=252} [2025-03-04 06:40:41,066 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -41 predicate places. [2025-03-04 06:40:41,066 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 252 transitions, 526 flow [2025-03-04 06:40:41,066 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-04 06:40:41,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:41,066 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-04 06:40:41,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:40:41,067 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-04 06:40:41,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:41,067 INFO L85 PathProgramCache]: Analyzing trace with hash -117261809, now seen corresponding path program 1 times [2025-03-04 06:40:41,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:41,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774634056] [2025-03-04 06:40:41,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:41,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:41,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:40:41,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:40:41,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:41,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:41,145 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-04 06:40:41,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774634056] [2025-03-04 06:40:41,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774634056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:41,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884599971] [2025-03-04 06:40:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:41,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:41,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:41,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:41,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305 [2025-03-04 06:40:41,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 252 transitions, 526 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-04 06:40:41,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:41,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305 [2025-03-04 06:40:41,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:41,219 INFO L124 PetriNetUnfolderBase]: 67/474 cut-off events. [2025-03-04 06:40:41,219 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2025-03-04 06:40:41,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 474 events. 67/474 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1718 event pairs, 45 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 497. Up to 128 conditions per place. [2025-03-04 06:40:41,222 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 21 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-03-04 06:40:41,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 578 flow [2025-03-04 06:40:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2025-03-04 06:40:41,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8852459016393442 [2025-03-04 06:40:41,223 INFO L175 Difference]: Start difference. First operand has 254 places, 252 transitions, 526 flow. Second operand 3 states and 810 transitions. [2025-03-04 06:40:41,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 578 flow [2025-03-04 06:40:41,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:41,227 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 524 flow [2025-03-04 06:40:41,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, 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-04 06:40:41,228 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -42 predicate places. [2025-03-04 06:40:41,228 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 524 flow [2025-03-04 06:40:41,228 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-04 06:40:41,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:41,228 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-04 06:40:41,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:40:41,229 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-04 06:40:41,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:41,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1320388840, now seen corresponding path program 1 times [2025-03-04 06:40:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:41,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695074606] [2025-03-04 06:40:41,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:41,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 06:40:41,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 06:40:41,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:41,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:40:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695074606] [2025-03-04 06:40:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695074606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:41,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:41,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87360074] [2025-03-04 06:40:41,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:41,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:41,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:41,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:41,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305 [2025-03-04 06:40:41,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 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-04 06:40:41,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:41,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305 [2025-03-04 06:40:41,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:41,399 INFO L124 PetriNetUnfolderBase]: 75/555 cut-off events. [2025-03-04 06:40:41,399 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 06:40:41,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 555 events. 75/555 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1837 event pairs, 18 based on Foata normal form. 0/525 useless extension candidates. Maximal degree in co-relation 577. Up to 90 conditions per place. [2025-03-04 06:40:41,402 INFO L140 encePairwiseOnDemand]: 303/305 looper letters, 20 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2025-03-04 06:40:41,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 256 transitions, 580 flow [2025-03-04 06:40:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2025-03-04 06:40:41,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972677595628415 [2025-03-04 06:40:41,404 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 524 flow. Second operand 3 states and 821 transitions. [2025-03-04 06:40:41,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 256 transitions, 580 flow [2025-03-04 06:40:41,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 256 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:41,407 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 520 flow [2025-03-04 06:40:41,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2025-03-04 06:40:41,408 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places. [2025-03-04 06:40:41,408 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 520 flow [2025-03-04 06:40:41,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 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-04 06:40:41,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:41,408 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-04 06:40:41,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:40:41,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:40:41,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash -68707559, now seen corresponding path program 1 times [2025-03-04 06:40:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:41,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757377616] [2025-03-04 06:40:41,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:41,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 06:40:41,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 06:40:41,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:41,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:40:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757377616] [2025-03-04 06:40:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757377616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:41,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97814581] [2025-03-04 06:40:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:41,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:41,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:41,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:41,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:41,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 305 [2025-03-04 06:40:41,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-04 06:40:41,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:41,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 305 [2025-03-04 06:40:41,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:41,533 INFO L124 PetriNetUnfolderBase]: 64/680 cut-off events. [2025-03-04 06:40:41,533 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 06:40:41,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 680 events. 64/680 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2668 event pairs, 44 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 715. Up to 130 conditions per place. [2025-03-04 06:40:41,537 INFO L140 encePairwiseOnDemand]: 301/305 looper letters, 18 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2025-03-04 06:40:41,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 251 transitions, 563 flow [2025-03-04 06:40:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2025-03-04 06:40:41,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8874316939890711 [2025-03-04 06:40:41,539 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 520 flow. Second operand 3 states and 812 transitions. [2025-03-04 06:40:41,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 251 transitions, 563 flow [2025-03-04 06:40:41,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 251 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:41,542 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 529 flow [2025-03-04 06:40:41,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2025-03-04 06:40:41,543 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -43 predicate places. [2025-03-04 06:40:41,543 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 529 flow [2025-03-04 06:40:41,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-04 06:40:41,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:41,543 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] [2025-03-04 06:40:41,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:40:41,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:40:41,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1010476882, now seen corresponding path program 1 times [2025-03-04 06:40:41,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:41,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59787966] [2025-03-04 06:40:41,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:41,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:40:41,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:40:41,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:41,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:40:41,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:41,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59787966] [2025-03-04 06:40:41,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59787966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:41,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:41,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:41,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096569297] [2025-03-04 06:40:41,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:41,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:41,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:41,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:41,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:42,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305 [2025-03-04 06:40:42,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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-04 06:40:42,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:42,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305 [2025-03-04 06:40:42,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:42,479 INFO L124 PetriNetUnfolderBase]: 578/1724 cut-off events. [2025-03-04 06:40:42,480 INFO L125 PetriNetUnfolderBase]: For 171/180 co-relation queries the response was YES. [2025-03-04 06:40:42,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3004 conditions, 1724 events. 578/1724 cut-off events. For 171/180 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 9894 event pairs, 347 based on Foata normal form. 0/1644 useless extension candidates. Maximal degree in co-relation 2473. Up to 943 conditions per place. [2025-03-04 06:40:42,489 INFO L140 encePairwiseOnDemand]: 292/305 looper letters, 50 selfloop transitions, 30 changer transitions 0/279 dead transitions. [2025-03-04 06:40:42,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 279 transitions, 763 flow [2025-03-04 06:40:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2025-03-04 06:40:42,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038251366120218 [2025-03-04 06:40:42,492 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 529 flow. Second operand 6 states and 1471 transitions. [2025-03-04 06:40:42,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 279 transitions, 763 flow [2025-03-04 06:40:42,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 279 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:42,497 INFO L231 Difference]: Finished difference. Result has 262 places, 279 transitions, 747 flow [2025-03-04 06:40:42,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=747, PETRI_PLACES=262, PETRI_TRANSITIONS=279} [2025-03-04 06:40:42,498 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -33 predicate places. [2025-03-04 06:40:42,498 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 279 transitions, 747 flow [2025-03-04 06:40:42,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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-04 06:40:42,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:42,499 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-04 06:40:42,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:40:42,499 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-04 06:40:42,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash -375758158, now seen corresponding path program 1 times [2025-03-04 06:40:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103683830] [2025-03-04 06:40:42,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:42,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:42,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:40:42,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:40:42,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:42,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:40:42,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:42,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103683830] [2025-03-04 06:40:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103683830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:42,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:42,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259005221] [2025-03-04 06:40:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:42,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:42,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:42,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:42,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 305 [2025-03-04 06:40:42,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 279 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 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-04 06:40:42,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:42,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 305 [2025-03-04 06:40:42,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:42,734 INFO L124 PetriNetUnfolderBase]: 332/1161 cut-off events. [2025-03-04 06:40:42,735 INFO L125 PetriNetUnfolderBase]: For 608/629 co-relation queries the response was YES. [2025-03-04 06:40:42,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 1161 events. 332/1161 cut-off events. For 608/629 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6045 event pairs, 99 based on Foata normal form. 2/1126 useless extension candidates. Maximal degree in co-relation 2135. Up to 403 conditions per place. [2025-03-04 06:40:42,744 INFO L140 encePairwiseOnDemand]: 302/305 looper letters, 50 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2025-03-04 06:40:42,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 286 transitions, 885 flow [2025-03-04 06:40:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 813 transitions. [2025-03-04 06:40:42,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8885245901639345 [2025-03-04 06:40:42,747 INFO L175 Difference]: Start difference. First operand has 262 places, 279 transitions, 747 flow. Second operand 3 states and 813 transitions. [2025-03-04 06:40:42,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 286 transitions, 885 flow [2025-03-04 06:40:42,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 286 transitions, 869 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:42,756 INFO L231 Difference]: Finished difference. Result has 263 places, 278 transitions, 733 flow [2025-03-04 06:40:42,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=263, PETRI_TRANSITIONS=278} [2025-03-04 06:40:42,757 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -32 predicate places. [2025-03-04 06:40:42,757 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 278 transitions, 733 flow [2025-03-04 06:40:42,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 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-04 06:40:42,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:42,758 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] [2025-03-04 06:40:42,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:40:42,758 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-04 06:40:42,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash 436136059, now seen corresponding path program 1 times [2025-03-04 06:40:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318305399] [2025-03-04 06:40:42,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:42,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 06:40:42,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 06:40:42,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:42,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:40:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318305399] [2025-03-04 06:40:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318305399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:43,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:43,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227332897] [2025-03-04 06:40:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:43,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:43,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:43,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:43,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 305 [2025-03-04 06:40:43,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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-04 06:40:43,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:43,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 305 [2025-03-04 06:40:43,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:43,775 INFO L124 PetriNetUnfolderBase]: 828/2332 cut-off events. [2025-03-04 06:40:43,776 INFO L125 PetriNetUnfolderBase]: For 1076/1100 co-relation queries the response was YES. [2025-03-04 06:40:43,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5280 conditions, 2332 events. 828/2332 cut-off events. For 1076/1100 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14694 event pairs, 419 based on Foata normal form. 0/2248 useless extension candidates. Maximal degree in co-relation 5026. Up to 1225 conditions per place. [2025-03-04 06:40:43,789 INFO L140 encePairwiseOnDemand]: 292/305 looper letters, 74 selfloop transitions, 30 changer transitions 0/307 dead transitions. [2025-03-04 06:40:43,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 307 transitions, 1063 flow [2025-03-04 06:40:43,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2025-03-04 06:40:43,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038251366120218 [2025-03-04 06:40:43,792 INFO L175 Difference]: Start difference. First operand has 263 places, 278 transitions, 733 flow. Second operand 6 states and 1471 transitions. [2025-03-04 06:40:43,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 307 transitions, 1063 flow [2025-03-04 06:40:43,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 307 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:43,798 INFO L231 Difference]: Finished difference. Result has 271 places, 307 transitions, 995 flow [2025-03-04 06:40:43,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=995, PETRI_PLACES=271, PETRI_TRANSITIONS=307} [2025-03-04 06:40:43,799 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -24 predicate places. [2025-03-04 06:40:43,799 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 307 transitions, 995 flow [2025-03-04 06:40:43,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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-04 06:40:43,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:43,800 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] [2025-03-04 06:40:43,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:40:43,800 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-04 06:40:43,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1716192315, now seen corresponding path program 1 times [2025-03-04 06:40:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:43,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399813338] [2025-03-04 06:40:43,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:43,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 06:40:43,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 06:40:43,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:43,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:40:44,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:44,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399813338] [2025-03-04 06:40:44,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399813338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:44,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:44,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:44,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928070681] [2025-03-04 06:40:44,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:44,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:44,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:44,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:44,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:44,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305 [2025-03-04 06:40:44,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 307 transitions, 995 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-04 06:40:44,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:44,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305 [2025-03-04 06:40:44,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:44,962 INFO L124 PetriNetUnfolderBase]: 925/2856 cut-off events. [2025-03-04 06:40:44,962 INFO L125 PetriNetUnfolderBase]: For 2135/2171 co-relation queries the response was YES. [2025-03-04 06:40:44,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7371 conditions, 2856 events. 925/2856 cut-off events. For 2135/2171 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 19881 event pairs, 307 based on Foata normal form. 0/2738 useless extension candidates. Maximal degree in co-relation 6285. Up to 1290 conditions per place. [2025-03-04 06:40:44,988 INFO L140 encePairwiseOnDemand]: 288/305 looper letters, 96 selfloop transitions, 27 changer transitions 0/336 dead transitions. [2025-03-04 06:40:44,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 336 transitions, 1415 flow [2025-03-04 06:40:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2025-03-04 06:40:44,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289617486338798 [2025-03-04 06:40:44,994 INFO L175 Difference]: Start difference. First operand has 271 places, 307 transitions, 995 flow. Second operand 6 states and 1517 transitions. [2025-03-04 06:40:44,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 336 transitions, 1415 flow [2025-03-04 06:40:45,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 336 transitions, 1351 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:45,006 INFO L231 Difference]: Finished difference. Result has 280 places, 328 transitions, 1187 flow [2025-03-04 06:40:45,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1187, PETRI_PLACES=280, PETRI_TRANSITIONS=328} [2025-03-04 06:40:45,009 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -15 predicate places. [2025-03-04 06:40:45,011 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 328 transitions, 1187 flow [2025-03-04 06:40:45,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-04 06:40:45,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:45,012 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] [2025-03-04 06:40:45,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:40:45,013 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-04 06:40:45,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1563886253, now seen corresponding path program 1 times [2025-03-04 06:40:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:45,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157650432] [2025-03-04 06:40:45,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:45,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 06:40:45,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 06:40:45,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:45,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:40:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157650432] [2025-03-04 06:40:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157650432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:45,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:45,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544578074] [2025-03-04 06:40:45,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:45,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:40:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:45,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:40:45,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:40:45,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 305 [2025-03-04 06:40:45,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 328 transitions, 1187 flow. Second operand has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-04 06:40:45,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:45,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 305 [2025-03-04 06:40:45,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:46,292 INFO L124 PetriNetUnfolderBase]: 1209/3460 cut-off events. [2025-03-04 06:40:46,293 INFO L125 PetriNetUnfolderBase]: For 4790/5018 co-relation queries the response was YES. [2025-03-04 06:40:46,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10167 conditions, 3460 events. 1209/3460 cut-off events. For 4790/5018 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 24895 event pairs, 352 based on Foata normal form. 10/3338 useless extension candidates. Maximal degree in co-relation 8769. Up to 1593 conditions per place. [2025-03-04 06:40:46,314 INFO L140 encePairwiseOnDemand]: 288/305 looper letters, 110 selfloop transitions, 39 changer transitions 37/373 dead transitions. [2025-03-04 06:40:46,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 373 transitions, 1883 flow [2025-03-04 06:40:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1517 transitions. [2025-03-04 06:40:46,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8289617486338798 [2025-03-04 06:40:46,317 INFO L175 Difference]: Start difference. First operand has 280 places, 328 transitions, 1187 flow. Second operand 6 states and 1517 transitions. [2025-03-04 06:40:46,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 373 transitions, 1883 flow [2025-03-04 06:40:46,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 373 transitions, 1851 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:46,327 INFO L231 Difference]: Finished difference. Result has 289 places, 328 transitions, 1574 flow [2025-03-04 06:40:46,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1574, PETRI_PLACES=289, PETRI_TRANSITIONS=328} [2025-03-04 06:40:46,328 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -6 predicate places. [2025-03-04 06:40:46,328 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 328 transitions, 1574 flow [2025-03-04 06:40:46,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.33333333333334) internal successors, (1466), 6 states have internal predecessors, (1466), 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-04 06:40:46,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:46,329 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] [2025-03-04 06:40:46,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:40:46,329 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-04 06:40:46,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:46,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1623307407, now seen corresponding path program 1 times [2025-03-04 06:40:46,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:46,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519738583] [2025-03-04 06:40:46,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:46,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 06:40:46,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 06:40:46,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:46,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:40:46,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:46,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519738583] [2025-03-04 06:40:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519738583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:46,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:46,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433360872] [2025-03-04 06:40:46,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:46,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:40:46,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:46,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:40:46,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:40:46,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 305 [2025-03-04 06:40:46,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 328 transitions, 1574 flow. Second operand has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 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-04 06:40:46,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:46,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 305 [2025-03-04 06:40:46,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:46,624 INFO L124 PetriNetUnfolderBase]: 167/614 cut-off events. [2025-03-04 06:40:46,624 INFO L125 PetriNetUnfolderBase]: For 1270/1332 co-relation queries the response was YES. [2025-03-04 06:40:46,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 614 events. 167/614 cut-off events. For 1270/1332 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3064 event pairs, 15 based on Foata normal form. 6/607 useless extension candidates. Maximal degree in co-relation 1612. Up to 179 conditions per place. [2025-03-04 06:40:46,627 INFO L140 encePairwiseOnDemand]: 300/305 looper letters, 43 selfloop transitions, 4 changer transitions 0/178 dead transitions. [2025-03-04 06:40:46,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 178 transitions, 702 flow [2025-03-04 06:40:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:40:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:40:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2025-03-04 06:40:46,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8721311475409836 [2025-03-04 06:40:46,634 INFO L175 Difference]: Start difference. First operand has 289 places, 328 transitions, 1574 flow. Second operand 6 states and 1596 transitions. [2025-03-04 06:40:46,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 178 transitions, 702 flow [2025-03-04 06:40:46,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 178 transitions, 562 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-03-04 06:40:46,638 INFO L231 Difference]: Finished difference. Result has 176 places, 150 transitions, 348 flow [2025-03-04 06:40:46,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, 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-04 06:40:46,640 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -119 predicate places. [2025-03-04 06:40:46,640 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 348 flow [2025-03-04 06:40:46,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 261.2) internal successors, (1306), 5 states have internal predecessors, (1306), 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-04 06:40:46,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:46,642 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-04 06:40:46,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:40:46,642 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-04 06:40:46,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash -544523988, now seen corresponding path program 1 times [2025-03-04 06:40:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743454974] [2025-03-04 06:40:46,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:46,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 06:40:46,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 06:40:46,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:46,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 06:40:46,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:46,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743454974] [2025-03-04 06:40:46,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743454974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:46,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:46,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:46,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510190498] [2025-03-04 06:40:46,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:46,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:46,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:46,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:46,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:46,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 305 [2025-03-04 06:40:46,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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-04 06:40:46,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:46,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 305 [2025-03-04 06:40:46,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:46,790 INFO L124 PetriNetUnfolderBase]: 39/300 cut-off events. [2025-03-04 06:40:46,791 INFO L125 PetriNetUnfolderBase]: For 60/81 co-relation queries the response was YES. [2025-03-04 06:40:46,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 300 events. 39/300 cut-off events. For 60/81 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 932 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-04 06:40:46,792 INFO L140 encePairwiseOnDemand]: 303/305 looper letters, 0 selfloop transitions, 0 changer transitions 152/152 dead transitions. [2025-03-04 06:40:46,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 152 transitions, 394 flow [2025-03-04 06:40:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2025-03-04 06:40:46,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892896174863388 [2025-03-04 06:40:46,795 INFO L175 Difference]: Start difference. First operand has 176 places, 150 transitions, 348 flow. Second operand 3 states and 817 transitions. [2025-03-04 06:40:46,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 152 transitions, 394 flow [2025-03-04 06:40:46,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 152 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:40:46,798 INFO L231 Difference]: Finished difference. Result has 173 places, 0 transitions, 0 flow [2025-03-04 06:40:46,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, 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-04 06:40:46,798 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, -122 predicate places. [2025-03-04 06:40:46,798 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 0 transitions, 0 flow [2025-03-04 06:40:46,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 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-04 06:40:46,804 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2025-03-04 06:40:46,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-03-04 06:40:46,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-03-04 06:40:46,805 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-03-04 06:40:46,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-03-04 06:40:46,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-03-04 06:40:46,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-03-04 06:40:46,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-03-04 06:40:46,806 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-03-04 06:40:46,807 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-03-04 06:40:46,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-03-04 06:40:46,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-03-04 06:40:46,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-03-04 06:40:46,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-03-04 06:40:46,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-03-04 06:40:46,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:40:46,808 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:46,815 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:40:46,816 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:40:46,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:40:46 BasicIcfg [2025-03-04 06:40:46,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:40:46,824 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:40:46,824 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:40:46,825 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:40:46,825 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:36" (3/4) ... [2025-03-04 06:40:46,827 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:40:46,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-04 06:40:46,839 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-04 06:40:46,840 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 06:40:46,840 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:40:46,841 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:40:46,934 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:40:46,934 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:40:46,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:40:46,935 INFO L158 Benchmark]: Toolchain (without parser) took 12094.78ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 120.3MB in the beginning and 466.6MB in the end (delta: -346.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2025-03-04 06:40:46,936 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:40:46,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.33ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 88.6MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 06:40:46,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.36ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:40:46,937 INFO L158 Benchmark]: Boogie Preprocessor took 37.44ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 82.1MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:40:46,938 INFO L158 Benchmark]: IcfgBuilder took 770.64ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 43.9MB in the end (delta: 38.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 06:40:46,938 INFO L158 Benchmark]: TraceAbstraction took 10672.96ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 43.0MB in the beginning and 470.8MB in the end (delta: -427.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:40:46,939 INFO L158 Benchmark]: Witness Printer took 110.11ms. Allocated memory is still 545.3MB. Free memory was 470.8MB in the beginning and 466.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:40:46,941 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.34ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.33ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 88.6MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.36ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 85.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.44ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 82.1MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 770.64ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 43.9MB in the end (delta: 38.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10672.96ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 43.0MB in the beginning and 470.8MB in the end (delta: -427.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 110.11ms. Allocated memory is still 545.3MB. Free memory was 470.8MB in the beginning and 466.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. 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: 3960]: 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: 3961]: 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: 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, 312 locations, 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.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1642 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3559 IncrementalHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 135 mSDtfsCounter, 3559 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.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1574occurred 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.5s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 1989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 102/102 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-04 06:40:46,965 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