./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 71b70db56146daaa7371fed58b975e1add8fa8ab54b0a1b08c677a431a619350 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:19:44,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:19:44,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:19:44,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:19:44,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:19:44,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:19:44,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:19:44,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:19:44,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:19:44,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:19:44,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:19:44,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:19:44,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:19:44,687 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:19:44,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:19:44,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:19:44,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:19:44,688 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-jdk21/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 -> 71b70db56146daaa7371fed58b975e1add8fa8ab54b0a1b08c677a431a619350 [2025-02-06 09:19:44,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:19:44,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:19:44,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:19:44,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:19:44,902 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:19:44,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i [2025-02-06 09:19:46,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c903c2ae/b709fb1727914a44a6b7eac110546960/FLAGd62caea58 [2025-02-06 09:19:46,295 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:19:46,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i [2025-02-06 09:19:46,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c903c2ae/b709fb1727914a44a6b7eac110546960/FLAGd62caea58 [2025-02-06 09:19:46,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c903c2ae/b709fb1727914a44a6b7eac110546960 [2025-02-06 09:19:46,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:19:46,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:19:46,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:19:46,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:19:46,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:19:46,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:19:46" (1/1) ... [2025-02-06 09:19:46,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763e76c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:46, skipping insertion in model container [2025-02-06 09:19:46,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:19:46" (1/1) ... [2025-02-06 09:19:46,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:19:47,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:19:47,053 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:19:47,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:19:47,150 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:19:47,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47 WrapperNode [2025-02-06 09:19:47,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:19:47,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:19:47,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:19:47,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:19:47,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,193 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2025-02-06 09:19:47,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:19:47,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:19:47,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:19:47,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:19:47,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,214 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:19:47,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:19:47,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:19:47,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:19:47,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (1/1) ... [2025-02-06 09:19:47,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:19:47,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:19:47,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:19:47,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:19:47,276 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:19:47,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:19:47,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:19:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:19:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:19:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:19:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:19:47,277 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:19:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:19:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:19:47,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:19:47,279 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:19:47,379 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:19:47,380 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:19:47,539 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:19:47,540 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:19:47,563 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:19:47,564 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:19:47,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:19:47 BoogieIcfgContainer [2025-02-06 09:19:47,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:19:47,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:19:47,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:19:47,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:19:47,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:19:46" (1/3) ... [2025-02-06 09:19:47,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b2f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:19:47, skipping insertion in model container [2025-02-06 09:19:47,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:19:47" (2/3) ... [2025-02-06 09:19:47,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b2f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:19:47, skipping insertion in model container [2025-02-06 09:19:47,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:19:47" (3/3) ... [2025-02-06 09:19:47,574 INFO L128 eAbstractionObserver]: Analyzing ICFG 02-base_26-malloc_struct.i [2025-02-06 09:19:47,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:19:47,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02-base_26-malloc_struct.i that has 2 procedures, 96 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-02-06 09:19:47,587 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:19:47,639 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:19:47,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 194 flow [2025-02-06 09:19:47,721 INFO L124 PetriNetUnfolderBase]: 0/94 cut-off events. [2025-02-06 09:19:47,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:19:47,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 94 events. 0/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-02-06 09:19:47,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 95 transitions, 194 flow [2025-02-06 09:19:47,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 94 transitions, 191 flow [2025-02-06 09:19:47,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:19:47,746 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;@e1bbf90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:19:47,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 09:19:47,752 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:19:47,753 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-02-06 09:19:47,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:19:47,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:47,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:19:47,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:47,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:47,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1200289887, now seen corresponding path program 1 times [2025-02-06 09:19:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:47,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328421368] [2025-02-06 09:19:47,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:47,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 09:19:47,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:19:47,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:47,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328421368] [2025-02-06 09:19:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328421368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:47,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:47,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:19:47,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554456622] [2025-02-06 09:19:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:47,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:19:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:47,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:19:47,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:19:47,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 95 [2025-02-06 09:19:47,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-02-06 09:19:47,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:47,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 95 [2025-02-06 09:19:47,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:48,066 INFO L124 PetriNetUnfolderBase]: 16/229 cut-off events. [2025-02-06 09:19:48,066 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:19:48,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 229 events. 16/229 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 742 event pairs, 16 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 240. Up to 46 conditions per place. [2025-02-06 09:19:48,069 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 13 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-02-06 09:19:48,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 93 transitions, 219 flow [2025-02-06 09:19:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:19:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:19:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-02-06 09:19:48,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2025-02-06 09:19:48,080 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 191 flow. Second operand 3 states and 253 transitions. [2025-02-06 09:19:48,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 93 transitions, 219 flow [2025-02-06 09:19:48,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:19:48,086 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 192 flow [2025-02-06 09:19:48,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2025-02-06 09:19:48,094 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2025-02-06 09:19:48,094 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 192 flow [2025-02-06 09:19:48,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-02-06 09:19:48,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:48,094 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] [2025-02-06 09:19:48,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:19:48,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:48,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash 516176373, now seen corresponding path program 1 times [2025-02-06 09:19:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401958015] [2025-02-06 09:19:48,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:48,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 09:19:48,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 09:19:48,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:48,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:48,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:48,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401958015] [2025-02-06 09:19:48,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401958015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:48,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:19:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576455153] [2025-02-06 09:19:48,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:48,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:19:48,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:48,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:19:48,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:19:48,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2025-02-06 09:19:48,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-02-06 09:19:48,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:48,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2025-02-06 09:19:48,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:48,254 INFO L124 PetriNetUnfolderBase]: 24/301 cut-off events. [2025-02-06 09:19:48,255 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:19:48,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 301 events. 24/301 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1301 event pairs, 24 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 343. Up to 61 conditions per place. [2025-02-06 09:19:48,258 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 13 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2025-02-06 09:19:48,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 212 flow [2025-02-06 09:19:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:19:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:19:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-02-06 09:19:48,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8736842105263158 [2025-02-06 09:19:48,262 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 192 flow. Second operand 3 states and 249 transitions. [2025-02-06 09:19:48,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 212 flow [2025-02-06 09:19:48,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:19:48,265 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 182 flow [2025-02-06 09:19:48,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-02-06 09:19:48,265 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -4 predicate places. [2025-02-06 09:19:48,266 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 182 flow [2025-02-06 09:19:48,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-02-06 09:19:48,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:48,266 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-02-06 09:19:48,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:19:48,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1710955369, now seen corresponding path program 1 times [2025-02-06 09:19:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365346644] [2025-02-06 09:19:48,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:48,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:19:48,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:19:48,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:48,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:48,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365346644] [2025-02-06 09:19:48,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365346644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:48,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:48,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879244253] [2025-02-06 09:19:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:48,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:48,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:48,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:48,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 95 [2025-02-06 09:19:48,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 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-02-06 09:19:48,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:48,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 95 [2025-02-06 09:19:48,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:49,100 INFO L124 PetriNetUnfolderBase]: 185/657 cut-off events. [2025-02-06 09:19:49,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:19:49,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 657 events. 185/657 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3576 event pairs, 52 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1036. Up to 246 conditions per place. [2025-02-06 09:19:49,106 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 47 selfloop transitions, 41 changer transitions 0/153 dead transitions. [2025-02-06 09:19:49,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 153 transitions, 486 flow [2025-02-06 09:19:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 515 transitions. [2025-02-06 09:19:49,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035087719298246 [2025-02-06 09:19:49,110 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 182 flow. Second operand 6 states and 515 transitions. [2025-02-06 09:19:49,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 153 transitions, 486 flow [2025-02-06 09:19:49,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 153 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:19:49,114 INFO L231 Difference]: Finished difference. Result has 102 places, 131 transitions, 439 flow [2025-02-06 09:19:49,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=102, PETRI_TRANSITIONS=131} [2025-02-06 09:19:49,115 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2025-02-06 09:19:49,115 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 131 transitions, 439 flow [2025-02-06 09:19:49,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 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-02-06 09:19:49,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:49,116 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] [2025-02-06 09:19:49,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:19:49,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:49,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1046660441, now seen corresponding path program 1 times [2025-02-06 09:19:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:49,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403069475] [2025-02-06 09:19:49,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:49,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:49,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 09:19:49,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 09:19:49,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:49,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:49,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:49,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403069475] [2025-02-06 09:19:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403069475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:49,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:49,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:49,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312413066] [2025-02-06 09:19:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:49,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:49,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:49,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:49,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2025-02-06 09:19:49,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 131 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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-02-06 09:19:49,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:49,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2025-02-06 09:19:49,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:49,644 INFO L124 PetriNetUnfolderBase]: 231/994 cut-off events. [2025-02-06 09:19:49,644 INFO L125 PetriNetUnfolderBase]: For 290/337 co-relation queries the response was YES. [2025-02-06 09:19:49,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 994 events. 231/994 cut-off events. For 290/337 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6851 event pairs, 25 based on Foata normal form. 26/987 useless extension candidates. Maximal degree in co-relation 2036. Up to 180 conditions per place. [2025-02-06 09:19:49,668 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 67 selfloop transitions, 32 changer transitions 0/190 dead transitions. [2025-02-06 09:19:49,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 190 transitions, 869 flow [2025-02-06 09:19:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2025-02-06 09:19:49,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9280701754385965 [2025-02-06 09:19:49,670 INFO L175 Difference]: Start difference. First operand has 102 places, 131 transitions, 439 flow. Second operand 6 states and 529 transitions. [2025-02-06 09:19:49,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 190 transitions, 869 flow [2025-02-06 09:19:49,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 190 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:19:49,679 INFO L231 Difference]: Finished difference. Result has 112 places, 161 transitions, 741 flow [2025-02-06 09:19:49,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=112, PETRI_TRANSITIONS=161} [2025-02-06 09:19:49,680 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 14 predicate places. [2025-02-06 09:19:49,680 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 161 transitions, 741 flow [2025-02-06 09:19:49,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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-02-06 09:19:49,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:49,680 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] [2025-02-06 09:19:49,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:19:49,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:49,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:49,681 INFO L85 PathProgramCache]: Analyzing trace with hash -815582347, now seen corresponding path program 1 times [2025-02-06 09:19:49,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:49,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464403931] [2025-02-06 09:19:49,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:49,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 09:19:49,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 09:19:49,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:49,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:49,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464403931] [2025-02-06 09:19:49,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464403931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:49,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:49,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:19:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098781090] [2025-02-06 09:19:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:49,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:19:49,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:49,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:19:49,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:19:49,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 95 [2025-02-06 09:19:49,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 161 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-02-06 09:19:49,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:49,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 95 [2025-02-06 09:19:49,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:49,780 INFO L124 PetriNetUnfolderBase]: 39/278 cut-off events. [2025-02-06 09:19:49,781 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-06 09:19:49,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 278 events. 39/278 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 981 event pairs, 4 based on Foata normal form. 2/267 useless extension candidates. Maximal degree in co-relation 485. Up to 64 conditions per place. [2025-02-06 09:19:49,783 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 2 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-02-06 09:19:49,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 375 flow [2025-02-06 09:19:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:19:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:19:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2025-02-06 09:19:49,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-06 09:19:49,784 INFO L175 Difference]: Start difference. First operand has 112 places, 161 transitions, 741 flow. Second operand 3 states and 275 transitions. [2025-02-06 09:19:49,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 375 flow [2025-02-06 09:19:49,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 333 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-02-06 09:19:49,789 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 329 flow [2025-02-06 09:19:49,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2025-02-06 09:19:49,791 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2025-02-06 09:19:49,792 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 329 flow [2025-02-06 09:19:49,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-02-06 09:19:49,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:49,792 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] [2025-02-06 09:19:49,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:19:49,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:49,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1231233553, now seen corresponding path program 1 times [2025-02-06 09:19:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:49,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123120190] [2025-02-06 09:19:49,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:49,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:49,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:19:49,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:19:49,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:49,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:50,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:50,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123120190] [2025-02-06 09:19:50,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123120190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:50,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:50,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:50,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148397049] [2025-02-06 09:19:50,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:50,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:50,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:50,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:50,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2025-02-06 09:19:50,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-02-06 09:19:50,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:50,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2025-02-06 09:19:50,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:50,272 INFO L124 PetriNetUnfolderBase]: 93/474 cut-off events. [2025-02-06 09:19:50,272 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-02-06 09:19:50,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 474 events. 93/474 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2168 event pairs, 20 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 867. Up to 153 conditions per place. [2025-02-06 09:19:50,274 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 34 selfloop transitions, 22 changer transitions 0/131 dead transitions. [2025-02-06 09:19:50,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 515 flow [2025-02-06 09:19:50,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2025-02-06 09:19:50,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8719298245614036 [2025-02-06 09:19:50,277 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 329 flow. Second operand 6 states and 497 transitions. [2025-02-06 09:19:50,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 515 flow [2025-02-06 09:19:50,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 131 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:19:50,282 INFO L231 Difference]: Finished difference. Result has 114 places, 131 transitions, 507 flow [2025-02-06 09:19:50,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=114, PETRI_TRANSITIONS=131} [2025-02-06 09:19:50,283 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 16 predicate places. [2025-02-06 09:19:50,283 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 131 transitions, 507 flow [2025-02-06 09:19:50,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-02-06 09:19:50,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:50,283 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] [2025-02-06 09:19:50,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:19:50,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:50,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash 66180112, now seen corresponding path program 1 times [2025-02-06 09:19:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:50,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072386774] [2025-02-06 09:19:50,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:50,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:50,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:19:50,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:19:50,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:50,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:50,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:50,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072386774] [2025-02-06 09:19:50,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072386774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:50,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:50,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:19:50,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636085601] [2025-02-06 09:19:50,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:50,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:19:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:50,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:19:50,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:19:50,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2025-02-06 09:19:50,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 131 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-02-06 09:19:50,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:50,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2025-02-06 09:19:50,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:50,747 INFO L124 PetriNetUnfolderBase]: 195/727 cut-off events. [2025-02-06 09:19:50,748 INFO L125 PetriNetUnfolderBase]: For 309/315 co-relation queries the response was YES. [2025-02-06 09:19:50,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 727 events. 195/727 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3997 event pairs, 12 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 1775. Up to 295 conditions per place. [2025-02-06 09:19:50,752 INFO L140 encePairwiseOnDemand]: 80/95 looper letters, 56 selfloop transitions, 52 changer transitions 11/188 dead transitions. [2025-02-06 09:19:50,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 188 transitions, 1014 flow [2025-02-06 09:19:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:19:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:19:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 501 transitions. [2025-02-06 09:19:50,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8789473684210526 [2025-02-06 09:19:50,754 INFO L175 Difference]: Start difference. First operand has 114 places, 131 transitions, 507 flow. Second operand 6 states and 501 transitions. [2025-02-06 09:19:50,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 188 transitions, 1014 flow [2025-02-06 09:19:50,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 188 transitions, 976 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-02-06 09:19:50,759 INFO L231 Difference]: Finished difference. Result has 124 places, 173 transitions, 931 flow [2025-02-06 09:19:50,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=124, PETRI_TRANSITIONS=173} [2025-02-06 09:19:50,760 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 26 predicate places. [2025-02-06 09:19:50,760 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 173 transitions, 931 flow [2025-02-06 09:19:50,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-02-06 09:19:50,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:50,760 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-02-06 09:19:50,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:19:50,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:50,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1062433916, now seen corresponding path program 1 times [2025-02-06 09:19:50,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:50,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893990163] [2025-02-06 09:19:50,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:50,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 09:19:50,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 09:19:50,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:50,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:51,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893990163] [2025-02-06 09:19:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893990163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:51,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:19:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119300757] [2025-02-06 09:19:51,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:51,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:19:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:51,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:19:51,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:19:51,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-06 09:19:51,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 173 transitions, 931 flow. Second operand has 10 states, 10 states have (on average 67.3) internal successors, (673), 10 states have internal predecessors, (673), 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-02-06 09:19:51,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:51,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-06 09:19:51,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:51,789 INFO L124 PetriNetUnfolderBase]: 188/692 cut-off events. [2025-02-06 09:19:51,789 INFO L125 PetriNetUnfolderBase]: For 726/756 co-relation queries the response was YES. [2025-02-06 09:19:51,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 692 events. 188/692 cut-off events. For 726/756 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3771 event pairs, 19 based on Foata normal form. 21/706 useless extension candidates. Maximal degree in co-relation 2073. Up to 132 conditions per place. [2025-02-06 09:19:51,793 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 88 selfloop transitions, 36 changer transitions 16/220 dead transitions. [2025-02-06 09:19:51,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 220 transitions, 1545 flow [2025-02-06 09:19:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:19:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:19:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 712 transitions. [2025-02-06 09:19:51,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7494736842105263 [2025-02-06 09:19:51,795 INFO L175 Difference]: Start difference. First operand has 124 places, 173 transitions, 931 flow. Second operand 10 states and 712 transitions. [2025-02-06 09:19:51,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 220 transitions, 1545 flow [2025-02-06 09:19:51,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 220 transitions, 1502 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-02-06 09:19:51,802 INFO L231 Difference]: Finished difference. Result has 138 places, 181 transitions, 1078 flow [2025-02-06 09:19:51,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1078, PETRI_PLACES=138, PETRI_TRANSITIONS=181} [2025-02-06 09:19:51,803 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 40 predicate places. [2025-02-06 09:19:51,803 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 181 transitions, 1078 flow [2025-02-06 09:19:51,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 67.3) internal successors, (673), 10 states have internal predecessors, (673), 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-02-06 09:19:51,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:51,804 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-02-06 09:19:51,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:19:51,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:51,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1942790807, now seen corresponding path program 1 times [2025-02-06 09:19:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251973516] [2025-02-06 09:19:51,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:51,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 09:19:51,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 09:19:51,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:51,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:52,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:52,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251973516] [2025-02-06 09:19:52,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251973516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:52,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:52,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:19:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336726626] [2025-02-06 09:19:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:52,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:19:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:52,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:19:52,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:19:52,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 95 [2025-02-06 09:19:52,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 181 transitions, 1078 flow. Second operand has 10 states, 10 states have (on average 68.7) internal successors, (687), 10 states have internal predecessors, (687), 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-02-06 09:19:52,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:52,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 95 [2025-02-06 09:19:52,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:52,691 INFO L124 PetriNetUnfolderBase]: 230/794 cut-off events. [2025-02-06 09:19:52,691 INFO L125 PetriNetUnfolderBase]: For 1366/1408 co-relation queries the response was YES. [2025-02-06 09:19:52,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 794 events. 230/794 cut-off events. For 1366/1408 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4580 event pairs, 8 based on Foata normal form. 28/818 useless extension candidates. Maximal degree in co-relation 2754. Up to 159 conditions per place. [2025-02-06 09:19:52,696 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 116 selfloop transitions, 67 changer transitions 17/263 dead transitions. [2025-02-06 09:19:52,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 263 transitions, 2090 flow [2025-02-06 09:19:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:19:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:19:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 706 transitions. [2025-02-06 09:19:52,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8257309941520468 [2025-02-06 09:19:52,698 INFO L175 Difference]: Start difference. First operand has 138 places, 181 transitions, 1078 flow. Second operand 9 states and 706 transitions. [2025-02-06 09:19:52,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 263 transitions, 2090 flow [2025-02-06 09:19:52,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 263 transitions, 2051 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-06 09:19:52,711 INFO L231 Difference]: Finished difference. Result has 144 places, 202 transitions, 1455 flow [2025-02-06 09:19:52,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1455, PETRI_PLACES=144, PETRI_TRANSITIONS=202} [2025-02-06 09:19:52,714 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 46 predicate places. [2025-02-06 09:19:52,714 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 202 transitions, 1455 flow [2025-02-06 09:19:52,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.7) internal successors, (687), 10 states have internal predecessors, (687), 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-02-06 09:19:52,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:52,716 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] [2025-02-06 09:19:52,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:19:52,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:52,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:52,716 INFO L85 PathProgramCache]: Analyzing trace with hash -669055055, now seen corresponding path program 1 times [2025-02-06 09:19:52,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:52,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335970801] [2025-02-06 09:19:52,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:52,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:52,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:19:52,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:19:52,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:52,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:53,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:53,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335970801] [2025-02-06 09:19:53,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335970801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:53,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:53,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:19:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289890783] [2025-02-06 09:19:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:53,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:19:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:53,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:19:53,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:19:53,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-06 09:19:53,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 202 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-02-06 09:19:53,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:53,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-06 09:19:53,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:53,642 INFO L124 PetriNetUnfolderBase]: 199/789 cut-off events. [2025-02-06 09:19:53,643 INFO L125 PetriNetUnfolderBase]: For 2244/2330 co-relation queries the response was YES. [2025-02-06 09:19:53,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 789 events. 199/789 cut-off events. For 2244/2330 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4682 event pairs, 21 based on Foata normal form. 43/825 useless extension candidates. Maximal degree in co-relation 2925. Up to 167 conditions per place. [2025-02-06 09:19:53,647 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 93 selfloop transitions, 36 changer transitions 6/229 dead transitions. [2025-02-06 09:19:53,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 229 transitions, 2041 flow [2025-02-06 09:19:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:19:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:19:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 772 transitions. [2025-02-06 09:19:53,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.738755980861244 [2025-02-06 09:19:53,649 INFO L175 Difference]: Start difference. First operand has 144 places, 202 transitions, 1455 flow. Second operand 11 states and 772 transitions. [2025-02-06 09:19:53,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 229 transitions, 2041 flow [2025-02-06 09:19:53,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 229 transitions, 1993 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-02-06 09:19:53,664 INFO L231 Difference]: Finished difference. Result has 152 places, 200 transitions, 1479 flow [2025-02-06 09:19:53,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1479, PETRI_PLACES=152, PETRI_TRANSITIONS=200} [2025-02-06 09:19:53,665 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 54 predicate places. [2025-02-06 09:19:53,665 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 200 transitions, 1479 flow [2025-02-06 09:19:53,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-02-06 09:19:53,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:53,667 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] [2025-02-06 09:19:53,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:19:53,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:53,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1780710223, now seen corresponding path program 2 times [2025-02-06 09:19:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:53,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096034626] [2025-02-06 09:19:53,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:19:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:53,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:19:53,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:19:53,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:19:53,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:54,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:54,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096034626] [2025-02-06 09:19:54,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096034626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:54,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:54,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:19:54,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467109758] [2025-02-06 09:19:54,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:54,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:19:54,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:54,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:19:54,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:19:54,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-06 09:19:54,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 200 transitions, 1479 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-02-06 09:19:54,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:54,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-06 09:19:54,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:54,491 INFO L124 PetriNetUnfolderBase]: 196/784 cut-off events. [2025-02-06 09:19:54,491 INFO L125 PetriNetUnfolderBase]: For 2430/2485 co-relation queries the response was YES. [2025-02-06 09:19:54,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2989 conditions, 784 events. 196/784 cut-off events. For 2430/2485 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4661 event pairs, 21 based on Foata normal form. 28/805 useless extension candidates. Maximal degree in co-relation 2956. Up to 167 conditions per place. [2025-02-06 09:19:54,496 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 93 selfloop transitions, 34 changer transitions 7/228 dead transitions. [2025-02-06 09:19:54,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 228 transitions, 2057 flow [2025-02-06 09:19:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:19:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:19:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 837 transitions. [2025-02-06 09:19:54,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7342105263157894 [2025-02-06 09:19:54,499 INFO L175 Difference]: Start difference. First operand has 152 places, 200 transitions, 1479 flow. Second operand 12 states and 837 transitions. [2025-02-06 09:19:54,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 228 transitions, 2057 flow [2025-02-06 09:19:54,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 228 transitions, 1975 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-02-06 09:19:54,512 INFO L231 Difference]: Finished difference. Result has 154 places, 198 transitions, 1455 flow [2025-02-06 09:19:54,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1455, PETRI_PLACES=154, PETRI_TRANSITIONS=198} [2025-02-06 09:19:54,513 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 56 predicate places. [2025-02-06 09:19:54,513 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 198 transitions, 1455 flow [2025-02-06 09:19:54,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-02-06 09:19:54,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:54,514 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] [2025-02-06 09:19:54,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:19:54,514 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:54,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash 259933901, now seen corresponding path program 3 times [2025-02-06 09:19:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827565191] [2025-02-06 09:19:54,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:19:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:54,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:19:54,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:19:54,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 09:19:54,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:54,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827565191] [2025-02-06 09:19:54,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827565191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:54,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:54,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:19:54,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984594161] [2025-02-06 09:19:54,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:54,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:19:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:54,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:19:54,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:19:55,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-06 09:19:55,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 198 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-02-06 09:19:55,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:55,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-06 09:19:55,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:55,526 INFO L124 PetriNetUnfolderBase]: 200/841 cut-off events. [2025-02-06 09:19:55,527 INFO L125 PetriNetUnfolderBase]: For 2498/2524 co-relation queries the response was YES. [2025-02-06 09:19:55,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 841 events. 200/841 cut-off events. For 2498/2524 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5204 event pairs, 21 based on Foata normal form. 13/847 useless extension candidates. Maximal degree in co-relation 3125. Up to 242 conditions per place. [2025-02-06 09:19:55,546 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 70 selfloop transitions, 42 changer transitions 12/218 dead transitions. [2025-02-06 09:19:55,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 218 transitions, 1896 flow [2025-02-06 09:19:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 09:19:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 09:19:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 911 transitions. [2025-02-06 09:19:55,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7376518218623481 [2025-02-06 09:19:55,549 INFO L175 Difference]: Start difference. First operand has 154 places, 198 transitions, 1455 flow. Second operand 13 states and 911 transitions. [2025-02-06 09:19:55,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 218 transitions, 1896 flow [2025-02-06 09:19:55,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 218 transitions, 1790 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-02-06 09:19:55,561 INFO L231 Difference]: Finished difference. Result has 159 places, 204 transitions, 1566 flow [2025-02-06 09:19:55,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1566, PETRI_PLACES=159, PETRI_TRANSITIONS=204} [2025-02-06 09:19:55,562 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 61 predicate places. [2025-02-06 09:19:55,562 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 204 transitions, 1566 flow [2025-02-06 09:19:55,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-02-06 09:19:55,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:55,562 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] [2025-02-06 09:19:55,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:19:55,562 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:55,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1315235461, now seen corresponding path program 4 times [2025-02-06 09:19:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:55,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046636398] [2025-02-06 09:19:55,563 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:19:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:55,572 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-02-06 09:19:55,575 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 66 of 69 statements. [2025-02-06 09:19:55,575 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 09:19:55,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:19:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:19:55,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:19:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046636398] [2025-02-06 09:19:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046636398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:19:55,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:19:55,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:19:55,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533157785] [2025-02-06 09:19:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:19:55,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:19:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:19:55,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:19:55,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:19:56,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-06 09:19:56,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 204 transitions, 1566 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-02-06 09:19:56,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:19:56,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-06 09:19:56,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:19:56,347 INFO L124 PetriNetUnfolderBase]: 197/827 cut-off events. [2025-02-06 09:19:56,348 INFO L125 PetriNetUnfolderBase]: For 2478/2503 co-relation queries the response was YES. [2025-02-06 09:19:56,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3148 conditions, 827 events. 197/827 cut-off events. For 2478/2503 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5097 event pairs, 21 based on Foata normal form. 13/833 useless extension candidates. Maximal degree in co-relation 3114. Up to 169 conditions per place. [2025-02-06 09:19:56,353 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 91 selfloop transitions, 37 changer transitions 7/229 dead transitions. [2025-02-06 09:19:56,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 229 transitions, 2122 flow [2025-02-06 09:19:56,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 09:19:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 09:19:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 898 transitions. [2025-02-06 09:19:56,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7271255060728745 [2025-02-06 09:19:56,356 INFO L175 Difference]: Start difference. First operand has 159 places, 204 transitions, 1566 flow. Second operand 13 states and 898 transitions. [2025-02-06 09:19:56,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 229 transitions, 2122 flow [2025-02-06 09:19:56,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 229 transitions, 2069 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-02-06 09:19:56,372 INFO L231 Difference]: Finished difference. Result has 158 places, 199 transitions, 1552 flow [2025-02-06 09:19:56,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1552, PETRI_PLACES=158, PETRI_TRANSITIONS=199} [2025-02-06 09:19:56,372 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 60 predicate places. [2025-02-06 09:19:56,373 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 199 transitions, 1552 flow [2025-02-06 09:19:56,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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-02-06 09:19:56,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:19:56,373 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] [2025-02-06 09:19:56,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:19:56,373 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-06 09:19:56,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:19:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1277476765, now seen corresponding path program 1 times [2025-02-06 09:19:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:19:56,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040344088] [2025-02-06 09:19:56,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:19:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:19:56,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 09:19:56,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 09:19:56,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:56,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:19:56,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:19:56,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 09:19:56,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 09:19:56,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:19:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:19:56,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:19:56,419 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:19:56,420 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-02-06 09:19:56,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-02-06 09:19:56,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-02-06 09:19:56,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-02-06 09:19:56,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-02-06 09:19:56,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-02-06 09:19:56,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-02-06 09:19:56,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-02-06 09:19:56,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-02-06 09:19:56,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-02-06 09:19:56,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-02-06 09:19:56,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-02-06 09:19:56,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-02-06 09:19:56,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-02-06 09:19:56,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:19:56,425 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:19:56,473 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:19:56,473 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:19:56,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:19:56 BasicIcfg [2025-02-06 09:19:56,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:19:56,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:19:56,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:19:56,480 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:19:56,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:19:47" (3/4) ... [2025-02-06 09:19:56,481 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 09:19:56,519 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-02-06 09:19:56,551 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:19:56,551 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:19:56,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:19:56,552 INFO L158 Benchmark]: Toolchain (without parser) took 9950.44ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 109.4MB in the beginning and 169.9MB in the end (delta: -60.5MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2025-02-06 09:19:56,552 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:19:56,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.10ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 72.2MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 09:19:56,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.03ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 70.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:19:56,554 INFO L158 Benchmark]: Boogie Preprocessor took 25.85ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 68.9MB in the end (delta: 908.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:19:56,554 INFO L158 Benchmark]: IcfgBuilder took 344.64ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 51.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:19:56,555 INFO L158 Benchmark]: TraceAbstraction took 8912.02ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 51.5MB in the beginning and 178.3MB in the end (delta: -126.8MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2025-02-06 09:19:56,555 INFO L158 Benchmark]: Witness Printer took 72.15ms. Allocated memory is still 335.5MB. Free memory was 178.3MB in the beginning and 169.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:19:56,557 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.14ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.10ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 72.2MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.03ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 70.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.85ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 68.9MB in the end (delta: 908.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 344.64ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 51.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8912.02ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 51.5MB in the beginning and 178.3MB in the end (delta: -126.8MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 72.15ms. Allocated memory is still 335.5MB. Free memory was 178.3MB in the beginning and 169.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1245]: Data race detected Data race detected The following path leads to a data race: [L1227] 0 data *d; VAL [d={0:0}] [L1228] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [d={0:0}, m={1:0}] [L1237] 0 pthread_t id; VAL [d={0:0}, m={1:0}] [L1238] 0 data *z; VAL [d={0:0}, m={1:0}] [L1239] 0 d = malloc(sizeof(data)) VAL [d={-2:0}, m={1:0}] [L1240] 0 z = d VAL [d={-2:0}, m={1:0}, z={-2:0}] [L1241] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] EXPR 0 d->x VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] 0 printf("%d\n",d->x) VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1231] EXPR 1 d->x VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1231] 1 d->x = 3 VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1245] EXPR 0 z->y VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1232] EXPR 1 d->y VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1232] 1 d->y = 8 VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1245] 0 printf("%d\n",z->y) VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: d->x = 3 [1231] * C: d->x = 3 [1231] * C: d->x = 3 [1231] * C: d = malloc(sizeof(data)) [1239] * C: d->y = 8 [1232] * C: d->x = 3 [1231] and C: printf("%d\n",z->y) [1245] - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 129 locations, 14 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: 8.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1464 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1060 mSDsluCounter, 425 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4788 IncrementalHoareTripleChecker+Invalid, 5288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 500 mSolverCounterUnsat, 64 mSDtfsCounter, 4788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1566occurred in iteration=12, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 740 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 4135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 09:19:56,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)