./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:02:00,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:02:00,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:02:00,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:02:00,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:02:00,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:02:00,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:02:00,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:02:00,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:02:00,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:02:00,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:02:00,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:02:00,113 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:02:00,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:02:00,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:02:00,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:02:00,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:02:00,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:02:00,115 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f [2025-03-08 22:02:00,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:02:00,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:02:00,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:02:00,357 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:02:00,358 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:02:00,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2025-03-08 22:02:00,775 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f77c07c0/2a69aa01d9f540e7931245fbf2169bda/FLAG764854d47 [2025-03-08 22:02:01,968 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:02:01,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2025-03-08 22:02:02,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f77c07c0/2a69aa01d9f540e7931245fbf2169bda/FLAG764854d47 [2025-03-08 22:02:03,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f77c07c0/2a69aa01d9f540e7931245fbf2169bda [2025-03-08 22:02:03,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:02:03,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:02:03,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:02:03,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:02:03,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:02:03,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5438c457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03, skipping insertion in model container [2025-03-08 22:02:03,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:02:03,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:02:03,413 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:02:03,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:02:03,483 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:02:03,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03 WrapperNode [2025-03-08 22:02:03,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:02:03,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:02:03,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:02:03,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:02:03,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,519 INFO L138 Inliner]: procedures = 252, calls = 52, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 164 [2025-03-08 22:02:03,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:02:03,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:02:03,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:02:03,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:02:03,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:02:03,540 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:02:03,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:02:03,542 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:02:03,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (1/1) ... [2025-03-08 22:02:03,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:02:03,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:02:03,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:02:03,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:02:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:02:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:02:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:02:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:02:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:02:03,592 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:02:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:02:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:02:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:02:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:02:03,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:02:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:02:03,594 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:02:03,698 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:02:03,699 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:02:03,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 22:02:03,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L911-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-08 22:02:03,898 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:02:03,898 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:02:03,927 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:02:03,930 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:02:03,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:02:03 BoogieIcfgContainer [2025-03-08 22:02:03,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:02:03,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:02:03,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:02:03,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:02:03,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:02:03" (1/3) ... [2025-03-08 22:02:03,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1293fc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:02:03, skipping insertion in model container [2025-03-08 22:02:03,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:03" (2/3) ... [2025-03-08 22:02:03,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1293fc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:02:03, skipping insertion in model container [2025-03-08 22:02:03,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:02:03" (3/3) ... [2025-03-08 22:02:03,938 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2025-03-08 22:02:03,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:02:03,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_28-funptr_racefree.i that has 2 procedures, 157 locations, 1 initial locations, 5 loop locations, and 9 error locations. [2025-03-08 22:02:03,950 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:02:04,013 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:02:04,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 168 transitions, 343 flow [2025-03-08 22:02:04,152 INFO L124 PetriNetUnfolderBase]: 15/235 cut-off events. [2025-03-08 22:02:04,154 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:02:04,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 235 events. 15/235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 726 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 129. Up to 4 conditions per place. [2025-03-08 22:02:04,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 168 transitions, 343 flow [2025-03-08 22:02:04,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 343 flow [2025-03-08 22:02:04,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:04,183 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;@65ddc4fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:04,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-08 22:02:04,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:04,200 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-03-08 22:02:04,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:04,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:04,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:04,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:02:04,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash 104702838, now seen corresponding path program 1 times [2025-03-08 22:02:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:04,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118830613] [2025-03-08 22:02:04,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:04,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:04,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:02:04,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:02:04,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:04,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118830613] [2025-03-08 22:02:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118830613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:04,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:04,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522025122] [2025-03-08 22:02:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:04,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:04,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:04,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:04,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:04,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2025-03-08 22:02:04,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 168 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:04,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:04,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2025-03-08 22:02:04,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:04,661 INFO L124 PetriNetUnfolderBase]: 80/775 cut-off events. [2025-03-08 22:02:04,661 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:02:04,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 775 events. 80/775 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4396 event pairs, 0 based on Foata normal form. 61/767 useless extension candidates. Maximal degree in co-relation 879. Up to 174 conditions per place. [2025-03-08 22:02:04,670 INFO L140 encePairwiseOnDemand]: 155/168 looper letters, 28 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-03-08 22:02:04,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 395 flow [2025-03-08 22:02:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2025-03-08 22:02:04,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8968253968253969 [2025-03-08 22:02:04,686 INFO L175 Difference]: Start difference. First operand has 160 places, 168 transitions, 343 flow. Second operand 3 states and 452 transitions. [2025-03-08 22:02:04,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 395 flow [2025-03-08 22:02:04,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:04,695 INFO L231 Difference]: Finished difference. Result has 161 places, 156 transitions, 327 flow [2025-03-08 22:02:04,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=161, PETRI_TRANSITIONS=156} [2025-03-08 22:02:04,700 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2025-03-08 22:02:04,701 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 327 flow [2025-03-08 22:02:04,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:04,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:04,702 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] [2025-03-08 22:02:04,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:02:04,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:02:04,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash 733260672, now seen corresponding path program 1 times [2025-03-08 22:02:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938262391] [2025-03-08 22:02:04,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:04,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:02:04,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:02:04,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:04,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:05,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938262391] [2025-03-08 22:02:05,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938262391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:05,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:05,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:05,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533783132] [2025-03-08 22:02:05,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:05,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:05,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:05,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:05,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:05,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 168 [2025-03-08 22:02:05,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:05,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:05,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 168 [2025-03-08 22:02:05,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:05,473 INFO L124 PetriNetUnfolderBase]: 160/924 cut-off events. [2025-03-08 22:02:05,473 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-08 22:02:05,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 924 events. 160/924 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5837 event pairs, 11 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 1229. Up to 267 conditions per place. [2025-03-08 22:02:05,481 INFO L140 encePairwiseOnDemand]: 162/168 looper letters, 60 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-03-08 22:02:05,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 187 transitions, 519 flow [2025-03-08 22:02:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 804 transitions. [2025-03-08 22:02:05,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7976190476190477 [2025-03-08 22:02:05,486 INFO L175 Difference]: Start difference. First operand has 161 places, 156 transitions, 327 flow. Second operand 6 states and 804 transitions. [2025-03-08 22:02:05,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 187 transitions, 519 flow [2025-03-08 22:02:05,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 187 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:05,489 INFO L231 Difference]: Finished difference. Result has 163 places, 155 transitions, 331 flow [2025-03-08 22:02:05,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=163, PETRI_TRANSITIONS=155} [2025-03-08 22:02:05,490 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 3 predicate places. [2025-03-08 22:02:05,491 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 155 transitions, 331 flow [2025-03-08 22:02:05,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:05,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:05,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:05,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:02:05,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:02:05,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2056584363, now seen corresponding path program 1 times [2025-03-08 22:02:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:05,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853234459] [2025-03-08 22:02:05,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:05,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:02:05,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:02:05,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853234459] [2025-03-08 22:02:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853234459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:05,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911817567] [2025-03-08 22:02:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:05,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:05,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:05,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:05,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 168 [2025-03-08 22:02:05,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 155 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:05,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:05,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 168 [2025-03-08 22:02:05,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:05,684 INFO L124 PetriNetUnfolderBase]: 114/1086 cut-off events. [2025-03-08 22:02:05,685 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:02:05,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 1086 events. 114/1086 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7027 event pairs, 28 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 1300. Up to 133 conditions per place. [2025-03-08 22:02:05,690 INFO L140 encePairwiseOnDemand]: 164/168 looper letters, 33 selfloop transitions, 3 changer transitions 0/171 dead transitions. [2025-03-08 22:02:05,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 171 transitions, 438 flow [2025-03-08 22:02:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2025-03-08 22:02:05,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-03-08 22:02:05,693 INFO L175 Difference]: Start difference. First operand has 163 places, 155 transitions, 331 flow. Second operand 3 states and 448 transitions. [2025-03-08 22:02:05,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 171 transitions, 438 flow [2025-03-08 22:02:05,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 171 transitions, 428 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:02:05,720 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 343 flow [2025-03-08 22:02:05,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2025-03-08 22:02:05,721 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 2 predicate places. [2025-03-08 22:02:05,721 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 343 flow [2025-03-08 22:02:05,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:05,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:05,721 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] [2025-03-08 22:02:05,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:02:05,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:02:05,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1053293126, now seen corresponding path program 1 times [2025-03-08 22:02:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:05,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675043221] [2025-03-08 22:02:05,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:05,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:05,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:02:05,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:02:05,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:05,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675043221] [2025-03-08 22:02:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675043221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:05,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:05,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148560973] [2025-03-08 22:02:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:02:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:05,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:02:05,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:02:05,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 168 [2025-03-08 22:02:05,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 343 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:05,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:05,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 168 [2025-03-08 22:02:05,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:05,919 INFO L124 PetriNetUnfolderBase]: 24/207 cut-off events. [2025-03-08 22:02:05,919 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 22:02:05,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 207 events. 24/207 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 398 event pairs, 0 based on Foata normal form. 9/208 useless extension candidates. Maximal degree in co-relation 232. Up to 17 conditions per place. [2025-03-08 22:02:05,920 INFO L140 encePairwiseOnDemand]: 163/168 looper letters, 34 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2025-03-08 22:02:05,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 124 transitions, 336 flow [2025-03-08 22:02:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 837 transitions. [2025-03-08 22:02:05,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8303571428571429 [2025-03-08 22:02:05,922 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 343 flow. Second operand 6 states and 837 transitions. [2025-03-08 22:02:05,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 124 transitions, 336 flow [2025-03-08 22:02:05,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 124 transitions, 329 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-08 22:02:05,928 INFO L231 Difference]: Finished difference. Result has 109 places, 100 transitions, 213 flow [2025-03-08 22:02:05,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=109, PETRI_TRANSITIONS=100} [2025-03-08 22:02:05,928 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -51 predicate places. [2025-03-08 22:02:05,928 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 100 transitions, 213 flow [2025-03-08 22:02:05,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:05,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:05,929 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] [2025-03-08 22:02:05,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:02:05,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-08 22:02:05,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash -175293098, now seen corresponding path program 1 times [2025-03-08 22:02:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564283454] [2025-03-08 22:02:05,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:05,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:02:05,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:02:05,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:05,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:02:05,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:02:05,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:02:05,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:05,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:02:05,985 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:02:05,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-08 22:02:05,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-08 22:02:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-08 22:02:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-08 22:02:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-08 22:02:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-08 22:02:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-03-08 22:02:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-08 22:02:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-08 22:02:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-08 22:02:05,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-08 22:02:05,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-08 22:02:05,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-08 22:02:05,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-08 22:02:05,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-08 22:02:05,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:02:05,990 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 22:02:05,992 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:02:05,992 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:02:06,020 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:02:06,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 229 transitions, 474 flow [2025-03-08 22:02:06,056 INFO L124 PetriNetUnfolderBase]: 27/390 cut-off events. [2025-03-08 22:02:06,056 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:02:06,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 390 events. 27/390 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1444 event pairs, 0 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 237. Up to 6 conditions per place. [2025-03-08 22:02:06,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 229 transitions, 474 flow [2025-03-08 22:02:06,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 229 transitions, 474 flow [2025-03-08 22:02:06,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:06,066 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;@65ddc4fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:06,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-08 22:02:06,070 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:06,071 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-03-08 22:02:06,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:06,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:06,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:06,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1194960859, now seen corresponding path program 1 times [2025-03-08 22:02:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:06,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128052327] [2025-03-08 22:02:06,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:06,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:02:06,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:02:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:06,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128052327] [2025-03-08 22:02:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128052327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:06,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:06,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639956398] [2025-03-08 22:02:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:06,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:06,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:06,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:06,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:06,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 229 [2025-03-08 22:02:06,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 229 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:06,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:06,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 229 [2025-03-08 22:02:06,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:06,945 INFO L124 PetriNetUnfolderBase]: 1626/8198 cut-off events. [2025-03-08 22:02:06,945 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-03-08 22:02:06,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10889 conditions, 8198 events. 1626/8198 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 86812 event pairs, 736 based on Foata normal form. 898/8352 useless extension candidates. Maximal degree in co-relation 1123. Up to 2629 conditions per place. [2025-03-08 22:02:06,984 INFO L140 encePairwiseOnDemand]: 210/229 looper letters, 39 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-08 22:02:06,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 220 transitions, 538 flow [2025-03-08 22:02:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2025-03-08 22:02:06,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8791848617176128 [2025-03-08 22:02:06,987 INFO L175 Difference]: Start difference. First operand has 216 places, 229 transitions, 474 flow. Second operand 3 states and 604 transitions. [2025-03-08 22:02:06,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 220 transitions, 538 flow [2025-03-08 22:02:06,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 220 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:06,991 INFO L231 Difference]: Finished difference. Result has 217 places, 212 transitions, 450 flow [2025-03-08 22:02:06,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=217, PETRI_TRANSITIONS=212} [2025-03-08 22:02:06,993 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, 1 predicate places. [2025-03-08 22:02:06,994 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 212 transitions, 450 flow [2025-03-08 22:02:06,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:06,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:06,994 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] [2025-03-08 22:02:06,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:02:06,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash 499205957, now seen corresponding path program 1 times [2025-03-08 22:02:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:06,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574191159] [2025-03-08 22:02:06,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:07,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:02:07,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:02:07,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:07,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:07,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574191159] [2025-03-08 22:02:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574191159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:07,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:07,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459488167] [2025-03-08 22:02:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:07,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:07,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:07,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:07,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:07,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 229 [2025-03-08 22:02:07,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 212 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:07,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:07,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 229 [2025-03-08 22:02:07,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:08,506 INFO L124 PetriNetUnfolderBase]: 3186/12298 cut-off events. [2025-03-08 22:02:08,507 INFO L125 PetriNetUnfolderBase]: For 207/234 co-relation queries the response was YES. [2025-03-08 22:02:08,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17622 conditions, 12298 events. 3186/12298 cut-off events. For 207/234 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 134720 event pairs, 1614 based on Foata normal form. 0/11198 useless extension candidates. Maximal degree in co-relation 9405. Up to 3779 conditions per place. [2025-03-08 22:02:08,576 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 102 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2025-03-08 22:02:08,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 275 transitions, 792 flow [2025-03-08 22:02:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1116 transitions. [2025-03-08 22:02:08,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8122270742358079 [2025-03-08 22:02:08,579 INFO L175 Difference]: Start difference. First operand has 217 places, 212 transitions, 450 flow. Second operand 6 states and 1116 transitions. [2025-03-08 22:02:08,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 275 transitions, 792 flow [2025-03-08 22:02:08,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 275 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:08,585 INFO L231 Difference]: Finished difference. Result has 220 places, 211 transitions, 458 flow [2025-03-08 22:02:08,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=458, PETRI_PLACES=220, PETRI_TRANSITIONS=211} [2025-03-08 22:02:08,587 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, 4 predicate places. [2025-03-08 22:02:08,587 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 211 transitions, 458 flow [2025-03-08 22:02:08,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:08,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:08,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:08,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:02:08,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:08,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1068855226, now seen corresponding path program 1 times [2025-03-08 22:02:08,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:08,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865489097] [2025-03-08 22:02:08,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:08,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:08,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:02:08,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:02:08,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:08,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:08,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865489097] [2025-03-08 22:02:08,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865489097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:08,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566133924] [2025-03-08 22:02:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:08,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:08,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:08,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:08,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:08,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 229 [2025-03-08 22:02:08,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 211 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:08,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:08,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 229 [2025-03-08 22:02:08,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:10,029 INFO L124 PetriNetUnfolderBase]: 3294/15685 cut-off events. [2025-03-08 22:02:10,030 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2025-03-08 22:02:10,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21202 conditions, 15685 events. 3294/15685 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 186997 event pairs, 1268 based on Foata normal form. 0/14070 useless extension candidates. Maximal degree in co-relation 15278. Up to 3072 conditions per place. [2025-03-08 22:02:10,102 INFO L140 encePairwiseOnDemand]: 222/229 looper letters, 58 selfloop transitions, 5 changer transitions 0/241 dead transitions. [2025-03-08 22:02:10,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 241 transitions, 655 flow [2025-03-08 22:02:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2025-03-08 22:02:10,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.87627365356623 [2025-03-08 22:02:10,104 INFO L175 Difference]: Start difference. First operand has 220 places, 211 transitions, 458 flow. Second operand 3 states and 602 transitions. [2025-03-08 22:02:10,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 241 transitions, 655 flow [2025-03-08 22:02:10,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 241 transitions, 643 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:02:10,107 INFO L231 Difference]: Finished difference. Result has 219 places, 216 transitions, 490 flow [2025-03-08 22:02:10,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=219, PETRI_TRANSITIONS=216} [2025-03-08 22:02:10,108 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, 3 predicate places. [2025-03-08 22:02:10,108 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 216 transitions, 490 flow [2025-03-08 22:02:10,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:10,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:10,109 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] [2025-03-08 22:02:10,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:02:10,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:10,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:10,110 INFO L85 PathProgramCache]: Analyzing trace with hash 807143216, now seen corresponding path program 1 times [2025-03-08 22:02:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:10,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124664975] [2025-03-08 22:02:10,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:10,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:02:10,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:02:10,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:10,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:10,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124664975] [2025-03-08 22:02:10,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124664975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:10,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:10,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:10,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548748558] [2025-03-08 22:02:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:10,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:02:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:10,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:02:10,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:02:10,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 229 [2025-03-08 22:02:10,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 216 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:10,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:10,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 229 [2025-03-08 22:02:10,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:11,902 INFO L124 PetriNetUnfolderBase]: 3460/17720 cut-off events. [2025-03-08 22:02:11,902 INFO L125 PetriNetUnfolderBase]: For 433/441 co-relation queries the response was YES. [2025-03-08 22:02:11,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24231 conditions, 17720 events. 3460/17720 cut-off events. For 433/441 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 219617 event pairs, 1720 based on Foata normal form. 9/15896 useless extension candidates. Maximal degree in co-relation 7907. Up to 5220 conditions per place. [2025-03-08 22:02:11,955 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 72 selfloop transitions, 5 changer transitions 0/258 dead transitions. [2025-03-08 22:02:11,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 258 transitions, 728 flow [2025-03-08 22:02:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1146 transitions. [2025-03-08 22:02:11,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.834061135371179 [2025-03-08 22:02:11,958 INFO L175 Difference]: Start difference. First operand has 219 places, 216 transitions, 490 flow. Second operand 6 states and 1146 transitions. [2025-03-08 22:02:11,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 258 transitions, 728 flow [2025-03-08 22:02:11,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 258 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:11,963 INFO L231 Difference]: Finished difference. Result has 225 places, 218 transitions, 506 flow [2025-03-08 22:02:11,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=225, PETRI_TRANSITIONS=218} [2025-03-08 22:02:11,963 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, 9 predicate places. [2025-03-08 22:02:11,963 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 218 transitions, 506 flow [2025-03-08 22:02:11,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:11,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:11,964 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] [2025-03-08 22:02:11,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:02:11,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:11,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash -539006820, now seen corresponding path program 1 times [2025-03-08 22:02:11,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:11,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015901825] [2025-03-08 22:02:11,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:11,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 22:02:11,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 22:02:11,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:11,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:11,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015901825] [2025-03-08 22:02:11,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015901825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:11,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:11,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706763082] [2025-03-08 22:02:11,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:11,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:11,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:11,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:12,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 229 [2025-03-08 22:02:12,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 218 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:12,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:12,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 229 [2025-03-08 22:02:12,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:16,131 INFO L124 PetriNetUnfolderBase]: 12271/50016 cut-off events. [2025-03-08 22:02:16,132 INFO L125 PetriNetUnfolderBase]: For 533/533 co-relation queries the response was YES. [2025-03-08 22:02:16,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70759 conditions, 50016 events. 12271/50016 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 695738 event pairs, 5189 based on Foata normal form. 0/45319 useless extension candidates. Maximal degree in co-relation 70540. Up to 10701 conditions per place. [2025-03-08 22:02:16,414 INFO L140 encePairwiseOnDemand]: 210/229 looper letters, 70 selfloop transitions, 14 changer transitions 0/257 dead transitions. [2025-03-08 22:02:16,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 257 transitions, 763 flow [2025-03-08 22:02:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2025-03-08 22:02:16,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.858806404657933 [2025-03-08 22:02:16,415 INFO L175 Difference]: Start difference. First operand has 225 places, 218 transitions, 506 flow. Second operand 3 states and 590 transitions. [2025-03-08 22:02:16,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 257 transitions, 763 flow [2025-03-08 22:02:16,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 257 transitions, 757 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:16,421 INFO L231 Difference]: Finished difference. Result has 227 places, 232 transitions, 622 flow [2025-03-08 22:02:16,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=227, PETRI_TRANSITIONS=232} [2025-03-08 22:02:16,422 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, 11 predicate places. [2025-03-08 22:02:16,422 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 232 transitions, 622 flow [2025-03-08 22:02:16,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:16,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:16,422 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] [2025-03-08 22:02:16,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:02:16,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:16,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash -648899717, now seen corresponding path program 1 times [2025-03-08 22:02:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:16,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539916858] [2025-03-08 22:02:16,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:16,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 22:02:16,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 22:02:16,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:16,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:16,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539916858] [2025-03-08 22:02:16,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539916858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:16,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:16,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:16,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690238856] [2025-03-08 22:02:16,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:16,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:16,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:16,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:16,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:16,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 229 [2025-03-08 22:02:16,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 232 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:16,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:16,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 229 [2025-03-08 22:02:16,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:21,339 INFO L124 PetriNetUnfolderBase]: 13303/59511 cut-off events. [2025-03-08 22:02:21,339 INFO L125 PetriNetUnfolderBase]: For 12127/12587 co-relation queries the response was YES. [2025-03-08 22:02:21,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93234 conditions, 59511 events. 13303/59511 cut-off events. For 12127/12587 co-relation queries the response was YES. Maximal size of possible extension queue 1295. Compared 871316 event pairs, 9477 based on Foata normal form. 100/54514 useless extension candidates. Maximal degree in co-relation 92988. Up to 18925 conditions per place. [2025-03-08 22:02:21,698 INFO L140 encePairwiseOnDemand]: 220/229 looper letters, 64 selfloop transitions, 14 changer transitions 0/260 dead transitions. [2025-03-08 22:02:21,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 260 transitions, 872 flow [2025-03-08 22:02:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions. [2025-03-08 22:02:21,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8413391557496361 [2025-03-08 22:02:21,700 INFO L175 Difference]: Start difference. First operand has 227 places, 232 transitions, 622 flow. Second operand 3 states and 578 transitions. [2025-03-08 22:02:21,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 260 transitions, 872 flow [2025-03-08 22:02:21,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 260 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:21,723 INFO L231 Difference]: Finished difference. Result has 229 places, 244 transitions, 720 flow [2025-03-08 22:02:21,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=229, PETRI_TRANSITIONS=244} [2025-03-08 22:02:21,723 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, 13 predicate places. [2025-03-08 22:02:21,723 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 244 transitions, 720 flow [2025-03-08 22:02:21,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:21,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:21,724 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-08 22:02:21,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:02:21,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:21,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 796398372, now seen corresponding path program 1 times [2025-03-08 22:02:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:21,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814900515] [2025-03-08 22:02:21,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:21,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:02:21,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:02:21,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:21,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:21,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:21,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814900515] [2025-03-08 22:02:21,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814900515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:21,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:21,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956067169] [2025-03-08 22:02:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:21,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:21,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:21,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:21,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:21,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 229 [2025-03-08 22:02:21,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 244 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:21,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:21,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 229 [2025-03-08 22:02:21,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:26,641 INFO L124 PetriNetUnfolderBase]: 10584/57137 cut-off events. [2025-03-08 22:02:26,641 INFO L125 PetriNetUnfolderBase]: For 4776/5806 co-relation queries the response was YES. [2025-03-08 22:02:26,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82744 conditions, 57137 events. 10584/57137 cut-off events. For 4776/5806 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 869063 event pairs, 7185 based on Foata normal form. 33/51258 useless extension candidates. Maximal degree in co-relation 82543. Up to 13271 conditions per place. [2025-03-08 22:02:26,968 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 52 selfloop transitions, 8 changer transitions 0/266 dead transitions. [2025-03-08 22:02:26,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 266 transitions, 892 flow [2025-03-08 22:02:26,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2025-03-08 22:02:26,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8544395924308588 [2025-03-08 22:02:26,970 INFO L175 Difference]: Start difference. First operand has 229 places, 244 transitions, 720 flow. Second operand 3 states and 587 transitions. [2025-03-08 22:02:26,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 266 transitions, 892 flow [2025-03-08 22:02:26,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 266 transitions, 864 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:26,995 INFO L231 Difference]: Finished difference. Result has 231 places, 250 transitions, 758 flow [2025-03-08 22:02:26,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=231, PETRI_TRANSITIONS=250} [2025-03-08 22:02:26,996 INFO L279 CegarLoopForPetriNet]: 216 programPoint places, 15 predicate places. [2025-03-08 22:02:26,996 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 250 transitions, 758 flow [2025-03-08 22:02:26,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:26,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:26,996 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] [2025-03-08 22:02:26,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:02:26,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:02:26,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash 305039416, now seen corresponding path program 1 times [2025-03-08 22:02:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:26,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070592726] [2025-03-08 22:02:26,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:27,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 22:02:27,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 22:02:27,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:27,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:27,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:02:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 22:02:27,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 22:02:27,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:27,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:27,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:02:27,032 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:02:27,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-08 22:02:27,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-08 22:02:27,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-08 22:02:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-08 22:02:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-08 22:02:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-08 22:02:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-08 22:02:27,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-08 22:02:27,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:02:27,034 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:27,035 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:02:27,035 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 22:02:27,065 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:02:27,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 290 transitions, 607 flow [2025-03-08 22:02:27,108 INFO L124 PetriNetUnfolderBase]: 42/588 cut-off events. [2025-03-08 22:02:27,108 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 22:02:27,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 588 events. 42/588 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2462 event pairs, 1 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 398. Up to 12 conditions per place. [2025-03-08 22:02:27,116 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 290 transitions, 607 flow [2025-03-08 22:02:27,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 290 transitions, 607 flow [2025-03-08 22:02:27,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:27,121 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;@65ddc4fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:27,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-08 22:02:27,123 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:27,123 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-03-08 22:02:27,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:27,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:27,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:27,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 22:02:27,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash 962679805, now seen corresponding path program 1 times [2025-03-08 22:02:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:27,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515339225] [2025-03-08 22:02:27,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:27,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:27,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:02:27,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:02:27,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:27,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:27,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:27,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515339225] [2025-03-08 22:02:27,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515339225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:27,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:27,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:27,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597325963] [2025-03-08 22:02:27,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:27,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:27,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:27,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:27,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:27,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 290 [2025-03-08 22:02:27,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 290 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:27,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:27,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 290 [2025-03-08 22:02:27,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:35,473 INFO L124 PetriNetUnfolderBase]: 23207/84472 cut-off events. [2025-03-08 22:02:35,473 INFO L125 PetriNetUnfolderBase]: For 3601/3601 co-relation queries the response was YES. [2025-03-08 22:02:35,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117710 conditions, 84472 events. 23207/84472 cut-off events. For 3601/3601 co-relation queries the response was YES. Maximal size of possible extension queue 1581. Compared 1206645 event pairs, 14873 based on Foata normal form. 11299/88772 useless extension candidates. Maximal degree in co-relation 10906. Up to 32571 conditions per place. [2025-03-08 22:02:36,036 INFO L140 encePairwiseOnDemand]: 265/290 looper letters, 49 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-03-08 22:02:36,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 275 transitions, 679 flow [2025-03-08 22:02:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2025-03-08 22:02:36,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867816091954023 [2025-03-08 22:02:36,038 INFO L175 Difference]: Start difference. First operand has 272 places, 290 transitions, 607 flow. Second operand 3 states and 755 transitions. [2025-03-08 22:02:36,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 275 transitions, 679 flow [2025-03-08 22:02:36,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 275 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:36,042 INFO L231 Difference]: Finished difference. Result has 273 places, 267 transitions, 571 flow [2025-03-08 22:02:36,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=273, PETRI_TRANSITIONS=267} [2025-03-08 22:02:36,043 INFO L279 CegarLoopForPetriNet]: 272 programPoint places, 1 predicate places. [2025-03-08 22:02:36,043 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 267 transitions, 571 flow [2025-03-08 22:02:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:36,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:36,044 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] [2025-03-08 22:02:36,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:02:36,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 22:02:36,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash 615421735, now seen corresponding path program 1 times [2025-03-08 22:02:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899050380] [2025-03-08 22:02:36,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:36,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:02:36,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:02:36,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:36,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:02:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899050380] [2025-03-08 22:02:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899050380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:36,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:36,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:36,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034925925] [2025-03-08 22:02:36,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:36,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:36,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:36,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:36,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:36,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 290 [2025-03-08 22:02:36,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 267 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 214.5) internal successors, (1287), 6 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:02:36,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:36,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 290 [2025-03-08 22:02:36,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand