./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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/28-race_reach_51-mutexptr_racefree.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 f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:35:11,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:35:11,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:35:11,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:35:11,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:35:11,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:35:11,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:35:11,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:35:11,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:35:11,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:35:11,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:35:11,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:35:11,199 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:35:11,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:35:11,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:35:11,200 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:35:11,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:35:11,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:35:11,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:35:11,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:35:11,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:35:11,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:35:11,201 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:35:11,201 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:35:11,201 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:35:11,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:35:11,201 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:35:11,201 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:35:11,201 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:35:11,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:35:11,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:35:11,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:35:11,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:35:11,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:35:11,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:35:11,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:35:11,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:35:11,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:35:11,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:35:11,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:35:11,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:35:11,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:35:11,203 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 -> f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e [2025-02-08 05:35:11,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:35:11,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:35:11,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:35:11,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:35:11,470 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:35:11,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2025-02-08 05:35:12,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9a8e0c96/e4b1257d9e6944fdbe39b33386cff7a6/FLAG2e73c9cce [2025-02-08 05:35:12,966 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:35:12,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2025-02-08 05:35:12,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9a8e0c96/e4b1257d9e6944fdbe39b33386cff7a6/FLAG2e73c9cce [2025-02-08 05:35:13,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9a8e0c96/e4b1257d9e6944fdbe39b33386cff7a6 [2025-02-08 05:35:13,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:35:13,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:35:13,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:35:13,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:35:13,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:35:13,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4030de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13, skipping insertion in model container [2025-02-08 05:35:13,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:35:13,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:35:13,517 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:35:13,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:35:13,598 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:35:13,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13 WrapperNode [2025-02-08 05:35:13,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:35:13,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:35:13,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:35:13,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:35:13,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,627 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 160 [2025-02-08 05:35:13,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:35:13,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:35:13,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:35:13,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:35:13,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,643 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:35:13,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:35:13,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:35:13,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:35:13,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (1/1) ... [2025-02-08 05:35:13,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:35:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:35:13,681 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-08 05:35:13,683 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-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:35:13,698 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:35:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:35:13,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:35:13,699 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:35:13,802 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:35:13,804 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:35:14,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 05:35:14,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 05:35:14,129 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:35:14,130 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:35:14,162 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:35:14,162 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:35:14,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:35:14 BoogieIcfgContainer [2025-02-08 05:35:14,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:35:14,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:35:14,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:35:14,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:35:14,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:35:13" (1/3) ... [2025-02-08 05:35:14,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfdea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:35:14, skipping insertion in model container [2025-02-08 05:35:14,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:35:13" (2/3) ... [2025-02-08 05:35:14,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfdea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:35:14, skipping insertion in model container [2025-02-08 05:35:14,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:35:14" (3/3) ... [2025-02-08 05:35:14,173 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_51-mutexptr_racefree.i [2025-02-08 05:35:14,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:35:14,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_51-mutexptr_racefree.i that has 2 procedures, 240 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-02-08 05:35:14,186 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:35:14,255 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:35:14,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 251 transitions, 509 flow [2025-02-08 05:35:14,385 INFO L124 PetriNetUnfolderBase]: 15/324 cut-off events. [2025-02-08 05:35:14,387 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:35:14,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 324 events. 15/324 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 883 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 165. Up to 4 conditions per place. [2025-02-08 05:35:14,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 251 transitions, 509 flow [2025-02-08 05:35:14,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 251 transitions, 509 flow [2025-02-08 05:35:14,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:35:14,422 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;@fd9a9e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:35:14,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 05:35:14,444 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:35:14,444 INFO L124 PetriNetUnfolderBase]: 0/88 cut-off events. [2025-02-08 05:35:14,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:35:14,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:14,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:14,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:35:14,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1798166904, now seen corresponding path program 1 times [2025-02-08 05:35:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:14,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672892019] [2025-02-08 05:35:14,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:14,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:35:14,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:35:14,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:14,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:14,742 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-08 05:35:14,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:14,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672892019] [2025-02-08 05:35:14,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672892019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:14,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:14,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:35:14,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486896271] [2025-02-08 05:35:14,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:14,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:14,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:14,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:14,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 251 [2025-02-08 05:35:14,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 251 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-08 05:35:14,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:14,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 251 [2025-02-08 05:35:14,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:15,014 INFO L124 PetriNetUnfolderBase]: 73/921 cut-off events. [2025-02-08 05:35:15,014 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:35:15,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1103 conditions, 921 events. 73/921 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4550 event pairs, 72 based on Foata normal form. 91/924 useless extension candidates. Maximal degree in co-relation 918. Up to 175 conditions per place. [2025-02-08 05:35:15,023 INFO L140 encePairwiseOnDemand]: 238/251 looper letters, 22 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-02-08 05:35:15,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 238 transitions, 531 flow [2025-02-08 05:35:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 680 transitions. [2025-02-08 05:35:15,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9030544488711819 [2025-02-08 05:35:15,039 INFO L175 Difference]: Start difference. First operand has 243 places, 251 transitions, 509 flow. Second operand 3 states and 680 transitions. [2025-02-08 05:35:15,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 238 transitions, 531 flow [2025-02-08 05:35:15,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 238 transitions, 531 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:15,049 INFO L231 Difference]: Finished difference. Result has 242 places, 238 transitions, 487 flow [2025-02-08 05:35:15,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2025-02-08 05:35:15,056 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -1 predicate places. [2025-02-08 05:35:15,056 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 487 flow [2025-02-08 05:35:15,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-08 05:35:15,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:15,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:15,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:35:15,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:35:15,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash -9098614, now seen corresponding path program 1 times [2025-02-08 05:35:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:15,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067230149] [2025-02-08 05:35:15,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:15,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:15,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:35:15,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:35:15,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:15,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:15,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-08 05:35:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067230149] [2025-02-08 05:35:15,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067230149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:15,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:15,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:35:15,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905300498] [2025-02-08 05:35:15,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:15,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:15,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:15,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:15,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 251 [2025-02-08 05:35:15,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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-08 05:35:15,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:15,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 251 [2025-02-08 05:35:15,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:15,377 INFO L124 PetriNetUnfolderBase]: 48/733 cut-off events. [2025-02-08 05:35:15,377 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:35:15,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 733 events. 48/733 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3179 event pairs, 0 based on Foata normal form. 1/656 useless extension candidates. Maximal degree in co-relation 761. Up to 108 conditions per place. [2025-02-08 05:35:15,385 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 22 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2025-02-08 05:35:15,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 244 transitions, 547 flow [2025-02-08 05:35:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2025-02-08 05:35:15,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9176626826029216 [2025-02-08 05:35:15,389 INFO L175 Difference]: Start difference. First operand has 242 places, 238 transitions, 487 flow. Second operand 3 states and 691 transitions. [2025-02-08 05:35:15,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 244 transitions, 547 flow [2025-02-08 05:35:15,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 244 transitions, 543 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:35:15,396 INFO L231 Difference]: Finished difference. Result has 243 places, 238 transitions, 491 flow [2025-02-08 05:35:15,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=491, PETRI_PLACES=243, PETRI_TRANSITIONS=238} [2025-02-08 05:35:15,397 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 0 predicate places. [2025-02-08 05:35:15,398 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 238 transitions, 491 flow [2025-02-08 05:35:15,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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-08 05:35:15,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:15,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:15,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:35:15,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:35:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash -797569267, now seen corresponding path program 1 times [2025-02-08 05:35:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815679614] [2025-02-08 05:35:15,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:15,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:35:15,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:35:15,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:15,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:15,964 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-08 05:35:15,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:15,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815679614] [2025-02-08 05:35:15,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815679614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:15,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:35:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494981889] [2025-02-08 05:35:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:15,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:35:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:15,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:35:15,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:35:16,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 251 [2025-02-08 05:35:16,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 238 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 191.5) internal successors, (1149), 6 states have internal predecessors, (1149), 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-08 05:35:16,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:16,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 251 [2025-02-08 05:35:16,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:16,515 INFO L124 PetriNetUnfolderBase]: 578/2419 cut-off events. [2025-02-08 05:35:16,515 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 05:35:16,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3718 conditions, 2419 events. 578/2419 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 17010 event pairs, 372 based on Foata normal form. 0/2200 useless extension candidates. Maximal degree in co-relation 3548. Up to 1071 conditions per place. [2025-02-08 05:35:16,528 INFO L140 encePairwiseOnDemand]: 228/251 looper letters, 73 selfloop transitions, 70 changer transitions 0/331 dead transitions. [2025-02-08 05:35:16,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 331 transitions, 966 flow [2025-02-08 05:35:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:35:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:35:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2025-02-08 05:35:16,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.852589641434263 [2025-02-08 05:35:16,533 INFO L175 Difference]: Start difference. First operand has 243 places, 238 transitions, 491 flow. Second operand 6 states and 1284 transitions. [2025-02-08 05:35:16,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 331 transitions, 966 flow [2025-02-08 05:35:16,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 331 transitions, 960 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:35:16,544 INFO L231 Difference]: Finished difference. Result has 251 places, 307 transitions, 950 flow [2025-02-08 05:35:16,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=950, PETRI_PLACES=251, PETRI_TRANSITIONS=307} [2025-02-08 05:35:16,547 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 8 predicate places. [2025-02-08 05:35:16,547 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 307 transitions, 950 flow [2025-02-08 05:35:16,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.5) internal successors, (1149), 6 states have internal predecessors, (1149), 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-08 05:35:16,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:16,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:16,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:35:16,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:35:16,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:16,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1523480161, now seen corresponding path program 1 times [2025-02-08 05:35:16,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:16,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913381446] [2025-02-08 05:35:16,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:16,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:35:16,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:35:16,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:16,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:16,619 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-08 05:35:16,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:16,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913381446] [2025-02-08 05:35:16,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913381446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:16,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:16,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:35:16,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167227034] [2025-02-08 05:35:16,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:16,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:16,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:16,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:16,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:16,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 251 [2025-02-08 05:35:16,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 307 transitions, 950 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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-08 05:35:16,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:16,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 251 [2025-02-08 05:35:16,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:16,803 INFO L124 PetriNetUnfolderBase]: 245/1633 cut-off events. [2025-02-08 05:35:16,803 INFO L125 PetriNetUnfolderBase]: For 90/104 co-relation queries the response was YES. [2025-02-08 05:35:16,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2511 conditions, 1633 events. 245/1633 cut-off events. For 90/104 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 10643 event pairs, 110 based on Foata normal form. 0/1528 useless extension candidates. Maximal degree in co-relation 2348. Up to 299 conditions per place. [2025-02-08 05:35:16,811 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 25 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-02-08 05:35:16,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 303 transitions, 996 flow [2025-02-08 05:35:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2025-02-08 05:35:16,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8764940239043825 [2025-02-08 05:35:16,813 INFO L175 Difference]: Start difference. First operand has 251 places, 307 transitions, 950 flow. Second operand 3 states and 660 transitions. [2025-02-08 05:35:16,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 303 transitions, 996 flow [2025-02-08 05:35:16,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 303 transitions, 996 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:16,824 INFO L231 Difference]: Finished difference. Result has 248 places, 303 transitions, 952 flow [2025-02-08 05:35:16,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=248, PETRI_TRANSITIONS=303} [2025-02-08 05:35:16,825 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 5 predicate places. [2025-02-08 05:35:16,825 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 303 transitions, 952 flow [2025-02-08 05:35:16,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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-08 05:35:16,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:16,827 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:35:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:35:16,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:35:16,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1409473482, now seen corresponding path program 1 times [2025-02-08 05:35:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284003133] [2025-02-08 05:35:16,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:16,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:16,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:35:16,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:35:16,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:16,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:16,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:35:16,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:35:16,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:35:16,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:16,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:16,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:35:16,913 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:35:16,914 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-08 05:35:16,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-08 05:35:16,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-08 05:35:16,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-08 05:35:16,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-08 05:35:16,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-08 05:35:16,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-08 05:35:16,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-08 05:35:16,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-08 05:35:16,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-08 05:35:16,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-08 05:35:16,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-08 05:35:16,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-08 05:35:16,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-08 05:35:16,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-08 05:35:16,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-08 05:35:16,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-08 05:35:16,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-08 05:35:16,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-08 05:35:16,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-08 05:35:16,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-08 05:35:16,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-08 05:35:16,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:35:16,919 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 05:35:16,921 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:35:16,921 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:35:16,964 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:35:16,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 317 places, 330 transitions, 676 flow [2025-02-08 05:35:17,011 INFO L124 PetriNetUnfolderBase]: 27/503 cut-off events. [2025-02-08 05:35:17,012 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:35:17,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 503 events. 27/503 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1838 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 326. Up to 6 conditions per place. [2025-02-08 05:35:17,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 317 places, 330 transitions, 676 flow [2025-02-08 05:35:17,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 317 places, 330 transitions, 676 flow [2025-02-08 05:35:17,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:35:17,025 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;@fd9a9e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:35:17,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-08 05:35:17,030 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:35:17,031 INFO L124 PetriNetUnfolderBase]: 0/88 cut-off events. [2025-02-08 05:35:17,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:35:17,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:17,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:17,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:35:17,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1742234232, now seen corresponding path program 1 times [2025-02-08 05:35:17,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:17,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759443013] [2025-02-08 05:35:17,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:17,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:17,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:35:17,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:35:17,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:17,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:17,074 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-08 05:35:17,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759443013] [2025-02-08 05:35:17,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759443013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:17,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:17,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:35:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068753386] [2025-02-08 05:35:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:17,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:17,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:17,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:17,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 330 [2025-02-08 05:35:17,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 330 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 05:35:17,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:17,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 330 [2025-02-08 05:35:17,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:18,248 INFO L124 PetriNetUnfolderBase]: 1642/9617 cut-off events. [2025-02-08 05:35:18,249 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-02-08 05:35:18,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12350 conditions, 9617 events. 1642/9617 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 100311 event pairs, 1629 based on Foata normal form. 1568/10262 useless extension candidates. Maximal degree in co-relation 10971. Up to 2673 conditions per place. [2025-02-08 05:35:18,335 INFO L140 encePairwiseOnDemand]: 311/330 looper letters, 33 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-02-08 05:35:18,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 311 transitions, 708 flow [2025-02-08 05:35:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2025-02-08 05:35:18,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8919191919191919 [2025-02-08 05:35:18,337 INFO L175 Difference]: Start difference. First operand has 317 places, 330 transitions, 676 flow. Second operand 3 states and 883 transitions. [2025-02-08 05:35:18,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 311 transitions, 708 flow [2025-02-08 05:35:18,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 311 transitions, 708 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:18,342 INFO L231 Difference]: Finished difference. Result has 316 places, 311 transitions, 642 flow [2025-02-08 05:35:18,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=316, PETRI_TRANSITIONS=311} [2025-02-08 05:35:18,343 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, -1 predicate places. [2025-02-08 05:35:18,343 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 311 transitions, 642 flow [2025-02-08 05:35:18,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-08 05:35:18,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:18,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:18,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:35:18,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:35:18,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1526152940, now seen corresponding path program 1 times [2025-02-08 05:35:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:18,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531061243] [2025-02-08 05:35:18,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:18,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:35:18,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:35:18,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:18,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:18,388 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-08 05:35:18,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531061243] [2025-02-08 05:35:18,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531061243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:18,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:18,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:35:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221407952] [2025-02-08 05:35:18,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:18,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:18,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:18,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:18,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 330 [2025-02-08 05:35:18,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 311 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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-08 05:35:18,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:18,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 330 [2025-02-08 05:35:18,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:19,156 INFO L124 PetriNetUnfolderBase]: 788/5608 cut-off events. [2025-02-08 05:35:19,157 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-02-08 05:35:19,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6964 conditions, 5608 events. 788/5608 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 54464 event pairs, 774 based on Foata normal form. 1/4961 useless extension candidates. Maximal degree in co-relation 6867. Up to 1303 conditions per place. [2025-02-08 05:35:19,188 INFO L140 encePairwiseOnDemand]: 327/330 looper letters, 31 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-02-08 05:35:19,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 318 transitions, 722 flow [2025-02-08 05:35:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2025-02-08 05:35:19,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9040404040404041 [2025-02-08 05:35:19,191 INFO L175 Difference]: Start difference. First operand has 316 places, 311 transitions, 642 flow. Second operand 3 states and 895 transitions. [2025-02-08 05:35:19,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 318 transitions, 722 flow [2025-02-08 05:35:19,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 318 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:35:19,197 INFO L231 Difference]: Finished difference. Result has 317 places, 312 transitions, 650 flow [2025-02-08 05:35:19,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=317, PETRI_TRANSITIONS=312} [2025-02-08 05:35:19,198 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, 0 predicate places. [2025-02-08 05:35:19,198 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 312 transitions, 650 flow [2025-02-08 05:35:19,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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-08 05:35:19,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:19,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:19,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:35:19,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:35:19,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:19,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1820434903, now seen corresponding path program 1 times [2025-02-08 05:35:19,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:19,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363457159] [2025-02-08 05:35:19,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:19,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:19,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:35:19,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:35:19,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:19,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:19,557 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-08 05:35:19,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:19,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363457159] [2025-02-08 05:35:19,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363457159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:19,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:19,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:35:19,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633944400] [2025-02-08 05:35:19,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:19,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:35:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:19,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:35:19,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:35:19,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 330 [2025-02-08 05:35:19,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 312 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 240.5) internal successors, (1443), 6 states have internal predecessors, (1443), 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-08 05:35:19,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:19,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 330 [2025-02-08 05:35:19,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:27,322 INFO L124 PetriNetUnfolderBase]: 29144/71697 cut-off events. [2025-02-08 05:35:27,322 INFO L125 PetriNetUnfolderBase]: For 1369/1369 co-relation queries the response was YES. [2025-02-08 05:35:27,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117862 conditions, 71697 events. 29144/71697 cut-off events. For 1369/1369 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 829688 event pairs, 19147 based on Foata normal form. 0/66188 useless extension candidates. Maximal degree in co-relation 107753. Up to 40528 conditions per place. [2025-02-08 05:35:27,716 INFO L140 encePairwiseOnDemand]: 291/330 looper letters, 123 selfloop transitions, 135 changer transitions 0/495 dead transitions. [2025-02-08 05:35:27,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 495 transitions, 1542 flow [2025-02-08 05:35:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:35:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:35:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1691 transitions. [2025-02-08 05:35:27,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854040404040404 [2025-02-08 05:35:27,720 INFO L175 Difference]: Start difference. First operand has 317 places, 312 transitions, 650 flow. Second operand 6 states and 1691 transitions. [2025-02-08 05:35:27,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 495 transitions, 1542 flow [2025-02-08 05:35:27,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 495 transitions, 1539 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:35:27,732 INFO L231 Difference]: Finished difference. Result has 326 places, 446 transitions, 1538 flow [2025-02-08 05:35:27,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1538, PETRI_PLACES=326, PETRI_TRANSITIONS=446} [2025-02-08 05:35:27,734 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, 9 predicate places. [2025-02-08 05:35:27,734 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 446 transitions, 1538 flow [2025-02-08 05:35:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 240.5) internal successors, (1443), 6 states have internal predecessors, (1443), 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-08 05:35:27,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:27,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:27,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:35:27,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:35:27,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1465449790, now seen corresponding path program 1 times [2025-02-08 05:35:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413742174] [2025-02-08 05:35:27,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:27,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:35:27,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:35:27,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:27,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:27,775 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-08 05:35:27,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:27,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413742174] [2025-02-08 05:35:27,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413742174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:27,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:27,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:35:27,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013240450] [2025-02-08 05:35:27,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:27,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:27,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:27,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:27,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:27,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 330 [2025-02-08 05:35:27,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 446 transitions, 1538 flow. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 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-08 05:35:27,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:27,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 330 [2025-02-08 05:35:27,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:32,680 INFO L124 PetriNetUnfolderBase]: 15040/51266 cut-off events. [2025-02-08 05:35:32,680 INFO L125 PetriNetUnfolderBase]: For 4962/5602 co-relation queries the response was YES. [2025-02-08 05:35:32,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87603 conditions, 51266 events. 15040/51266 cut-off events. For 4962/5602 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 638078 event pairs, 8893 based on Foata normal form. 0/47578 useless extension candidates. Maximal degree in co-relation 80278. Up to 14985 conditions per place. [2025-02-08 05:35:33,034 INFO L140 encePairwiseOnDemand]: 318/330 looper letters, 40 selfloop transitions, 3 changer transitions 0/441 dead transitions. [2025-02-08 05:35:33,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 441 transitions, 1619 flow [2025-02-08 05:35:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:35:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:35:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 847 transitions. [2025-02-08 05:35:33,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2025-02-08 05:35:33,037 INFO L175 Difference]: Start difference. First operand has 326 places, 446 transitions, 1538 flow. Second operand 3 states and 847 transitions. [2025-02-08 05:35:33,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 441 transitions, 1619 flow [2025-02-08 05:35:33,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 441 transitions, 1619 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:33,162 INFO L231 Difference]: Finished difference. Result has 320 places, 440 transitions, 1541 flow [2025-02-08 05:35:33,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1541, PETRI_PLACES=320, PETRI_TRANSITIONS=440} [2025-02-08 05:35:33,163 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, 3 predicate places. [2025-02-08 05:35:33,163 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 440 transitions, 1541 flow [2025-02-08 05:35:33,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 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-08 05:35:33,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:33,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:33,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:35:33,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:35:33,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash -323084924, now seen corresponding path program 1 times [2025-02-08 05:35:33,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:33,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338099788] [2025-02-08 05:35:33,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:33,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:33,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:35:33,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:35:33,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:33,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:33,720 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-08 05:35:33,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:33,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338099788] [2025-02-08 05:35:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338099788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:33,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:33,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:35:33,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308774358] [2025-02-08 05:35:33,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:33,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:35:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:33,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:35:33,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:35:33,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 330 [2025-02-08 05:35:33,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 440 transitions, 1541 flow. Second operand has 6 states, 6 states have (on average 240.16666666666666) internal successors, (1441), 6 states have internal predecessors, (1441), 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-08 05:35:33,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:33,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 330 [2025-02-08 05:35:33,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:35:51,345 INFO L124 PetriNetUnfolderBase]: 69179/171545 cut-off events. [2025-02-08 05:35:51,345 INFO L125 PetriNetUnfolderBase]: For 41578/45587 co-relation queries the response was YES. [2025-02-08 05:35:52,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353183 conditions, 171545 events. 69179/171545 cut-off events. For 41578/45587 co-relation queries the response was YES. Maximal size of possible extension queue 2729. Compared 2207119 event pairs, 13429 based on Foata normal form. 32/161865 useless extension candidates. Maximal degree in co-relation 347359. Up to 47452 conditions per place. [2025-02-08 05:35:52,680 INFO L140 encePairwiseOnDemand]: 276/330 looper letters, 493 selfloop transitions, 227 changer transitions 0/954 dead transitions. [2025-02-08 05:35:52,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 954 transitions, 5257 flow [2025-02-08 05:35:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:35:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:35:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1795 transitions. [2025-02-08 05:35:52,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9065656565656566 [2025-02-08 05:35:52,684 INFO L175 Difference]: Start difference. First operand has 320 places, 440 transitions, 1541 flow. Second operand 6 states and 1795 transitions. [2025-02-08 05:35:52,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 954 transitions, 5257 flow [2025-02-08 05:35:52,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 954 transitions, 5257 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:35:53,004 INFO L231 Difference]: Finished difference. Result has 330 places, 679 transitions, 3917 flow [2025-02-08 05:35:53,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3917, PETRI_PLACES=330, PETRI_TRANSITIONS=679} [2025-02-08 05:35:53,006 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, 13 predicate places. [2025-02-08 05:35:53,006 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 679 transitions, 3917 flow [2025-02-08 05:35:53,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 240.16666666666666) internal successors, (1441), 6 states have internal predecessors, (1441), 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-08 05:35:53,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:53,007 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:35:53,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:35:53,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:35:53,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash -3599012, now seen corresponding path program 1 times [2025-02-08 05:35:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:53,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848078986] [2025-02-08 05:35:53,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:53,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 05:35:53,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:35:53,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:53,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:53,035 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:35:53,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 05:35:53,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 05:35:53,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:53,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:35:53,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:35:53,071 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:35:53,071 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-02-08 05:35:53,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-02-08 05:35:53,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-02-08 05:35:53,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-02-08 05:35:53,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-02-08 05:35:53,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-02-08 05:35:53,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-02-08 05:35:53,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-02-08 05:35:53,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-02-08 05:35:53,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-02-08 05:35:53,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-02-08 05:35:53,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-02-08 05:35:53,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-02-08 05:35:53,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-02-08 05:35:53,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:35:53,073 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:35:53,073 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:35:53,074 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:35:53,105 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:35:53,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 391 places, 409 transitions, 845 flow [2025-02-08 05:35:53,170 INFO L124 PetriNetUnfolderBase]: 42/725 cut-off events. [2025-02-08 05:35:53,170 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 05:35:53,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 725 events. 42/725 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3031 event pairs, 1 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 511. Up to 12 conditions per place. [2025-02-08 05:35:53,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 391 places, 409 transitions, 845 flow [2025-02-08 05:35:53,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 409 transitions, 845 flow [2025-02-08 05:35:53,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:35:53,182 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;@fd9a9e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:35:53,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-02-08 05:35:53,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:35:53,185 INFO L124 PetriNetUnfolderBase]: 0/88 cut-off events. [2025-02-08 05:35:53,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:35:53,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:35:53,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:35:53,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-08 05:35:53,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:35:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1126279416, now seen corresponding path program 1 times [2025-02-08 05:35:53,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:35:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169413515] [2025-02-08 05:35:53,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:35:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:35:53,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:35:53,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:35:53,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:35:53,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:35:53,210 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-08 05:35:53,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:35:53,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169413515] [2025-02-08 05:35:53,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169413515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:35:53,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:35:53,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:35:53,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772885981] [2025-02-08 05:35:53,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:35:53,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:35:53,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:35:53,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:35:53,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:35:53,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 409 [2025-02-08 05:35:53,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 409 transitions, 845 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 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-08 05:35:53,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:35:53,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 409 [2025-02-08 05:35:53,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand