./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race.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/pthread-race-challenges/thread-join-array-const-race.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 b78611c293a7a651605e3dc9bdfe409b46ee0a572a0a5030b4011d70f271b607 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:11:33,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:11:33,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:11:33,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:11:33,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:11:33,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:11:33,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:11:33,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:11:33,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:11:33,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:11:33,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:11:33,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:11:33,816 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:11:33,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:11:33,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:11:33,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:11:33,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:11:33,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:11:33,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:11:33,818 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:11:33,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:11:33,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:11:33,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:11:33,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:11:33,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:11:33,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:11:33,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:11:33,818 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 -> b78611c293a7a651605e3dc9bdfe409b46ee0a572a0a5030b4011d70f271b607 [2025-03-08 22:11:34,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:11:34,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:11:34,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:11:34,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:11:34,031 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:11:34,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race.i [2025-03-08 22:11:35,136 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41344d3eb/065713d399254fa29e0e93601f0dbe1b/FLAG1a03be978 [2025-03-08 22:11:35,401 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:11:35,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race.i [2025-03-08 22:11:35,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41344d3eb/065713d399254fa29e0e93601f0dbe1b/FLAG1a03be978 [2025-03-08 22:11:35,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41344d3eb/065713d399254fa29e0e93601f0dbe1b [2025-03-08 22:11:35,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:11:35,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:11:35,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:11:35,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:11:35,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:11:35,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63604a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:35, skipping insertion in model container [2025-03-08 22:11:35,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:11:35" (1/1) ... [2025-03-08 22:11:35,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:11:35,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:11:35,967 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:11:36,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:11:36,033 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:11:36,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36 WrapperNode [2025-03-08 22:11:36,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:11:36,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:11:36,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:11:36,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:11:36,038 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:11:36" (1/1) ... [2025-03-08 22:11:36,049 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:11:36" (1/1) ... [2025-03-08 22:11:36,065 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2025-03-08 22:11:36,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:11:36,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:11:36,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:11:36,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:11:36,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (1/1) ... [2025-03-08 22:11:36,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (1/1) ... [2025-03-08 22:11:36,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (1/1) ... [2025-03-08 22:11:36,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (1/1) ... [2025-03-08 22:11:36,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (1/1) ... [2025-03-08 22:11:36,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (1/1) ... [2025-03-08 22:11:36,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (1/1) ... [2025-03-08 22:11:36,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (1/1) ... [2025-03-08 22:11:36,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:11:36,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:11:36,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:11:36,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:11:36,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (1/1) ... [2025-03-08 22:11:36,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:11:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:11:36,121 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:11:36,124 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:11:36,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:11:36,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:11:36,141 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:11:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:11:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:11:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:11:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:11:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-08 22:11:36,142 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-08 22:11:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:11:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:11:36,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:11:36,143 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:11:36,228 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:11:36,229 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:11:36,355 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~#tids~0#1.base, main_~#tids~0#1.offset; [2025-03-08 22:11:36,355 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: SUMMARY for call ULTIMATE.dealloc(main_~#tids~0#1.base, main_~#tids~0#1.offset); srcloc: null [2025-03-08 22:11:36,378 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:11:36,378 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:11:36,390 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:11:36,390 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:11:36,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:36 BoogieIcfgContainer [2025-03-08 22:11:36,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:11:36,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:11:36,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:11:36,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:11:36,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:11:35" (1/3) ... [2025-03-08 22:11:36,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515b665d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:36, skipping insertion in model container [2025-03-08 22:11:36,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:11:36" (2/3) ... [2025-03-08 22:11:36,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515b665d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:11:36, skipping insertion in model container [2025-03-08 22:11:36,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:36" (3/3) ... [2025-03-08 22:11:36,397 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race.i [2025-03-08 22:11:36,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:11:36,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race.i that has 2 procedures, 76 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-08 22:11:36,411 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:11:36,455 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:11:36,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 161 flow [2025-03-08 22:11:36,519 INFO L124 PetriNetUnfolderBase]: 1/110 cut-off events. [2025-03-08 22:11:36,520 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:11:36,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 1/110 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 217 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 4. Up to 3 conditions per place. [2025-03-08 22:11:36,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 77 transitions, 161 flow [2025-03-08 22:11:36,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 77 transitions, 161 flow [2025-03-08 22:11:36,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:36,539 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;@51cab2a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:36,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 22:11:36,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:36,550 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-08 22:11:36,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:36,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:36,551 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] [2025-03-08 22:11:36,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-08 22:11:36,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash -744516191, now seen corresponding path program 1 times [2025-03-08 22:11:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:36,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491387722] [2025-03-08 22:11:36,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:36,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:11:36,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:11:36,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:36,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:36,743 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:11:36,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:36,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491387722] [2025-03-08 22:11:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491387722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:36,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:36,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259312106] [2025-03-08 22:11:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:36,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:36,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:36,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:36,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 77 [2025-03-08 22:11:36,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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:11:36,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:36,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 77 [2025-03-08 22:11:36,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:36,900 INFO L124 PetriNetUnfolderBase]: 8/187 cut-off events. [2025-03-08 22:11:36,900 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:11:36,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 187 events. 8/187 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 579 event pairs, 0 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2025-03-08 22:11:36,904 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 10 selfloop transitions, 4 changer transitions 1/81 dead transitions. [2025-03-08 22:11:36,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 199 flow [2025-03-08 22:11:36,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2025-03-08 22:11:36,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-08 22:11:36,921 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 161 flow. Second operand 4 states and 280 transitions. [2025-03-08 22:11:36,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 199 flow [2025-03-08 22:11:36,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:36,928 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 173 flow [2025-03-08 22:11:36,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2025-03-08 22:11:36,934 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-03-08 22:11:36,936 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 173 flow [2025-03-08 22:11:36,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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:11:36,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:36,937 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] [2025-03-08 22:11:36,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:11:36,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-08 22:11:36,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1546950938, now seen corresponding path program 1 times [2025-03-08 22:11:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:36,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892492914] [2025-03-08 22:11:36,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:36,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:36,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:11:36,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:11:36,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:36,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:37,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:37,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892492914] [2025-03-08 22:11:37,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892492914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:37,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:37,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094174108] [2025-03-08 22:11:37,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:37,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:37,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:37,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:37,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:37,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 77 [2025-03-08 22:11:37,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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:11:37,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:37,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 77 [2025-03-08 22:11:37,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:37,515 INFO L124 PetriNetUnfolderBase]: 30/212 cut-off events. [2025-03-08 22:11:37,515 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 22:11:37,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 212 events. 30/212 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 851 event pairs, 11 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 248. Up to 62 conditions per place. [2025-03-08 22:11:37,516 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 25 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-03-08 22:11:37,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 247 flow [2025-03-08 22:11:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 355 transitions. [2025-03-08 22:11:37,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7683982683982684 [2025-03-08 22:11:37,520 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 173 flow. Second operand 6 states and 355 transitions. [2025-03-08 22:11:37,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 247 flow [2025-03-08 22:11:37,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 84 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:37,522 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 173 flow [2025-03-08 22:11:37,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2025-03-08 22:11:37,523 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2025-03-08 22:11:37,523 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 173 flow [2025-03-08 22:11:37,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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:11:37,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:37,523 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] [2025-03-08 22:11:37,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:11:37,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-08 22:11:37,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash -654397619, now seen corresponding path program 1 times [2025-03-08 22:11:37,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:37,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560826882] [2025-03-08 22:11:37,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:37,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:11:37,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:11:37,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:37,558 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:11:37,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560826882] [2025-03-08 22:11:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560826882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:37,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393345377] [2025-03-08 22:11:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:37,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:37,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:37,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:37,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 77 [2025-03-08 22:11:37,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:11:37,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:37,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 77 [2025-03-08 22:11:37,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:37,595 INFO L124 PetriNetUnfolderBase]: 6/143 cut-off events. [2025-03-08 22:11:37,595 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-03-08 22:11:37,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 143 events. 6/143 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 382 event pairs, 4 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 136. Up to 21 conditions per place. [2025-03-08 22:11:37,596 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 9 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2025-03-08 22:11:37,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 205 flow [2025-03-08 22:11:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2025-03-08 22:11:37,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2025-03-08 22:11:37,598 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 173 flow. Second operand 3 states and 215 transitions. [2025-03-08 22:11:37,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 205 flow [2025-03-08 22:11:37,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:37,600 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 193 flow [2025-03-08 22:11:37,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-03-08 22:11:37,601 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-03-08 22:11:37,601 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 193 flow [2025-03-08 22:11:37,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:11:37,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:37,601 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] [2025-03-08 22:11:37,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:11:37,602 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-08 22:11:37,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:37,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1512692906, now seen corresponding path program 1 times [2025-03-08 22:11:37,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:37,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104880519] [2025-03-08 22:11:37,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:37,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:11:37,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:11:37,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:37,677 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:11:37,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:37,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104880519] [2025-03-08 22:11:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104880519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:37,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547990942] [2025-03-08 22:11:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:37,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:37,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:37,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:37,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 77 [2025-03-08 22:11:37,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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:11:37,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:37,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 77 [2025-03-08 22:11:37,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:37,741 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2025-03-08 22:11:37,741 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:11:37,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 108 events. 2/108 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs, 0 based on Foata normal form. 3/106 useless extension candidates. Maximal degree in co-relation 83. Up to 7 conditions per place. [2025-03-08 22:11:37,743 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 9 selfloop transitions, 3 changer transitions 7/77 dead transitions. [2025-03-08 22:11:37,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 203 flow [2025-03-08 22:11:37,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2025-03-08 22:11:37,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9025974025974026 [2025-03-08 22:11:37,745 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 193 flow. Second operand 4 states and 278 transitions. [2025-03-08 22:11:37,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 203 flow [2025-03-08 22:11:37,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 77 transitions, 191 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-08 22:11:37,748 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 157 flow [2025-03-08 22:11:37,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2025-03-08 22:11:37,750 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2025-03-08 22:11:37,750 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 157 flow [2025-03-08 22:11:37,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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:11:37,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:37,750 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] [2025-03-08 22:11:37,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:11:37,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-08 22:11:37,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:37,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1733091638, now seen corresponding path program 1 times [2025-03-08 22:11:37,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:37,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621926463] [2025-03-08 22:11:37,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:37,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:37,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:11:37,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:11:37,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:37,865 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:11:37,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621926463] [2025-03-08 22:11:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621926463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:37,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:37,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:11:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673138017] [2025-03-08 22:11:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:37,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:37,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:37,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:37,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-08 22:11:37,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:11:37,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:37,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-08 22:11:37,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:37,966 INFO L124 PetriNetUnfolderBase]: 6/95 cut-off events. [2025-03-08 22:11:37,966 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:11:37,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 95 events. 6/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 122. Up to 5 conditions per place. [2025-03-08 22:11:37,967 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 10 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-08 22:11:37,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 146 flow [2025-03-08 22:11:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:11:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 22:11:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 464 transitions. [2025-03-08 22:11:37,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8608534322820037 [2025-03-08 22:11:37,968 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 157 flow. Second operand 7 states and 464 transitions. [2025-03-08 22:11:37,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 146 flow [2025-03-08 22:11:37,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:37,969 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 111 flow [2025-03-08 22:11:37,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-03-08 22:11:37,969 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2025-03-08 22:11:37,969 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 111 flow [2025-03-08 22:11:37,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:11:37,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:37,970 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] [2025-03-08 22:11:37,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:11:37,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-08 22:11:37,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1099090449, now seen corresponding path program 1 times [2025-03-08 22:11:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:37,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339363847] [2025-03-08 22:11:37,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:37,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:11:37,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:11:37,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:37,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:37,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:11:37,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:11:37,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:37,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:38,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:38,015 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:38,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-08 22:11:38,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-08 22:11:38,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-08 22:11:38,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-08 22:11:38,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-03-08 22:11:38,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-08 22:11:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:11:38,017 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 22:11:38,019 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:38,019 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:11:38,033 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:11:38,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 95 transitions, 206 flow [2025-03-08 22:11:38,050 INFO L124 PetriNetUnfolderBase]: 3/196 cut-off events. [2025-03-08 22:11:38,051 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:11:38,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 196 events. 3/196 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 464 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 112. Up to 6 conditions per place. [2025-03-08 22:11:38,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 95 transitions, 206 flow [2025-03-08 22:11:38,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 206 flow [2025-03-08 22:11:38,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:38,055 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;@51cab2a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:38,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 22:11:38,057 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:38,057 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-08 22:11:38,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:38,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:38,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:38,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-08 22:11:38,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1813557183, now seen corresponding path program 1 times [2025-03-08 22:11:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286084726] [2025-03-08 22:11:38,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:38,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:11:38,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:11:38,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:38,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:38,087 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:11:38,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286084726] [2025-03-08 22:11:38,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286084726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:38,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:38,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:38,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851035669] [2025-03-08 22:11:38,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:38,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:38,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:38,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:38,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:38,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-03-08 22:11:38,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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:11:38,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:38,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-03-08 22:11:38,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:38,194 INFO L124 PetriNetUnfolderBase]: 72/621 cut-off events. [2025-03-08 22:11:38,194 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-08 22:11:38,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 621 events. 72/621 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3727 event pairs, 20 based on Foata normal form. 1/566 useless extension candidates. Maximal degree in co-relation 215. Up to 106 conditions per place. [2025-03-08 22:11:38,197 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 18 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-03-08 22:11:38,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 264 flow [2025-03-08 22:11:38,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2025-03-08 22:11:38,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9026315789473685 [2025-03-08 22:11:38,198 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 206 flow. Second operand 4 states and 343 transitions. [2025-03-08 22:11:38,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 264 flow [2025-03-08 22:11:38,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:38,200 INFO L231 Difference]: Finished difference. Result has 102 places, 96 transitions, 222 flow [2025-03-08 22:11:38,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=102, PETRI_TRANSITIONS=96} [2025-03-08 22:11:38,200 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2025-03-08 22:11:38,201 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 96 transitions, 222 flow [2025-03-08 22:11:38,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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:11:38,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:38,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] [2025-03-08 22:11:38,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:11:38,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-08 22:11:38,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:38,201 INFO L85 PathProgramCache]: Analyzing trace with hash 929352441, now seen corresponding path program 1 times [2025-03-08 22:11:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969830612] [2025-03-08 22:11:38,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:38,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:11:38,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:11:38,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:38,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:38,344 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:11:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:38,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969830612] [2025-03-08 22:11:38,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969830612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:38,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:38,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:38,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623444234] [2025-03-08 22:11:38,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:38,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:38,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:38,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:38,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 95 [2025-03-08 22:11:38,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 96 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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:11:38,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:38,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 95 [2025-03-08 22:11:38,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:38,578 INFO L124 PetriNetUnfolderBase]: 236/966 cut-off events. [2025-03-08 22:11:38,578 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-08 22:11:38,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 966 events. 236/966 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6762 event pairs, 34 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 457. Up to 313 conditions per place. [2025-03-08 22:11:38,583 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 38 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2025-03-08 22:11:38,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 111 transitions, 338 flow [2025-03-08 22:11:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2025-03-08 22:11:38,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7912280701754386 [2025-03-08 22:11:38,585 INFO L175 Difference]: Start difference. First operand has 102 places, 96 transitions, 222 flow. Second operand 6 states and 451 transitions. [2025-03-08 22:11:38,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 111 transitions, 338 flow [2025-03-08 22:11:38,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 111 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:38,586 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 224 flow [2025-03-08 22:11:38,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2025-03-08 22:11:38,587 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2025-03-08 22:11:38,587 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 224 flow [2025-03-08 22:11:38,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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:11:38,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:38,587 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] [2025-03-08 22:11:38,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:11:38,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-08 22:11:38,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:38,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1201802308, now seen corresponding path program 1 times [2025-03-08 22:11:38,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:38,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818313106] [2025-03-08 22:11:38,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:38,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:11:38,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:11:38,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:38,608 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:11:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818313106] [2025-03-08 22:11:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818313106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:38,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868057242] [2025-03-08 22:11:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:38,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:38,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:38,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:38,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-03-08 22:11:38,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:11:38,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:38,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-03-08 22:11:38,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:38,683 INFO L124 PetriNetUnfolderBase]: 113/682 cut-off events. [2025-03-08 22:11:38,683 INFO L125 PetriNetUnfolderBase]: For 97/142 co-relation queries the response was YES. [2025-03-08 22:11:38,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 682 events. 113/682 cut-off events. For 97/142 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4351 event pairs, 73 based on Foata normal form. 3/606 useless extension candidates. Maximal degree in co-relation 734. Up to 182 conditions per place. [2025-03-08 22:11:38,686 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 18 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-03-08 22:11:38,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 103 transitions, 294 flow [2025-03-08 22:11:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-03-08 22:11:38,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9263157894736842 [2025-03-08 22:11:38,688 INFO L175 Difference]: Start difference. First operand has 104 places, 95 transitions, 224 flow. Second operand 3 states and 264 transitions. [2025-03-08 22:11:38,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 103 transitions, 294 flow [2025-03-08 22:11:38,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 284 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:38,689 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 252 flow [2025-03-08 22:11:38,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2025-03-08 22:11:38,690 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2025-03-08 22:11:38,690 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 252 flow [2025-03-08 22:11:38,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:11:38,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:38,691 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] [2025-03-08 22:11:38,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:11:38,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-08 22:11:38,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2109982715, now seen corresponding path program 1 times [2025-03-08 22:11:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:38,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600051167] [2025-03-08 22:11:38,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:38,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:11:38,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:11:38,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:38,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:38,755 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:11:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600051167] [2025-03-08 22:11:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600051167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:38,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:38,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304941679] [2025-03-08 22:11:38,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:38,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:38,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:38,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:38,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-03-08 22:11:38,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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:11:38,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:38,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-03-08 22:11:38,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:38,869 INFO L124 PetriNetUnfolderBase]: 57/561 cut-off events. [2025-03-08 22:11:38,869 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-08 22:11:38,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 561 events. 57/561 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3048 event pairs, 20 based on Foata normal form. 15/532 useless extension candidates. Maximal degree in co-relation 618. Up to 66 conditions per place. [2025-03-08 22:11:38,872 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 20 selfloop transitions, 4 changer transitions 2/110 dead transitions. [2025-03-08 22:11:38,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 110 transitions, 332 flow [2025-03-08 22:11:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-03-08 22:11:38,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9131578947368421 [2025-03-08 22:11:38,873 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 252 flow. Second operand 4 states and 347 transitions. [2025-03-08 22:11:38,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 110 transitions, 332 flow [2025-03-08 22:11:38,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 110 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:38,876 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 258 flow [2025-03-08 22:11:38,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2025-03-08 22:11:38,876 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2025-03-08 22:11:38,876 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 258 flow [2025-03-08 22:11:38,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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:11:38,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:38,877 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] [2025-03-08 22:11:38,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:11:38,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-08 22:11:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1544189894, now seen corresponding path program 1 times [2025-03-08 22:11:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748091194] [2025-03-08 22:11:38,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:38,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:11:38,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:11:38,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:38,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:38,958 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:11:38,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:38,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748091194] [2025-03-08 22:11:38,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748091194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:38,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:38,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:11:38,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647039174] [2025-03-08 22:11:38,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:38,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:38,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:38,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:38,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:39,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2025-03-08 22:11:39,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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:11:39,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:39,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2025-03-08 22:11:39,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:39,135 INFO L124 PetriNetUnfolderBase]: 117/892 cut-off events. [2025-03-08 22:11:39,135 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-08 22:11:39,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 892 events. 117/892 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5632 event pairs, 16 based on Foata normal form. 3/814 useless extension candidates. Maximal degree in co-relation 765. Up to 130 conditions per place. [2025-03-08 22:11:39,138 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 24 selfloop transitions, 7 changer transitions 3/116 dead transitions. [2025-03-08 22:11:39,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 358 flow [2025-03-08 22:11:39,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:11:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 22:11:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 581 transitions. [2025-03-08 22:11:39,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8736842105263158 [2025-03-08 22:11:39,139 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 258 flow. Second operand 7 states and 581 transitions. [2025-03-08 22:11:39,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 358 flow [2025-03-08 22:11:39,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 116 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:39,141 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 282 flow [2025-03-08 22:11:39,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2025-03-08 22:11:39,142 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 14 predicate places. [2025-03-08 22:11:39,142 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 282 flow [2025-03-08 22:11:39,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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:11:39,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:39,142 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] [2025-03-08 22:11:39,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:11:39,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-08 22:11:39,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash -494652505, now seen corresponding path program 1 times [2025-03-08 22:11:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:39,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201652749] [2025-03-08 22:11:39,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:39,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:39,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:11:39,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:11:39,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:39,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:39,171 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:11:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201652749] [2025-03-08 22:11:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201652749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041406986] [2025-03-08 22:11:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:39,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:39,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:39,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:39,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:39,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2025-03-08 22:11:39,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:11:39,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:39,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2025-03-08 22:11:39,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:39,239 INFO L124 PetriNetUnfolderBase]: 58/596 cut-off events. [2025-03-08 22:11:39,239 INFO L125 PetriNetUnfolderBase]: For 132/185 co-relation queries the response was YES. [2025-03-08 22:11:39,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 596 events. 58/596 cut-off events. For 132/185 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3428 event pairs, 32 based on Foata normal form. 3/552 useless extension candidates. Maximal degree in co-relation 784. Up to 111 conditions per place. [2025-03-08 22:11:39,242 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 18 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-03-08 22:11:39,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 109 transitions, 351 flow [2025-03-08 22:11:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-03-08 22:11:39,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228070175438596 [2025-03-08 22:11:39,243 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 282 flow. Second operand 3 states and 263 transitions. [2025-03-08 22:11:39,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 109 transitions, 351 flow [2025-03-08 22:11:39,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 109 transitions, 341 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:39,245 INFO L231 Difference]: Finished difference. Result has 113 places, 106 transitions, 318 flow [2025-03-08 22:11:39,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=113, PETRI_TRANSITIONS=106} [2025-03-08 22:11:39,246 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2025-03-08 22:11:39,246 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 318 flow [2025-03-08 22:11:39,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:11:39,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:39,246 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-08 22:11:39,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:11:39,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-08 22:11:39,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:39,247 INFO L85 PathProgramCache]: Analyzing trace with hash 462865407, now seen corresponding path program 1 times [2025-03-08 22:11:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:39,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47282901] [2025-03-08 22:11:39,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:39,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:11:39,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:11:39,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:39,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:11:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47282901] [2025-03-08 22:11:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47282901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:39,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:11:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045732352] [2025-03-08 22:11:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:11:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:39,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:11:39,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:11:39,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2025-03-08 22:11:39,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 318 flow. Second operand has 8 states, 8 states have (on average 79.625) internal successors, (637), 8 states have internal predecessors, (637), 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:11:39,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:39,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2025-03-08 22:11:39,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:39,558 INFO L124 PetriNetUnfolderBase]: 71/430 cut-off events. [2025-03-08 22:11:39,559 INFO L125 PetriNetUnfolderBase]: For 98/102 co-relation queries the response was YES. [2025-03-08 22:11:39,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 430 events. 71/430 cut-off events. For 98/102 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2199 event pairs, 1 based on Foata normal form. 14/433 useless extension candidates. Maximal degree in co-relation 701. Up to 32 conditions per place. [2025-03-08 22:11:39,562 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 25 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-03-08 22:11:39,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 328 flow [2025-03-08 22:11:39,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:11:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:11:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2025-03-08 22:11:39,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8568421052631578 [2025-03-08 22:11:39,565 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 318 flow. Second operand 10 states and 814 transitions. [2025-03-08 22:11:39,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 328 flow [2025-03-08 22:11:39,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 93 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:11:39,567 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 228 flow [2025-03-08 22:11:39,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=228, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2025-03-08 22:11:39,568 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -7 predicate places. [2025-03-08 22:11:39,569 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 228 flow [2025-03-08 22:11:39,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.625) internal successors, (637), 8 states have internal predecessors, (637), 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:11:39,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:39,569 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:39,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:11:39,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-08 22:11:39,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1743898679, now seen corresponding path program 1 times [2025-03-08 22:11:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:39,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001586961] [2025-03-08 22:11:39,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:39,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:11:39,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:11:39,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:39,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:39,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:39,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:11:39,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:11:39,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:39,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:39,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:39,608 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:39,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-08 22:11:39,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-08 22:11:39,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-08 22:11:39,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-08 22:11:39,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-08 22:11:39,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-08 22:11:39,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-08 22:11:39,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:11:39,609 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:39,610 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:39,610 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 22:11:39,627 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:11:39,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 113 transitions, 253 flow [2025-03-08 22:11:39,653 INFO L124 PetriNetUnfolderBase]: 8/333 cut-off events. [2025-03-08 22:11:39,653 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 22:11:39,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 333 events. 8/333 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 973 event pairs, 1 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 204. Up to 12 conditions per place. [2025-03-08 22:11:39,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 113 transitions, 253 flow [2025-03-08 22:11:39,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 113 transitions, 253 flow [2025-03-08 22:11:39,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:39,657 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;@51cab2a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:39,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-08 22:11:39,659 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:39,659 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-08 22:11:39,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:39,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:39,659 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] [2025-03-08 22:11:39,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:39,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2135739487, now seen corresponding path program 1 times [2025-03-08 22:11:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:39,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803562024] [2025-03-08 22:11:39,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:39,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:11:39,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:11:39,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:39,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:39,690 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:11:39,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:39,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803562024] [2025-03-08 22:11:39,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803562024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:39,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:39,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:39,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843189754] [2025-03-08 22:11:39,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:39,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:39,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:39,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:39,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:39,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 113 [2025-03-08 22:11:39,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 113 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:11:39,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:39,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 113 [2025-03-08 22:11:39,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:39,884 INFO L124 PetriNetUnfolderBase]: 413/2217 cut-off events. [2025-03-08 22:11:39,884 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-03-08 22:11:39,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 2217 events. 413/2217 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 17823 event pairs, 232 based on Foata normal form. 1/2031 useless extension candidates. Maximal degree in co-relation 1335. Up to 496 conditions per place. [2025-03-08 22:11:39,895 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 24 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2025-03-08 22:11:39,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 327 flow [2025-03-08 22:11:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2025-03-08 22:11:39,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8960176991150443 [2025-03-08 22:11:39,896 INFO L175 Difference]: Start difference. First operand has 117 places, 113 transitions, 253 flow. Second operand 4 states and 405 transitions. [2025-03-08 22:11:39,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 327 flow [2025-03-08 22:11:39,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 122 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:39,898 INFO L231 Difference]: Finished difference. Result has 121 places, 114 transitions, 269 flow [2025-03-08 22:11:39,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2025-03-08 22:11:39,899 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 4 predicate places. [2025-03-08 22:11:39,899 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 269 flow [2025-03-08 22:11:39,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:11:39,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:39,899 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] [2025-03-08 22:11:39,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:11:39,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:39,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:39,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2048352746, now seen corresponding path program 1 times [2025-03-08 22:11:39,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:39,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016702138] [2025-03-08 22:11:39,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:39,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:39,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:11:39,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:11:39,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:39,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:40,033 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:11:40,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:40,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016702138] [2025-03-08 22:11:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016702138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:40,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:40,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889480201] [2025-03-08 22:11:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:40,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:40,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:40,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:40,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:40,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2025-03-08 22:11:40,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 114 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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:11:40,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:40,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2025-03-08 22:11:40,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:40,516 INFO L124 PetriNetUnfolderBase]: 1295/3992 cut-off events. [2025-03-08 22:11:40,516 INFO L125 PetriNetUnfolderBase]: For 327/327 co-relation queries the response was YES. [2025-03-08 22:11:40,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6344 conditions, 3992 events. 1295/3992 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 35215 event pairs, 181 based on Foata normal form. 0/3711 useless extension candidates. Maximal degree in co-relation 5668. Up to 1483 conditions per place. [2025-03-08 22:11:40,535 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 50 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-08 22:11:40,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 425 flow [2025-03-08 22:11:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2025-03-08 22:11:40,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8067846607669616 [2025-03-08 22:11:40,536 INFO L175 Difference]: Start difference. First operand has 121 places, 114 transitions, 269 flow. Second operand 6 states and 547 transitions. [2025-03-08 22:11:40,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 425 flow [2025-03-08 22:11:40,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 137 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:40,539 INFO L231 Difference]: Finished difference. Result has 123 places, 113 transitions, 271 flow [2025-03-08 22:11:40,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=123, PETRI_TRANSITIONS=113} [2025-03-08 22:11:40,540 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-03-08 22:11:40,540 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 271 flow [2025-03-08 22:11:40,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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:11:40,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:40,540 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] [2025-03-08 22:11:40,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:11:40,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:40,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash -788641251, now seen corresponding path program 1 times [2025-03-08 22:11:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:40,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563412460] [2025-03-08 22:11:40,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:40,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:11:40,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:11:40,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:40,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:40,560 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:11:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:40,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563412460] [2025-03-08 22:11:40,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563412460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:40,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:40,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:40,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85217561] [2025-03-08 22:11:40,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:40,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:40,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:40,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:40,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 113 [2025-03-08 22:11:40,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:11:40,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:40,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 113 [2025-03-08 22:11:40,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:40,860 INFO L124 PetriNetUnfolderBase]: 1006/3964 cut-off events. [2025-03-08 22:11:40,861 INFO L125 PetriNetUnfolderBase]: For 683/847 co-relation queries the response was YES. [2025-03-08 22:11:40,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5877 conditions, 3964 events. 1006/3964 cut-off events. For 683/847 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 37574 event pairs, 683 based on Foata normal form. 6/3512 useless extension candidates. Maximal degree in co-relation 4693. Up to 1312 conditions per place. [2025-03-08 22:11:40,883 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 27 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2025-03-08 22:11:40,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 126 transitions, 381 flow [2025-03-08 22:11:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2025-03-08 22:11:40,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9233038348082596 [2025-03-08 22:11:40,885 INFO L175 Difference]: Start difference. First operand has 123 places, 113 transitions, 271 flow. Second operand 3 states and 313 transitions. [2025-03-08 22:11:40,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 126 transitions, 381 flow [2025-03-08 22:11:40,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 126 transitions, 371 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:40,887 INFO L231 Difference]: Finished difference. Result has 122 places, 118 transitions, 307 flow [2025-03-08 22:11:40,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=122, PETRI_TRANSITIONS=118} [2025-03-08 22:11:40,887 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2025-03-08 22:11:40,887 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 118 transitions, 307 flow [2025-03-08 22:11:40,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:11:40,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:40,888 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] [2025-03-08 22:11:40,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:11:40,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:40,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash -971331066, now seen corresponding path program 1 times [2025-03-08 22:11:40,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:40,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455727429] [2025-03-08 22:11:40,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:40,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:11:40,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:11:40,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:40,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:40,932 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:11:40,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:40,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455727429] [2025-03-08 22:11:40,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455727429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:40,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:40,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100280566] [2025-03-08 22:11:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:40,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:40,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:40,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:40,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:40,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 113 [2025-03-08 22:11:40,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 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:11:40,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:40,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 113 [2025-03-08 22:11:40,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:41,224 INFO L124 PetriNetUnfolderBase]: 616/3187 cut-off events. [2025-03-08 22:11:41,225 INFO L125 PetriNetUnfolderBase]: For 440/444 co-relation queries the response was YES. [2025-03-08 22:11:41,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 3187 events. 616/3187 cut-off events. For 440/444 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 29129 event pairs, 252 based on Foata normal form. 63/2922 useless extension candidates. Maximal degree in co-relation 3838. Up to 511 conditions per place. [2025-03-08 22:11:41,239 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 31 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-03-08 22:11:41,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 134 transitions, 418 flow [2025-03-08 22:11:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2025-03-08 22:11:41,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.911504424778761 [2025-03-08 22:11:41,241 INFO L175 Difference]: Start difference. First operand has 122 places, 118 transitions, 307 flow. Second operand 4 states and 412 transitions. [2025-03-08 22:11:41,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 134 transitions, 418 flow [2025-03-08 22:11:41,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 134 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:41,244 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 311 flow [2025-03-08 22:11:41,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2025-03-08 22:11:41,245 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2025-03-08 22:11:41,245 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 311 flow [2025-03-08 22:11:41,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 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:11:41,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:41,245 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] [2025-03-08 22:11:41,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:11:41,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:41,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1624506134, now seen corresponding path program 1 times [2025-03-08 22:11:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:41,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967868610] [2025-03-08 22:11:41,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:41,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:11:41,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:11:41,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:41,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:11:41,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967868610] [2025-03-08 22:11:41,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967868610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:41,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:41,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:11:41,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12094459] [2025-03-08 22:11:41,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:41,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:41,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:41,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:41,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2025-03-08 22:11:41,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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:11:41,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:41,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2025-03-08 22:11:41,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:41,829 INFO L124 PetriNetUnfolderBase]: 950/4903 cut-off events. [2025-03-08 22:11:41,829 INFO L125 PetriNetUnfolderBase]: For 649/649 co-relation queries the response was YES. [2025-03-08 22:11:41,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7128 conditions, 4903 events. 950/4903 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 49251 event pairs, 310 based on Foata normal form. 3/4329 useless extension candidates. Maximal degree in co-relation 3734. Up to 1100 conditions per place. [2025-03-08 22:11:41,851 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 35 selfloop transitions, 7 changer transitions 0/139 dead transitions. [2025-03-08 22:11:41,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 437 flow [2025-03-08 22:11:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:11:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 22:11:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 687 transitions. [2025-03-08 22:11:41,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8685208596713021 [2025-03-08 22:11:41,853 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 311 flow. Second operand 7 states and 687 transitions. [2025-03-08 22:11:41,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 437 flow [2025-03-08 22:11:41,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 139 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:41,858 INFO L231 Difference]: Finished difference. Result has 131 places, 122 transitions, 341 flow [2025-03-08 22:11:41,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=131, PETRI_TRANSITIONS=122} [2025-03-08 22:11:41,858 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2025-03-08 22:11:41,858 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 122 transitions, 341 flow [2025-03-08 22:11:41,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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:11:41,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:41,859 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] [2025-03-08 22:11:41,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:11:41,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:41,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash -373516057, now seen corresponding path program 1 times [2025-03-08 22:11:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-03-08 22:11:41,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:41,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:11:41,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:11:41,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:41,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:11:41,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:41,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-03-08 22:11:41,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447792565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:41,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:41,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982245891] [2025-03-08 22:11:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:41,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:41,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:41,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:41,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 113 [2025-03-08 22:11:41,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 122 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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:11:41,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:41,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 113 [2025-03-08 22:11:41,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:42,199 INFO L124 PetriNetUnfolderBase]: 938/4141 cut-off events. [2025-03-08 22:11:42,199 INFO L125 PetriNetUnfolderBase]: For 1310/1506 co-relation queries the response was YES. [2025-03-08 22:11:42,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 4141 events. 938/4141 cut-off events. For 1310/1506 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 41562 event pairs, 546 based on Foata normal form. 7/3751 useless extension candidates. Maximal degree in co-relation 6583. Up to 1216 conditions per place. [2025-03-08 22:11:42,224 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 28 selfloop transitions, 9 changer transitions 0/136 dead transitions. [2025-03-08 22:11:42,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 466 flow [2025-03-08 22:11:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2025-03-08 22:11:42,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9203539823008849 [2025-03-08 22:11:42,225 INFO L175 Difference]: Start difference. First operand has 131 places, 122 transitions, 341 flow. Second operand 3 states and 312 transitions. [2025-03-08 22:11:42,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 466 flow [2025-03-08 22:11:42,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 136 transitions, 456 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:42,228 INFO L231 Difference]: Finished difference. Result has 132 places, 129 transitions, 407 flow [2025-03-08 22:11:42,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=132, PETRI_TRANSITIONS=129} [2025-03-08 22:11:42,229 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2025-03-08 22:11:42,229 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 129 transitions, 407 flow [2025-03-08 22:11:42,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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:11:42,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:42,229 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-08 22:11:42,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:11:42,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:42,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash -180408112, now seen corresponding path program 1 times [2025-03-08 22:11:42,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:42,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190070091] [2025-03-08 22:11:42,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:42,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:11:42,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:11:42,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:42,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:11:42,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:42,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190070091] [2025-03-08 22:11:42,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190070091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:42,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:42,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:11:42,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956073064] [2025-03-08 22:11:42,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:42,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:11:42,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:42,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:11:42,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:11:42,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2025-03-08 22:11:42,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 129 transitions, 407 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 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:11:42,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:42,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2025-03-08 22:11:42,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:43,009 INFO L124 PetriNetUnfolderBase]: 1210/6294 cut-off events. [2025-03-08 22:11:43,009 INFO L125 PetriNetUnfolderBase]: For 1575/2583 co-relation queries the response was YES. [2025-03-08 22:11:43,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9952 conditions, 6294 events. 1210/6294 cut-off events. For 1575/2583 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 66733 event pairs, 186 based on Foata normal form. 16/5595 useless extension candidates. Maximal degree in co-relation 5342. Up to 927 conditions per place. [2025-03-08 22:11:43,051 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 47 selfloop transitions, 10 changer transitions 0/161 dead transitions. [2025-03-08 22:11:43,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 161 transitions, 589 flow [2025-03-08 22:11:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:11:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:11:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 978 transitions. [2025-03-08 22:11:43,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8654867256637168 [2025-03-08 22:11:43,053 INFO L175 Difference]: Start difference. First operand has 132 places, 129 transitions, 407 flow. Second operand 10 states and 978 transitions. [2025-03-08 22:11:43,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 161 transitions, 589 flow [2025-03-08 22:11:43,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 161 transitions, 571 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:43,059 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 429 flow [2025-03-08 22:11:43,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=429, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2025-03-08 22:11:43,059 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 25 predicate places. [2025-03-08 22:11:43,060 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 429 flow [2025-03-08 22:11:43,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 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:11:43,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:43,060 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:43,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:11:43,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:43,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1868764165, now seen corresponding path program 1 times [2025-03-08 22:11:43,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:43,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-08 22:11:43,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:43,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:43,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:11:43,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:11:43,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:43,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:11:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708350996] [2025-03-08 22:11:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708350996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:11:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202581463] [2025-03-08 22:11:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:43,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:43,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:43,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:43,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2025-03-08 22:11:43,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:11:43,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:43,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2025-03-08 22:11:43,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:43,232 INFO L124 PetriNetUnfolderBase]: 98/1375 cut-off events. [2025-03-08 22:11:43,233 INFO L125 PetriNetUnfolderBase]: For 314/358 co-relation queries the response was YES. [2025-03-08 22:11:43,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 1375 events. 98/1375 cut-off events. For 314/358 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10174 event pairs, 26 based on Foata normal form. 20/1279 useless extension candidates. Maximal degree in co-relation 919. Up to 101 conditions per place. [2025-03-08 22:11:43,238 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 12 selfloop transitions, 6 changer transitions 0/130 dead transitions. [2025-03-08 22:11:43,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 130 transitions, 460 flow [2025-03-08 22:11:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2025-03-08 22:11:43,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9469026548672567 [2025-03-08 22:11:43,240 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 429 flow. Second operand 3 states and 321 transitions. [2025-03-08 22:11:43,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 130 transitions, 460 flow [2025-03-08 22:11:43,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 130 transitions, 434 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 22:11:43,243 INFO L231 Difference]: Finished difference. Result has 138 places, 125 transitions, 379 flow [2025-03-08 22:11:43,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=138, PETRI_TRANSITIONS=125} [2025-03-08 22:11:43,244 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 21 predicate places. [2025-03-08 22:11:43,244 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 125 transitions, 379 flow [2025-03-08 22:11:43,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:11:43,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:43,244 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 22:11:43,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:11:43,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:43,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1917904292, now seen corresponding path program 1 times [2025-03-08 22:11:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:43,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470690095] [2025-03-08 22:11:43,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:43,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:43,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:11:43,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:11:43,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:43,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:11:43,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:43,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470690095] [2025-03-08 22:11:43,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470690095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:43,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:43,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:43,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807396515] [2025-03-08 22:11:43,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:43,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:43,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:43,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:43,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 113 [2025-03-08 22:11:43,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 125 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:11:43,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:43,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 113 [2025-03-08 22:11:43,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:43,399 INFO L124 PetriNetUnfolderBase]: 177/1427 cut-off events. [2025-03-08 22:11:43,399 INFO L125 PetriNetUnfolderBase]: For 717/765 co-relation queries the response was YES. [2025-03-08 22:11:43,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 1427 events. 177/1427 cut-off events. For 717/765 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11056 event pairs, 135 based on Foata normal form. 3/1315 useless extension candidates. Maximal degree in co-relation 2146. Up to 336 conditions per place. [2025-03-08 22:11:43,405 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 23 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2025-03-08 22:11:43,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 130 transitions, 453 flow [2025-03-08 22:11:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2025-03-08 22:11:43,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8997050147492626 [2025-03-08 22:11:43,407 INFO L175 Difference]: Start difference. First operand has 138 places, 125 transitions, 379 flow. Second operand 3 states and 305 transitions. [2025-03-08 22:11:43,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 130 transitions, 453 flow [2025-03-08 22:11:43,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 130 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:11:43,410 INFO L231 Difference]: Finished difference. Result has 141 places, 128 transitions, 407 flow [2025-03-08 22:11:43,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=141, PETRI_TRANSITIONS=128} [2025-03-08 22:11:43,411 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 24 predicate places. [2025-03-08 22:11:43,411 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 128 transitions, 407 flow [2025-03-08 22:11:43,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:11:43,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:43,411 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:11:43,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:11:43,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:43,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash -607459413, now seen corresponding path program 1 times [2025-03-08 22:11:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959469814] [2025-03-08 22:11:43,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:43,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 22:11:43,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 22:11:43,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:43,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:11:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959469814] [2025-03-08 22:11:43,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959469814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:43,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:43,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:11:43,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831501061] [2025-03-08 22:11:43,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:43,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:11:43,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:43,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:11:43,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:11:43,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2025-03-08 22:11:43,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 128 transitions, 407 flow. Second operand has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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:11:43,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:43,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2025-03-08 22:11:43,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:43,799 INFO L124 PetriNetUnfolderBase]: 151/816 cut-off events. [2025-03-08 22:11:43,799 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-03-08 22:11:43,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 816 events. 151/816 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4775 event pairs, 0 based on Foata normal form. 20/817 useless extension candidates. Maximal degree in co-relation 1481. Up to 88 conditions per place. [2025-03-08 22:11:43,803 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 50 selfloop transitions, 11 changer transitions 0/125 dead transitions. [2025-03-08 22:11:43,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 498 flow [2025-03-08 22:11:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:11:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 22:11:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1245 transitions. [2025-03-08 22:11:43,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8475153165418652 [2025-03-08 22:11:43,806 INFO L175 Difference]: Start difference. First operand has 141 places, 128 transitions, 407 flow. Second operand 13 states and 1245 transitions. [2025-03-08 22:11:43,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 498 flow [2025-03-08 22:11:43,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 125 transitions, 460 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-03-08 22:11:43,810 INFO L231 Difference]: Finished difference. Result has 112 places, 86 transitions, 246 flow [2025-03-08 22:11:43,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=86} [2025-03-08 22:11:43,812 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -5 predicate places. [2025-03-08 22:11:43,812 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 86 transitions, 246 flow [2025-03-08 22:11:43,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.0) internal successors, (930), 10 states have internal predecessors, (930), 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:11:43,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:43,812 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:43,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:11:43,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-08 22:11:43,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash -564229602, now seen corresponding path program 1 times [2025-03-08 22:11:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:43,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954317986] [2025-03-08 22:11:43,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:43,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:43,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 22:11:43,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:11:43,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:43,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:43,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:11:43,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 22:11:43,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:11:43,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:43,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:11:43,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:11:43,854 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:11:43,854 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-08 22:11:43,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-08 22:11:43,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-08 22:11:43,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-08 22:11:43,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-08 22:11:43,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-08 22:11:43,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-08 22:11:43,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-08 22:11:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:11:43,855 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:11:43,856 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:11:43,856 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 22:11:43,873 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 22:11:43,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 131 transitions, 302 flow [2025-03-08 22:11:43,908 INFO L124 PetriNetUnfolderBase]: 21/574 cut-off events. [2025-03-08 22:11:43,908 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-08 22:11:43,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 574 events. 21/574 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2172 event pairs, 6 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 353. Up to 32 conditions per place. [2025-03-08 22:11:43,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 131 transitions, 302 flow [2025-03-08 22:11:43,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 131 transitions, 302 flow [2025-03-08 22:11:43,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:11:43,914 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;@51cab2a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:11:43,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-08 22:11:43,915 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:11:43,916 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-08 22:11:43,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:11:43,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:43,916 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] [2025-03-08 22:11:43,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:11:43,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1711063103, now seen corresponding path program 1 times [2025-03-08 22:11:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:43,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821752938] [2025-03-08 22:11:43,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:43,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:11:43,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:11:43,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:43,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:43,941 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:11:43,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821752938] [2025-03-08 22:11:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821752938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:43,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:43,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252174117] [2025-03-08 22:11:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:43,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:43,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:43,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:43,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2025-03-08 22:11:43,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:11:43,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:43,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2025-03-08 22:11:43,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:44,543 INFO L124 PetriNetUnfolderBase]: 2017/8327 cut-off events. [2025-03-08 22:11:44,544 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-03-08 22:11:44,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11728 conditions, 8327 events. 2017/8327 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 85517 event pairs, 1191 based on Foata normal form. 1/7616 useless extension candidates. Maximal degree in co-relation 5299. Up to 2119 conditions per place. [2025-03-08 22:11:44,584 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 30 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2025-03-08 22:11:44,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 142 transitions, 392 flow [2025-03-08 22:11:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2025-03-08 22:11:44,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8912213740458015 [2025-03-08 22:11:44,586 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 302 flow. Second operand 4 states and 467 transitions. [2025-03-08 22:11:44,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 142 transitions, 392 flow [2025-03-08 22:11:44,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:11:44,588 INFO L231 Difference]: Finished difference. Result has 140 places, 132 transitions, 318 flow [2025-03-08 22:11:44,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=140, PETRI_TRANSITIONS=132} [2025-03-08 22:11:44,589 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 4 predicate places. [2025-03-08 22:11:44,589 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 132 transitions, 318 flow [2025-03-08 22:11:44,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:11:44,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:44,589 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] [2025-03-08 22:11:44,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:11:44,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:11:44,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash 608984557, now seen corresponding path program 1 times [2025-03-08 22:11:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:44,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652664571] [2025-03-08 22:11:44,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:44,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:44,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:11:44,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:11:44,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:44,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:44,701 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:11:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652664571] [2025-03-08 22:11:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652664571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:44,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:11:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931406440] [2025-03-08 22:11:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:44,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:44,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:44,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:44,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:44,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 131 [2025-03-08 22:11:44,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 132 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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:11:44,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:44,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 131 [2025-03-08 22:11:44,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:46,099 INFO L124 PetriNetUnfolderBase]: 6248/15894 cut-off events. [2025-03-08 22:11:46,100 INFO L125 PetriNetUnfolderBase]: For 1589/1589 co-relation queries the response was YES. [2025-03-08 22:11:46,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25970 conditions, 15894 events. 6248/15894 cut-off events. For 1589/1589 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 162042 event pairs, 808 based on Foata normal form. 0/14856 useless extension candidates. Maximal degree in co-relation 9040. Up to 6781 conditions per place. [2025-03-08 22:11:46,270 INFO L140 encePairwiseOnDemand]: 125/131 looper letters, 62 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2025-03-08 22:11:46,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 163 transitions, 514 flow [2025-03-08 22:11:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:11:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:11:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2025-03-08 22:11:46,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8180661577608143 [2025-03-08 22:11:46,272 INFO L175 Difference]: Start difference. First operand has 140 places, 132 transitions, 318 flow. Second operand 6 states and 643 transitions. [2025-03-08 22:11:46,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 163 transitions, 514 flow [2025-03-08 22:11:46,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 163 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:46,278 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 320 flow [2025-03-08 22:11:46,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2025-03-08 22:11:46,278 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 6 predicate places. [2025-03-08 22:11:46,278 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 320 flow [2025-03-08 22:11:46,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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:11:46,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:46,279 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] [2025-03-08 22:11:46,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:11:46,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:11:46,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1109121568, now seen corresponding path program 1 times [2025-03-08 22:11:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924394248] [2025-03-08 22:11:46,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:46,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:46,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:11:46,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:11:46,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:46,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:46,297 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:11:46,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:46,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924394248] [2025-03-08 22:11:46,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924394248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:46,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:46,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:46,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846804341] [2025-03-08 22:11:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:46,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:46,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:46,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:46,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:46,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-03-08 22:11:46,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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:11:46,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:46,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-03-08 22:11:46,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:48,109 INFO L124 PetriNetUnfolderBase]: 7178/23603 cut-off events. [2025-03-08 22:11:48,109 INFO L125 PetriNetUnfolderBase]: For 5337/6579 co-relation queries the response was YES. [2025-03-08 22:11:48,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35693 conditions, 23603 events. 7178/23603 cut-off events. For 5337/6579 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 286367 event pairs, 4486 based on Foata normal form. 11/20852 useless extension candidates. Maximal degree in co-relation 12989. Up to 8464 conditions per place. [2025-03-08 22:11:48,241 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 36 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2025-03-08 22:11:48,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 149 transitions, 472 flow [2025-03-08 22:11:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-03-08 22:11:48,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9211195928753181 [2025-03-08 22:11:48,246 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 320 flow. Second operand 3 states and 362 transitions. [2025-03-08 22:11:48,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 149 transitions, 472 flow [2025-03-08 22:11:48,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 149 transitions, 462 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:11:48,253 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 364 flow [2025-03-08 22:11:48,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-03-08 22:11:48,253 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 5 predicate places. [2025-03-08 22:11:48,253 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 364 flow [2025-03-08 22:11:48,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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:11:48,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:48,253 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] [2025-03-08 22:11:48,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:11:48,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:11:48,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1903262041, now seen corresponding path program 1 times [2025-03-08 22:11:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376125937] [2025-03-08 22:11:48,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:48,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:11:48,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:11:48,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:48,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:48,298 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:11:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376125937] [2025-03-08 22:11:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376125937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:48,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:48,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:11:48,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930562544] [2025-03-08 22:11:48,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:48,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:11:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:48,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:11:48,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:11:48,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2025-03-08 22:11:48,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 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:11:48,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:48,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2025-03-08 22:11:48,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:50,243 INFO L124 PetriNetUnfolderBase]: 5437/19811 cut-off events. [2025-03-08 22:11:50,243 INFO L125 PetriNetUnfolderBase]: For 2732/2798 co-relation queries the response was YES. [2025-03-08 22:11:50,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30233 conditions, 19811 events. 5437/19811 cut-off events. For 2732/2798 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 241754 event pairs, 2945 based on Foata normal form. 259/17673 useless extension candidates. Maximal degree in co-relation 24434. Up to 3835 conditions per place. [2025-03-08 22:11:50,343 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 40 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-03-08 22:11:50,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 158 transitions, 506 flow [2025-03-08 22:11:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:11:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:11:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2025-03-08 22:11:50,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103053435114504 [2025-03-08 22:11:50,345 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 364 flow. Second operand 4 states and 477 transitions. [2025-03-08 22:11:50,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 158 transitions, 506 flow [2025-03-08 22:11:50,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 158 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:50,354 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 366 flow [2025-03-08 22:11:50,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2025-03-08 22:11:50,355 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 7 predicate places. [2025-03-08 22:11:50,356 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 366 flow [2025-03-08 22:11:50,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 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:11:50,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:50,356 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] [2025-03-08 22:11:50,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:11:50,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:11:50,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:50,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1974040358, now seen corresponding path program 1 times [2025-03-08 22:11:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:50,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-03-08 22:11:50,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:50,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:11:50,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:11:50,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:50,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:50,415 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:11:50,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-03-08 22:11:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360294191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:50,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:50,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:11:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031124384] [2025-03-08 22:11:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:50,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:11:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:50,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:11:50,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:11:50,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-03-08 22:11:50,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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:11:50,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:50,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-03-08 22:11:50,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:52,454 INFO L124 PetriNetUnfolderBase]: 6308/24158 cut-off events. [2025-03-08 22:11:52,454 INFO L125 PetriNetUnfolderBase]: For 3185/3185 co-relation queries the response was YES. [2025-03-08 22:11:52,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36542 conditions, 24158 events. 6308/24158 cut-off events. For 3185/3185 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 309963 event pairs, 2802 based on Foata normal form. 3/20930 useless extension candidates. Maximal degree in co-relation 20572. Up to 5820 conditions per place. [2025-03-08 22:11:52,602 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 41 selfloop transitions, 7 changer transitions 0/160 dead transitions. [2025-03-08 22:11:52,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 160 transitions, 508 flow [2025-03-08 22:11:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:11:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 22:11:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 791 transitions. [2025-03-08 22:11:52,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8625954198473282 [2025-03-08 22:11:52,604 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 366 flow. Second operand 7 states and 791 transitions. [2025-03-08 22:11:52,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 160 transitions, 508 flow [2025-03-08 22:11:52,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 160 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:11:52,611 INFO L231 Difference]: Finished difference. Result has 150 places, 141 transitions, 396 flow [2025-03-08 22:11:52,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=396, PETRI_PLACES=150, PETRI_TRANSITIONS=141} [2025-03-08 22:11:52,611 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 14 predicate places. [2025-03-08 22:11:52,611 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 141 transitions, 396 flow [2025-03-08 22:11:52,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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:11:52,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:52,611 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] [2025-03-08 22:11:52,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:11:52,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:11:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 205480119, now seen corresponding path program 1 times [2025-03-08 22:11:52,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:52,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-08 22:11:52,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:52,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:52,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:11:52,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:11:52,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:52,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:52,632 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:11:52,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:52,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266031602] [2025-03-08 22:11:52,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266031602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:52,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:52,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:11:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110521844] [2025-03-08 22:11:52,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:52,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:11:52,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:52,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:11:52,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:11:52,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-03-08 22:11:52,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 141 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:11:52,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:52,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-03-08 22:11:52,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:55,728 INFO L124 PetriNetUnfolderBase]: 8620/31172 cut-off events. [2025-03-08 22:11:55,728 INFO L125 PetriNetUnfolderBase]: For 11633/13854 co-relation queries the response was YES. [2025-03-08 22:11:55,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52388 conditions, 31172 events. 8620/31172 cut-off events. For 11633/13854 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 411114 event pairs, 4986 based on Foata normal form. 43/27821 useless extension candidates. Maximal degree in co-relation 51105. Up to 9839 conditions per place. [2025-03-08 22:11:55,909 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 38 selfloop transitions, 11 changer transitions 0/161 dead transitions. [2025-03-08 22:11:55,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 161 transitions, 573 flow [2025-03-08 22:11:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:11:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:11:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-03-08 22:11:55,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9185750636132316 [2025-03-08 22:11:55,910 INFO L175 Difference]: Start difference. First operand has 150 places, 141 transitions, 396 flow. Second operand 3 states and 361 transitions. [2025-03-08 22:11:55,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 161 transitions, 573 flow [2025-03-08 22:11:55,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 161 transitions, 563 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 22:11:55,933 INFO L231 Difference]: Finished difference. Result has 151 places, 150 transitions, 482 flow [2025-03-08 22:11:55,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=151, PETRI_TRANSITIONS=150} [2025-03-08 22:11:55,934 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 15 predicate places. [2025-03-08 22:11:55,934 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 150 transitions, 482 flow [2025-03-08 22:11:55,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:11:55,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:11:55,934 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-08 22:11:55,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:11:55,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:11:55,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:11:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash 954852467, now seen corresponding path program 1 times [2025-03-08 22:11:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:11:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147400753] [2025-03-08 22:11:55,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:11:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:11:55,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:11:55,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:11:55,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:11:55,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:11:56,000 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:11:56,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:11:56,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147400753] [2025-03-08 22:11:56,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147400753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:11:56,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:11:56,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:11:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608178899] [2025-03-08 22:11:56,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:11:56,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:11:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:11:56,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:11:56,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:11:56,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-03-08 22:11:56,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 150 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 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:11:56,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:11:56,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-03-08 22:11:56,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:11:59,780 INFO L124 PetriNetUnfolderBase]: 9234/37130 cut-off events. [2025-03-08 22:11:59,780 INFO L125 PetriNetUnfolderBase]: For 10537/21441 co-relation queries the response was YES. [2025-03-08 22:11:59,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60596 conditions, 37130 events. 9234/37130 cut-off events. For 10537/21441 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 514511 event pairs, 2450 based on Foata normal form. 33/32098 useless extension candidates. Maximal degree in co-relation 28374. Up to 8114 conditions per place. [2025-03-08 22:12:00,015 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 55 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2025-03-08 22:12:00,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 186 transitions, 694 flow [2025-03-08 22:12:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:12:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:12:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1126 transitions. [2025-03-08 22:12:00,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595419847328244 [2025-03-08 22:12:00,017 INFO L175 Difference]: Start difference. First operand has 151 places, 150 transitions, 482 flow. Second operand 10 states and 1126 transitions. [2025-03-08 22:12:00,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 186 transitions, 694 flow [2025-03-08 22:12:00,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 186 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:00,046 INFO L231 Difference]: Finished difference. Result has 161 places, 153 transitions, 508 flow [2025-03-08 22:12:00,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=508, PETRI_PLACES=161, PETRI_TRANSITIONS=153} [2025-03-08 22:12:00,047 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 25 predicate places. [2025-03-08 22:12:00,047 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 153 transitions, 508 flow [2025-03-08 22:12:00,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.625) internal successors, (861), 8 states have internal predecessors, (861), 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:12:00,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:00,047 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:00,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:12:00,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:00,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash -265646805, now seen corresponding path program 1 times [2025-03-08 22:12:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374162339] [2025-03-08 22:12:00,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:00,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:00,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 22:12:00,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 22:12:00,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:00,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:00,082 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:12:00,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:00,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374162339] [2025-03-08 22:12:00,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374162339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:00,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:00,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:12:00,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703680746] [2025-03-08 22:12:00,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:00,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:00,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:00,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:00,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 131 [2025-03-08 22:12:00,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 153 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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:12:00,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:00,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 131 [2025-03-08 22:12:00,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:00,466 INFO L124 PetriNetUnfolderBase]: 531/5139 cut-off events. [2025-03-08 22:12:00,466 INFO L125 PetriNetUnfolderBase]: For 1399/1578 co-relation queries the response was YES. [2025-03-08 22:12:00,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7676 conditions, 5139 events. 531/5139 cut-off events. For 1399/1578 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 55711 event pairs, 193 based on Foata normal form. 140/4810 useless extension candidates. Maximal degree in co-relation 3626. Up to 422 conditions per place. [2025-03-08 22:12:00,491 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 16 selfloop transitions, 8 changer transitions 0/151 dead transitions. [2025-03-08 22:12:00,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 151 transitions, 549 flow [2025-03-08 22:12:00,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-03-08 22:12:00,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414758269720102 [2025-03-08 22:12:00,492 INFO L175 Difference]: Start difference. First operand has 161 places, 153 transitions, 508 flow. Second operand 3 states and 370 transitions. [2025-03-08 22:12:00,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 151 transitions, 549 flow [2025-03-08 22:12:00,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 151 transitions, 523 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 22:12:00,496 INFO L231 Difference]: Finished difference. Result has 157 places, 144 transitions, 444 flow [2025-03-08 22:12:00,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=157, PETRI_TRANSITIONS=144} [2025-03-08 22:12:00,496 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 21 predicate places. [2025-03-08 22:12:00,496 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 144 transitions, 444 flow [2025-03-08 22:12:00,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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:12:00,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:00,497 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 22:12:00,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:12:00,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:00,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:00,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1045605873, now seen corresponding path program 1 times [2025-03-08 22:12:00,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:00,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-03-08 22:12:00,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:00,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:12:00,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:12:00,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:00,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:00,519 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:12:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-03-08 22:12:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758736812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:00,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159337697] [2025-03-08 22:12:00,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:00,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:00,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:00,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:00,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-03-08 22:12:00,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 144 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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:12:00,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:00,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-03-08 22:12:00,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:01,108 INFO L124 PetriNetUnfolderBase]: 934/6027 cut-off events. [2025-03-08 22:12:01,108 INFO L125 PetriNetUnfolderBase]: For 3710/3812 co-relation queries the response was YES. [2025-03-08 22:12:01,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10594 conditions, 6027 events. 934/6027 cut-off events. For 3710/3812 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 68522 event pairs, 666 based on Foata normal form. 4/5496 useless extension candidates. Maximal degree in co-relation 3854. Up to 1548 conditions per place. [2025-03-08 22:12:01,130 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 30 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2025-03-08 22:12:01,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 151 transitions, 548 flow [2025-03-08 22:12:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2025-03-08 22:12:01,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8931297709923665 [2025-03-08 22:12:01,132 INFO L175 Difference]: Start difference. First operand has 157 places, 144 transitions, 444 flow. Second operand 3 states and 351 transitions. [2025-03-08 22:12:01,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 151 transitions, 548 flow [2025-03-08 22:12:01,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 540 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:12:01,135 INFO L231 Difference]: Finished difference. Result has 160 places, 147 transitions, 470 flow [2025-03-08 22:12:01,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=160, PETRI_TRANSITIONS=147} [2025-03-08 22:12:01,136 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 24 predicate places. [2025-03-08 22:12:01,136 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 147 transitions, 470 flow [2025-03-08 22:12:01,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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:12:01,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:01,136 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:12:01,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:12:01,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:01,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash -906892293, now seen corresponding path program 1 times [2025-03-08 22:12:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:01,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834279242] [2025-03-08 22:12:01,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:01,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:01,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 22:12:01,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 22:12:01,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:01,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:01,227 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:12:01,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:01,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834279242] [2025-03-08 22:12:01,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834279242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:01,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:01,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:12:01,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723902272] [2025-03-08 22:12:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:01,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:12:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:01,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:12:01,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:12:01,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2025-03-08 22:12:01,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 147 transitions, 470 flow. Second operand has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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:12:01,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:01,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2025-03-08 22:12:01,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:02,123 INFO L124 PetriNetUnfolderBase]: 1216/8418 cut-off events. [2025-03-08 22:12:02,123 INFO L125 PetriNetUnfolderBase]: For 3392/3658 co-relation queries the response was YES. [2025-03-08 22:12:02,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13831 conditions, 8418 events. 1216/8418 cut-off events. For 3392/3658 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 91428 event pairs, 207 based on Foata normal form. 20/7681 useless extension candidates. Maximal degree in co-relation 5591. Up to 893 conditions per place. [2025-03-08 22:12:02,169 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 76 selfloop transitions, 14 changer transitions 1/205 dead transitions. [2025-03-08 22:12:02,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 205 transitions, 828 flow [2025-03-08 22:12:02,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:12:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 22:12:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1457 transitions. [2025-03-08 22:12:02,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8555490311215502 [2025-03-08 22:12:02,171 INFO L175 Difference]: Start difference. First operand has 160 places, 147 transitions, 470 flow. Second operand 13 states and 1457 transitions. [2025-03-08 22:12:02,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 205 transitions, 828 flow [2025-03-08 22:12:02,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 205 transitions, 816 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:02,177 INFO L231 Difference]: Finished difference. Result has 174 places, 150 transitions, 520 flow [2025-03-08 22:12:02,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=520, PETRI_PLACES=174, PETRI_TRANSITIONS=150} [2025-03-08 22:12:02,178 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 38 predicate places. [2025-03-08 22:12:02,178 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 150 transitions, 520 flow [2025-03-08 22:12:02,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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:12:02,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:02,179 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:12:02,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:12:02,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:02,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2117920998, now seen corresponding path program 1 times [2025-03-08 22:12:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213476437] [2025-03-08 22:12:02,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:02,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:02,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 22:12:02,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 22:12:02,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:02,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:02,203 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:12:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213476437] [2025-03-08 22:12:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213476437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:02,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:02,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109224028] [2025-03-08 22:12:02,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:02,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:02,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:02,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:02,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-03-08 22:12:02,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 150 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:12:02,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:02,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-03-08 22:12:02,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:02,794 INFO L124 PetriNetUnfolderBase]: 883/5710 cut-off events. [2025-03-08 22:12:02,794 INFO L125 PetriNetUnfolderBase]: For 4117/4213 co-relation queries the response was YES. [2025-03-08 22:12:02,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10588 conditions, 5710 events. 883/5710 cut-off events. For 4117/4213 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 62548 event pairs, 677 based on Foata normal form. 4/5205 useless extension candidates. Maximal degree in co-relation 9769. Up to 1476 conditions per place. [2025-03-08 22:12:02,826 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 30 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2025-03-08 22:12:02,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 156 transitions, 615 flow [2025-03-08 22:12:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2025-03-08 22:12:02,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905852417302799 [2025-03-08 22:12:02,827 INFO L175 Difference]: Start difference. First operand has 174 places, 150 transitions, 520 flow. Second operand 3 states and 350 transitions. [2025-03-08 22:12:02,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 156 transitions, 615 flow [2025-03-08 22:12:02,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 156 transitions, 585 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-08 22:12:02,836 INFO L231 Difference]: Finished difference. Result has 170 places, 153 transitions, 526 flow [2025-03-08 22:12:02,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=170, PETRI_TRANSITIONS=153} [2025-03-08 22:12:02,836 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 34 predicate places. [2025-03-08 22:12:02,836 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 153 transitions, 526 flow [2025-03-08 22:12:02,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:12:02,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:02,837 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 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:12:02,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:12:02,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:02,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash 625132404, now seen corresponding path program 1 times [2025-03-08 22:12:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974949184] [2025-03-08 22:12:02,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:02,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 22:12:02,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 22:12:02,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:02,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:03,133 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:12:03,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:03,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974949184] [2025-03-08 22:12:03,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974949184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:03,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:03,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:12:03,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817575805] [2025-03-08 22:12:03,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:03,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:12:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:03,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:12:03,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:12:03,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 131 [2025-03-08 22:12:03,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 153 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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:12:03,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:03,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 131 [2025-03-08 22:12:03,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:04,129 INFO L124 PetriNetUnfolderBase]: 2726/11410 cut-off events. [2025-03-08 22:12:04,130 INFO L125 PetriNetUnfolderBase]: For 4357/4642 co-relation queries the response was YES. [2025-03-08 22:12:04,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21748 conditions, 11410 events. 2726/11410 cut-off events. For 4357/4642 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 124576 event pairs, 1342 based on Foata normal form. 0/10706 useless extension candidates. Maximal degree in co-relation 19455. Up to 2509 conditions per place. [2025-03-08 22:12:04,190 INFO L140 encePairwiseOnDemand]: 125/131 looper letters, 59 selfloop transitions, 6 changer transitions 0/184 dead transitions. [2025-03-08 22:12:04,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 184 transitions, 750 flow [2025-03-08 22:12:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:12:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:12:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2025-03-08 22:12:04,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8307888040712468 [2025-03-08 22:12:04,191 INFO L175 Difference]: Start difference. First operand has 170 places, 153 transitions, 526 flow. Second operand 6 states and 653 transitions. [2025-03-08 22:12:04,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 184 transitions, 750 flow [2025-03-08 22:12:04,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 184 transitions, 736 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:04,210 INFO L231 Difference]: Finished difference. Result has 172 places, 152 transitions, 522 flow [2025-03-08 22:12:04,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=172, PETRI_TRANSITIONS=152} [2025-03-08 22:12:04,210 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 36 predicate places. [2025-03-08 22:12:04,210 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 152 transitions, 522 flow [2025-03-08 22:12:04,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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:12:04,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:04,210 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:04,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:12:04,211 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:04,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1008588792, now seen corresponding path program 1 times [2025-03-08 22:12:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:04,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678136079] [2025-03-08 22:12:04,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:04,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 22:12:04,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 22:12:04,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:04,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:04,327 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:12:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678136079] [2025-03-08 22:12:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678136079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 22:12:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683317562] [2025-03-08 22:12:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:12:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:04,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:12:04,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:12:04,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2025-03-08 22:12:04,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 152 transitions, 522 flow. Second operand has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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:12:04,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:04,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2025-03-08 22:12:04,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:05,325 INFO L124 PetriNetUnfolderBase]: 1190/7818 cut-off events. [2025-03-08 22:12:05,325 INFO L125 PetriNetUnfolderBase]: For 4028/4256 co-relation queries the response was YES. [2025-03-08 22:12:05,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14600 conditions, 7818 events. 1190/7818 cut-off events. For 4028/4256 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 84027 event pairs, 165 based on Foata normal form. 48/7298 useless extension candidates. Maximal degree in co-relation 5054. Up to 557 conditions per place. [2025-03-08 22:12:05,368 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 90 selfloop transitions, 16 changer transitions 8/229 dead transitions. [2025-03-08 22:12:05,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 229 transitions, 978 flow [2025-03-08 22:12:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:12:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-08 22:12:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1795 transitions. [2025-03-08 22:12:05,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8563931297709924 [2025-03-08 22:12:05,370 INFO L175 Difference]: Start difference. First operand has 172 places, 152 transitions, 522 flow. Second operand 16 states and 1795 transitions. [2025-03-08 22:12:05,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 229 transitions, 978 flow [2025-03-08 22:12:05,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 229 transitions, 958 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-08 22:12:05,382 INFO L231 Difference]: Finished difference. Result has 178 places, 150 transitions, 522 flow [2025-03-08 22:12:05,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=522, PETRI_PLACES=178, PETRI_TRANSITIONS=150} [2025-03-08 22:12:05,383 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 42 predicate places. [2025-03-08 22:12:05,383 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 150 transitions, 522 flow [2025-03-08 22:12:05,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 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:12:05,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:05,383 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:05,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 22:12:05,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:05,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash -478781544, now seen corresponding path program 1 times [2025-03-08 22:12:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:05,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779138616] [2025-03-08 22:12:05,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:05,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:12:05,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:12:05,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:05,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:05,422 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:12:05,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:05,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779138616] [2025-03-08 22:12:05,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779138616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:05,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:05,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:05,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865810003] [2025-03-08 22:12:05,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:05,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:05,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:05,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:05,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:05,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 131 [2025-03-08 22:12:05,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 150 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:12:05,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:05,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 131 [2025-03-08 22:12:05,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:06,409 INFO L124 PetriNetUnfolderBase]: 1353/8934 cut-off events. [2025-03-08 22:12:06,409 INFO L125 PetriNetUnfolderBase]: For 5201/5285 co-relation queries the response was YES. [2025-03-08 22:12:06,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16800 conditions, 8934 events. 1353/8934 cut-off events. For 5201/5285 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 106390 event pairs, 605 based on Foata normal form. 0/8374 useless extension candidates. Maximal degree in co-relation 16013. Up to 1591 conditions per place. [2025-03-08 22:12:06,456 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 30 selfloop transitions, 9 changer transitions 1/163 dead transitions. [2025-03-08 22:12:06,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 163 transitions, 656 flow [2025-03-08 22:12:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-03-08 22:12:06,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9185750636132316 [2025-03-08 22:12:06,457 INFO L175 Difference]: Start difference. First operand has 178 places, 150 transitions, 522 flow. Second operand 3 states and 361 transitions. [2025-03-08 22:12:06,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 163 transitions, 656 flow [2025-03-08 22:12:06,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 163 transitions, 588 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-03-08 22:12:06,496 INFO L231 Difference]: Finished difference. Result has 161 places, 154 transitions, 530 flow [2025-03-08 22:12:06,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=161, PETRI_TRANSITIONS=154} [2025-03-08 22:12:06,496 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 25 predicate places. [2025-03-08 22:12:06,496 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 530 flow [2025-03-08 22:12:06,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:12:06,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:06,497 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:06,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 22:12:06,497 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:06,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash 671909281, now seen corresponding path program 1 times [2025-03-08 22:12:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904731264] [2025-03-08 22:12:06,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:06,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 22:12:06,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 22:12:06,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:06,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:06,604 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:12:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:06,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904731264] [2025-03-08 22:12:06,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904731264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:06,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:06,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:12:06,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536229279] [2025-03-08 22:12:06,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:06,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:12:06,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:06,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:12:06,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:12:06,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2025-03-08 22:12:06,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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:12:06,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:06,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2025-03-08 22:12:06,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:07,320 INFO L124 PetriNetUnfolderBase]: 1110/5875 cut-off events. [2025-03-08 22:12:07,320 INFO L125 PetriNetUnfolderBase]: For 3503/3699 co-relation queries the response was YES. [2025-03-08 22:12:07,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10999 conditions, 5875 events. 1110/5875 cut-off events. For 3503/3699 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 58964 event pairs, 310 based on Foata normal form. 80/5835 useless extension candidates. Maximal degree in co-relation 10335. Up to 748 conditions per place. [2025-03-08 22:12:07,349 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 63 selfloop transitions, 7 changer transitions 8/206 dead transitions. [2025-03-08 22:12:07,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 206 transitions, 852 flow [2025-03-08 22:12:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:12:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 22:12:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2025-03-08 22:12:07,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8953107960741549 [2025-03-08 22:12:07,350 INFO L175 Difference]: Start difference. First operand has 161 places, 154 transitions, 530 flow. Second operand 7 states and 821 transitions. [2025-03-08 22:12:07,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 206 transitions, 852 flow [2025-03-08 22:12:07,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 206 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:07,357 INFO L231 Difference]: Finished difference. Result has 168 places, 157 transitions, 548 flow [2025-03-08 22:12:07,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=548, PETRI_PLACES=168, PETRI_TRANSITIONS=157} [2025-03-08 22:12:07,358 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 32 predicate places. [2025-03-08 22:12:07,358 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 157 transitions, 548 flow [2025-03-08 22:12:07,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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:12:07,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:07,358 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:12:07,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 22:12:07,358 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:07,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1251695511, now seen corresponding path program 1 times [2025-03-08 22:12:07,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:07,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-03-08 22:12:07,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:07,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:07,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 22:12:07,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 22:12:07,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:07,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:12:07,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:07,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407292550] [2025-03-08 22:12:07,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407292550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:07,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:07,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:12:07,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182813050] [2025-03-08 22:12:07,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:07,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:12:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:07,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:12:07,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:12:07,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 131 [2025-03-08 22:12:07,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 157 transitions, 548 flow. Second operand has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 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:12:07,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:07,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 131 [2025-03-08 22:12:07,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:08,144 INFO L124 PetriNetUnfolderBase]: 1050/4123 cut-off events. [2025-03-08 22:12:08,144 INFO L125 PetriNetUnfolderBase]: For 2254/2282 co-relation queries the response was YES. [2025-03-08 22:12:08,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8358 conditions, 4123 events. 1050/4123 cut-off events. For 2254/2282 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 35042 event pairs, 84 based on Foata normal form. 48/4135 useless extension candidates. Maximal degree in co-relation 7690. Up to 518 conditions per place. [2025-03-08 22:12:08,164 INFO L140 encePairwiseOnDemand]: 123/131 looper letters, 88 selfloop transitions, 10 changer transitions 17/234 dead transitions. [2025-03-08 22:12:08,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 234 transitions, 1004 flow [2025-03-08 22:12:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:12:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:12:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1158 transitions. [2025-03-08 22:12:08,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8839694656488549 [2025-03-08 22:12:08,166 INFO L175 Difference]: Start difference. First operand has 168 places, 157 transitions, 548 flow. Second operand 10 states and 1158 transitions. [2025-03-08 22:12:08,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 234 transitions, 1004 flow [2025-03-08 22:12:08,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 234 transitions, 994 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 22:12:08,173 INFO L231 Difference]: Finished difference. Result has 178 places, 151 transitions, 552 flow [2025-03-08 22:12:08,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=552, PETRI_PLACES=178, PETRI_TRANSITIONS=151} [2025-03-08 22:12:08,174 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 42 predicate places. [2025-03-08 22:12:08,174 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 552 flow [2025-03-08 22:12:08,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 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:12:08,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:08,174 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:08,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 22:12:08,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 22:12:08,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1072302594, now seen corresponding path program 1 times [2025-03-08 22:12:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:08,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052441364] [2025-03-08 22:12:08,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:08,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 22:12:08,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 22:12:08,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:08,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:12:08,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:12:08,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 22:12:08,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 22:12:08,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:08,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:12:08,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:12:08,257 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:12:08,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-03-08 22:12:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-08 22:12:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-08 22:12:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-08 22:12:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-08 22:12:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-08 22:12:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-08 22:12:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-08 22:12:08,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-08 22:12:08,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 22:12:08,257 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:08,403 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-03-08 22:12:08,403 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:12:08,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:12:08 BasicIcfg [2025-03-08 22:12:08,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:12:08,413 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:12:08,413 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:12:08,413 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:12:08,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:11:36" (3/4) ... [2025-03-08 22:12:08,415 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 22:12:08,538 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 10. [2025-03-08 22:12:08,578 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:12:08,578 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:12:08,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:12:08,580 INFO L158 Benchmark]: Toolchain (without parser) took 32871.76ms. Allocated memory was 142.6MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 112.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. [2025-03-08 22:12:08,580 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:12:08,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.64ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 93.4MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:12:08,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.22ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:12:08,581 INFO L158 Benchmark]: Boogie Preprocessor took 28.70ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.4MB in the end (delta: 976.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:12:08,581 INFO L158 Benchmark]: IcfgBuilder took 294.29ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 75.0MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:12:08,581 INFO L158 Benchmark]: TraceAbstraction took 32020.63ms. Allocated memory was 142.6MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 74.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2025-03-08 22:12:08,582 INFO L158 Benchmark]: Witness Printer took 165.55ms. Allocated memory is still 5.8GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 22:12:08,583 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.64ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 93.4MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.22ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.70ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.4MB in the end (delta: 976.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 294.29ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 75.0MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 32020.63ms. Allocated memory was 142.6MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 74.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. * Witness Printer took 165.55ms. Allocated memory is still 5.8GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L681] 0 int data = 0; VAL [data=0] [L682] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L690] 0 int threads_total = 4; VAL [data=0, data_mutex={1:0}, threads_total=4] [L691] 0 pthread_t tids[4]; VAL [data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L692] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L685] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 4 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L687] 1 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L692] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L695] 0 int i = 0; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total - 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total - 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L687] 2 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] FCALL, JOIN 2 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L695] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total - 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L687] 3 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] FCALL, JOIN 3 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L695] COND FALSE 0 !(i < threads_total - 1) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L698] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L685] 4 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [698] and C: data = __VERIFIER_nondet_int() [685] - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 94 locations, 95 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 10 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 111 locations, 113 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 38 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 128 locations, 131 edges, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.2s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 777 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 572 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1149 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 68 mSDtfsCounter, 1149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=7, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 1292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 13/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 145 locations, 149 edges, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.4s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1612 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1270 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2867 IncrementalHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 105 mSDtfsCounter, 2867 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=16, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1325 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1130 ConstructedInterpolants, 0 QuantifiedInterpolants, 3028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 22:12:08,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)