./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/sssc12_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/sssc12_variant.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:26:37,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:26:37,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:26:37,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:26:37,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:26:37,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:26:37,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:26:37,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:26:37,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:26:37,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:26:37,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:26:37,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:26:37,994 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:26:37,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:26:37,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:26:37,994 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:26:37,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:37,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:26:37,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:26:37,996 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:26:37,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:26:37,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:26:37,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:26:37,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:26:37,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:26:37,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:26:37,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:26:37,996 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2025-02-08 05:26:38,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:26:38,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:26:38,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:26:38,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:26:38,248 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:26:38,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-02-08 05:26:39,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ea311e5f/b24c76fad56c4e22a8afe792999023a4/FLAG283f914d1 [2025-02-08 05:26:39,662 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:26:39,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-02-08 05:26:39,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ea311e5f/b24c76fad56c4e22a8afe792999023a4/FLAG283f914d1 [2025-02-08 05:26:39,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ea311e5f/b24c76fad56c4e22a8afe792999023a4 [2025-02-08 05:26:39,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:26:39,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:26:39,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:39,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:26:39,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:26:39,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:39" (1/1) ... [2025-02-08 05:26:39,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117156d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:39, skipping insertion in model container [2025-02-08 05:26:39,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:39" (1/1) ... [2025-02-08 05:26:39,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:26:40,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:40,316 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:26:40,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:40,393 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:26:40,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40 WrapperNode [2025-02-08 05:26:40,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:40,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:40,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:26:40,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:26:40,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,438 INFO L138 Inliner]: procedures = 272, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-02-08 05:26:40,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:40,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:26:40,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:26:40,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:26:40,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:26:40,482 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:26:40,482 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:26:40,482 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:26:40,483 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (1/1) ... [2025-02-08 05:26:40,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:40,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:26:40,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:26:40,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:26:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-02-08 05:26:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-02-08 05:26:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:26:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:26:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:26:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:26:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:26:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:26:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:26:40,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:26:40,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:26:40,535 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:26:40,626 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:26:40,627 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:26:40,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049: assume { :end_inline___VERIFIER_assert } true;havoc #t~mem9#1; [2025-02-08 05:26:40,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049-1: havoc __VERIFIER_assert_#in~cond#1; [2025-02-08 05:26:40,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049-2: havoc __VERIFIER_assert_~cond#1; [2025-02-08 05:26:40,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1050: ~c~0#1 := 1 + ~c~0#1; [2025-02-08 05:26:40,859 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:26:40,859 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:26:40,874 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:26:40,874 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:26:40,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:40 BoogieIcfgContainer [2025-02-08 05:26:40,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:26:40,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:26:40,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:26:40,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:26:40,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:26:39" (1/3) ... [2025-02-08 05:26:40,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42710ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:40, skipping insertion in model container [2025-02-08 05:26:40,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:40" (2/3) ... [2025-02-08 05:26:40,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42710ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:40, skipping insertion in model container [2025-02-08 05:26:40,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:40" (3/3) ... [2025-02-08 05:26:40,885 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2025-02-08 05:26:40,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:26:40,903 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12_variant.i that has 2 procedures, 154 locations, 1 initial locations, 2 loop locations, and 17 error locations. [2025-02-08 05:26:40,903 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:26:40,974 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:41,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 159 transitions, 322 flow [2025-02-08 05:26:41,058 INFO L124 PetriNetUnfolderBase]: 5/168 cut-off events. [2025-02-08 05:26:41,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 168 events. 5/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2025-02-08 05:26:41,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 159 transitions, 322 flow [2025-02-08 05:26:41,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 159 transitions, 322 flow [2025-02-08 05:26:41,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:41,091 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;@36e969f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:41,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-08 05:26:41,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:41,097 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:26:41,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:41,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:41,098 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-02-08 05:26:41,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:26:41,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash 592911773, now seen corresponding path program 1 times [2025-02-08 05:26:41,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:41,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047216895] [2025-02-08 05:26:41,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:41,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:41,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:26:41,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:26:41,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047216895] [2025-02-08 05:26:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047216895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:41,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:41,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651416115] [2025-02-08 05:26:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:41,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:41,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:41,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:41,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 159 [2025-02-08 05:26:41,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 159 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:41,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:41,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 159 [2025-02-08 05:26:41,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:41,349 INFO L124 PetriNetUnfolderBase]: 2/150 cut-off events. [2025-02-08 05:26:41,349 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:41,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 150 events. 2/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 11/140 useless extension candidates. Maximal degree in co-relation 87. Up to 11 conditions per place. [2025-02-08 05:26:41,350 INFO L140 encePairwiseOnDemand]: 152/159 looper letters, 10 selfloop transitions, 2 changer transitions 1/147 dead transitions. [2025-02-08 05:26:41,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 147 transitions, 322 flow [2025-02-08 05:26:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2025-02-08 05:26:41,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9161425576519916 [2025-02-08 05:26:41,369 INFO L175 Difference]: Start difference. First operand has 157 places, 159 transitions, 322 flow. Second operand 3 states and 437 transitions. [2025-02-08 05:26:41,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 147 transitions, 322 flow [2025-02-08 05:26:41,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:26:41,380 INFO L231 Difference]: Finished difference. Result has 150 places, 146 transitions, 300 flow [2025-02-08 05:26:41,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=150, PETRI_TRANSITIONS=146} [2025-02-08 05:26:41,387 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -7 predicate places. [2025-02-08 05:26:41,387 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 146 transitions, 300 flow [2025-02-08 05:26:41,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:41,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:41,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:41,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:26:41,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:26:41,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1464219447, now seen corresponding path program 1 times [2025-02-08 05:26:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:41,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202614199] [2025-02-08 05:26:41,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:41,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:26:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:26:41,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:41,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:41,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202614199] [2025-02-08 05:26:41,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202614199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:41,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:41,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:41,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988923433] [2025-02-08 05:26:41,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:41,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:41,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:41,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:41,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:41,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 159 [2025-02-08 05:26:41,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 146 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:41,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:41,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 159 [2025-02-08 05:26:41,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:41,561 INFO L124 PetriNetUnfolderBase]: 2/148 cut-off events. [2025-02-08 05:26:41,561 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:41,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 148 events. 2/148 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 135. Up to 11 conditions per place. [2025-02-08 05:26:41,562 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 10 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-02-08 05:26:41,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 145 transitions, 322 flow [2025-02-08 05:26:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2025-02-08 05:26:41,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9077568134171907 [2025-02-08 05:26:41,564 INFO L175 Difference]: Start difference. First operand has 150 places, 146 transitions, 300 flow. Second operand 3 states and 433 transitions. [2025-02-08 05:26:41,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 145 transitions, 322 flow [2025-02-08 05:26:41,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:41,569 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 298 flow [2025-02-08 05:26:41,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2025-02-08 05:26:41,570 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -9 predicate places. [2025-02-08 05:26:41,570 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 298 flow [2025-02-08 05:26:41,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:41,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:41,571 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] [2025-02-08 05:26:41,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:26:41,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:26:41,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:41,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1320468177, now seen corresponding path program 1 times [2025-02-08 05:26:41,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:41,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410508762] [2025-02-08 05:26:41,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:41,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:41,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:26:41,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:26:41,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:41,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:41,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410508762] [2025-02-08 05:26:41,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410508762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:41,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:41,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890666204] [2025-02-08 05:26:41,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:41,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:41,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:41,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:41,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:41,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 159 [2025-02-08 05:26:41,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 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-02-08 05:26:41,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:41,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 159 [2025-02-08 05:26:41,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:41,681 INFO L124 PetriNetUnfolderBase]: 2/144 cut-off events. [2025-02-08 05:26:41,682 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:26:41,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 144 events. 2/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 123. Up to 11 conditions per place. [2025-02-08 05:26:41,684 INFO L140 encePairwiseOnDemand]: 154/159 looper letters, 11 selfloop transitions, 1 changer transitions 0/141 dead transitions. [2025-02-08 05:26:41,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 141 transitions, 314 flow [2025-02-08 05:26:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2025-02-08 05:26:41,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9014675052410901 [2025-02-08 05:26:41,686 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 298 flow. Second operand 3 states and 430 transitions. [2025-02-08 05:26:41,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 141 transitions, 314 flow [2025-02-08 05:26:41,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:41,693 INFO L231 Difference]: Finished difference. Result has 144 places, 141 transitions, 288 flow [2025-02-08 05:26:41,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=144, PETRI_TRANSITIONS=141} [2025-02-08 05:26:41,693 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -13 predicate places. [2025-02-08 05:26:41,694 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 141 transitions, 288 flow [2025-02-08 05:26:41,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 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-02-08 05:26:41,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:41,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:41,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:26:41,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:26:41,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:41,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1944795429, now seen corresponding path program 1 times [2025-02-08 05:26:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:41,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893129447] [2025-02-08 05:26:41,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:41,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:41,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:26:41,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:26:41,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:41,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:41,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893129447] [2025-02-08 05:26:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893129447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:41,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:41,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535916925] [2025-02-08 05:26:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:41,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:41,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:41,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:41,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2025-02-08 05:26:41,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 141 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:41,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:41,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2025-02-08 05:26:41,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:41,816 INFO L124 PetriNetUnfolderBase]: 2/143 cut-off events. [2025-02-08 05:26:41,817 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:41,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 143 events. 2/143 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 120. Up to 10 conditions per place. [2025-02-08 05:26:41,818 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 9 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2025-02-08 05:26:41,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 140 transitions, 308 flow [2025-02-08 05:26:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2025-02-08 05:26:41,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9119496855345912 [2025-02-08 05:26:41,819 INFO L175 Difference]: Start difference. First operand has 144 places, 141 transitions, 288 flow. Second operand 3 states and 435 transitions. [2025-02-08 05:26:41,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 140 transitions, 308 flow [2025-02-08 05:26:41,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 140 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:41,822 INFO L231 Difference]: Finished difference. Result has 144 places, 140 transitions, 289 flow [2025-02-08 05:26:41,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=144, PETRI_TRANSITIONS=140} [2025-02-08 05:26:41,824 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -13 predicate places. [2025-02-08 05:26:41,824 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 140 transitions, 289 flow [2025-02-08 05:26:41,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:41,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:41,825 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:26:41,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:26:41,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:26:41,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash 74662326, now seen corresponding path program 1 times [2025-02-08 05:26:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:41,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359066186] [2025-02-08 05:26:41,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:41,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:26:41,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:26:41,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:41,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:41,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359066186] [2025-02-08 05:26:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359066186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:41,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:41,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:26:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53273813] [2025-02-08 05:26:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:26:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:41,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:26:41,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:26:42,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 159 [2025-02-08 05:26:42,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 140 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:42,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:42,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 159 [2025-02-08 05:26:42,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:42,064 INFO L124 PetriNetUnfolderBase]: 1/146 cut-off events. [2025-02-08 05:26:42,065 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:42,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 146 events. 1/146 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 83 event pairs, 0 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 132. Up to 15 conditions per place. [2025-02-08 05:26:42,065 INFO L140 encePairwiseOnDemand]: 155/159 looper letters, 14 selfloop transitions, 0 changer transitions 4/143 dead transitions. [2025-02-08 05:26:42,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 143 transitions, 331 flow [2025-02-08 05:26:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:26:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:26:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2025-02-08 05:26:42,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8855345911949686 [2025-02-08 05:26:42,068 INFO L175 Difference]: Start difference. First operand has 144 places, 140 transitions, 289 flow. Second operand 5 states and 704 transitions. [2025-02-08 05:26:42,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 143 transitions, 331 flow [2025-02-08 05:26:42,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 143 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:42,071 INFO L231 Difference]: Finished difference. Result has 149 places, 139 transitions, 289 flow [2025-02-08 05:26:42,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=149, PETRI_TRANSITIONS=139} [2025-02-08 05:26:42,073 INFO L279 CegarLoopForPetriNet]: 157 programPoint places, -8 predicate places. [2025-02-08 05:26:42,073 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 139 transitions, 289 flow [2025-02-08 05:26:42,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:42,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:42,074 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:26:42,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:26:42,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-02-08 05:26:42,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash -583471967, now seen corresponding path program 1 times [2025-02-08 05:26:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380519190] [2025-02-08 05:26:42,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:42,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:26:42,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:26:42,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:42,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:42,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:26:42,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:26:42,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:42,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:42,134 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:42,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-02-08 05:26:42,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-02-08 05:26:42,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-02-08 05:26:42,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-02-08 05:26:42,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-02-08 05:26:42,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-02-08 05:26:42,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-02-08 05:26:42,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-02-08 05:26:42,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-02-08 05:26:42,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:26:42,139 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-08 05:26:42,141 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:26:42,141 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:26:42,183 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:42,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 240 transitions, 490 flow [2025-02-08 05:26:42,213 INFO L124 PetriNetUnfolderBase]: 8/260 cut-off events. [2025-02-08 05:26:42,213 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:26:42,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 260 events. 8/260 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 513 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 171. Up to 3 conditions per place. [2025-02-08 05:26:42,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 240 transitions, 490 flow [2025-02-08 05:26:42,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 240 transitions, 490 flow [2025-02-08 05:26:42,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:42,237 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;@36e969f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:42,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-02-08 05:26:42,239 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:42,239 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:26:42,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:42,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:42,239 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-02-08 05:26:42,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-02-08 05:26:42,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash 841070221, now seen corresponding path program 1 times [2025-02-08 05:26:42,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:42,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333778044] [2025-02-08 05:26:42,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:42,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:26:42,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:26:42,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:42,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:42,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333778044] [2025-02-08 05:26:42,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333778044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:42,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:42,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:42,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398776725] [2025-02-08 05:26:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:42,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:42,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:42,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:42,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:42,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 240 [2025-02-08 05:26:42,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 240 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 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-02-08 05:26:42,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:42,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 240 [2025-02-08 05:26:42,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:42,377 INFO L124 PetriNetUnfolderBase]: 52/771 cut-off events. [2025-02-08 05:26:42,378 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:26:42,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 771 events. 52/771 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4354 event pairs, 42 based on Foata normal form. 76/714 useless extension candidates. Maximal degree in co-relation 703. Up to 102 conditions per place. [2025-02-08 05:26:42,382 INFO L140 encePairwiseOnDemand]: 231/240 looper letters, 17 selfloop transitions, 2 changer transitions 1/224 dead transitions. [2025-02-08 05:26:42,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 224 transitions, 496 flow [2025-02-08 05:26:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-02-08 05:26:42,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9152777777777777 [2025-02-08 05:26:42,384 INFO L175 Difference]: Start difference. First operand has 237 places, 240 transitions, 490 flow. Second operand 3 states and 659 transitions. [2025-02-08 05:26:42,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 224 transitions, 496 flow [2025-02-08 05:26:42,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 224 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:26:42,386 INFO L231 Difference]: Finished difference. Result has 228 places, 223 transitions, 460 flow [2025-02-08 05:26:42,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=228, PETRI_TRANSITIONS=223} [2025-02-08 05:26:42,387 INFO L279 CegarLoopForPetriNet]: 237 programPoint places, -9 predicate places. [2025-02-08 05:26:42,387 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 223 transitions, 460 flow [2025-02-08 05:26:42,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 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-02-08 05:26:42,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:42,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:42,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:26:42,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-02-08 05:26:42,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1174673207, now seen corresponding path program 1 times [2025-02-08 05:26:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185707636] [2025-02-08 05:26:42,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:42,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:26:42,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:26:42,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:42,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:42,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185707636] [2025-02-08 05:26:42,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185707636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:42,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:42,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744489011] [2025-02-08 05:26:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:42,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:42,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:42,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:42,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:42,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 240 [2025-02-08 05:26:42,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 223 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:42,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:42,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 240 [2025-02-08 05:26:42,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:42,483 INFO L124 PetriNetUnfolderBase]: 19/526 cut-off events. [2025-02-08 05:26:42,483 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:26:42,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 526 events. 19/526 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2373 event pairs, 12 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 553. Up to 39 conditions per place. [2025-02-08 05:26:42,486 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 14 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-02-08 05:26:42,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 222 transitions, 490 flow [2025-02-08 05:26:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-02-08 05:26:42,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9152777777777777 [2025-02-08 05:26:42,488 INFO L175 Difference]: Start difference. First operand has 228 places, 223 transitions, 460 flow. Second operand 3 states and 659 transitions. [2025-02-08 05:26:42,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 222 transitions, 490 flow [2025-02-08 05:26:42,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 222 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:42,491 INFO L231 Difference]: Finished difference. Result has 226 places, 222 transitions, 458 flow [2025-02-08 05:26:42,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=226, PETRI_TRANSITIONS=222} [2025-02-08 05:26:42,492 INFO L279 CegarLoopForPetriNet]: 237 programPoint places, -11 predicate places. [2025-02-08 05:26:42,492 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 222 transitions, 458 flow [2025-02-08 05:26:42,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:42,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:42,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:42,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:26:42,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-02-08 05:26:42,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash -336373039, now seen corresponding path program 1 times [2025-02-08 05:26:42,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:42,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275089309] [2025-02-08 05:26:42,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:42,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:26:42,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:26:42,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:42,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:42,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275089309] [2025-02-08 05:26:42,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275089309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:42,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:42,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669483091] [2025-02-08 05:26:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:42,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:42,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:42,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:42,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:42,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 240 [2025-02-08 05:26:42,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 222 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:42,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:42,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 240 [2025-02-08 05:26:42,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:42,599 INFO L124 PetriNetUnfolderBase]: 30/711 cut-off events. [2025-02-08 05:26:42,599 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:26:42,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 711 events. 30/711 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3968 event pairs, 20 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 750. Up to 56 conditions per place. [2025-02-08 05:26:42,602 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 16 selfloop transitions, 1 changer transitions 0/217 dead transitions. [2025-02-08 05:26:42,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 217 transitions, 482 flow [2025-02-08 05:26:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-02-08 05:26:42,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055555555555556 [2025-02-08 05:26:42,604 INFO L175 Difference]: Start difference. First operand has 226 places, 222 transitions, 458 flow. Second operand 3 states and 652 transitions. [2025-02-08 05:26:42,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 217 transitions, 482 flow [2025-02-08 05:26:42,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 217 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:42,606 INFO L231 Difference]: Finished difference. Result has 221 places, 217 transitions, 446 flow [2025-02-08 05:26:42,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=221, PETRI_TRANSITIONS=217} [2025-02-08 05:26:42,607 INFO L279 CegarLoopForPetriNet]: 237 programPoint places, -16 predicate places. [2025-02-08 05:26:42,607 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 217 transitions, 446 flow [2025-02-08 05:26:42,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:42,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:42,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:42,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:26:42,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-02-08 05:26:42,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash -574569179, now seen corresponding path program 1 times [2025-02-08 05:26:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246061604] [2025-02-08 05:26:42,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:42,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:26:42,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:26:42,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:42,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:42,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246061604] [2025-02-08 05:26:42,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246061604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:42,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:42,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:42,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665822880] [2025-02-08 05:26:42,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:42,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:42,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:42,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:42,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 240 [2025-02-08 05:26:42,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 217 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:42,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:42,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 240 [2025-02-08 05:26:42,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:42,742 INFO L124 PetriNetUnfolderBase]: 39/674 cut-off events. [2025-02-08 05:26:42,742 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:26:42,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 674 events. 39/674 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3393 event pairs, 30 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 735. Up to 76 conditions per place. [2025-02-08 05:26:42,749 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 15 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-02-08 05:26:42,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 216 transitions, 478 flow [2025-02-08 05:26:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2025-02-08 05:26:42,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9125 [2025-02-08 05:26:42,751 INFO L175 Difference]: Start difference. First operand has 221 places, 217 transitions, 446 flow. Second operand 3 states and 657 transitions. [2025-02-08 05:26:42,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 216 transitions, 478 flow [2025-02-08 05:26:42,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 216 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:42,756 INFO L231 Difference]: Finished difference. Result has 221 places, 216 transitions, 447 flow [2025-02-08 05:26:42,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=221, PETRI_TRANSITIONS=216} [2025-02-08 05:26:42,757 INFO L279 CegarLoopForPetriNet]: 237 programPoint places, -16 predicate places. [2025-02-08 05:26:42,757 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 216 transitions, 447 flow [2025-02-08 05:26:42,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:42,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:42,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:42,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:26:42,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-02-08 05:26:42,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash 818078899, now seen corresponding path program 1 times [2025-02-08 05:26:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:42,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411043827] [2025-02-08 05:26:42,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:42,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:26:42,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:26:42,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:42,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:42,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:42,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411043827] [2025-02-08 05:26:42,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411043827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:42,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:42,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:42,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792216017] [2025-02-08 05:26:42,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:42,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:42,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:42,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:42,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:42,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 240 [2025-02-08 05:26:42,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 216 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:42,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:42,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 240 [2025-02-08 05:26:42,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:42,995 INFO L124 PetriNetUnfolderBase]: 133/1969 cut-off events. [2025-02-08 05:26:42,995 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:26:42,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 1969 events. 133/1969 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 16329 event pairs, 57 based on Foata normal form. 0/1665 useless extension candidates. Maximal degree in co-relation 2257. Up to 204 conditions per place. [2025-02-08 05:26:43,004 INFO L140 encePairwiseOnDemand]: 220/240 looper letters, 32 selfloop transitions, 14 changer transitions 0/235 dead transitions. [2025-02-08 05:26:43,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 235 transitions, 582 flow [2025-02-08 05:26:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-02-08 05:26:43,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9263888888888889 [2025-02-08 05:26:43,006 INFO L175 Difference]: Start difference. First operand has 221 places, 216 transitions, 447 flow. Second operand 3 states and 667 transitions. [2025-02-08 05:26:43,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 235 transitions, 582 flow [2025-02-08 05:26:43,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 235 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:43,010 INFO L231 Difference]: Finished difference. Result has 223 places, 230 transitions, 567 flow [2025-02-08 05:26:43,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=567, PETRI_PLACES=223, PETRI_TRANSITIONS=230} [2025-02-08 05:26:43,010 INFO L279 CegarLoopForPetriNet]: 237 programPoint places, -14 predicate places. [2025-02-08 05:26:43,011 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 230 transitions, 567 flow [2025-02-08 05:26:43,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:43,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:43,012 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2025-02-08 05:26:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:26:43,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-02-08 05:26:43,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash 792374963, now seen corresponding path program 1 times [2025-02-08 05:26:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925349164] [2025-02-08 05:26:43,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:43,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:26:43,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:26:43,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:43,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:43,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925349164] [2025-02-08 05:26:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925349164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:43,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:26:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595763830] [2025-02-08 05:26:43,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:43,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:26:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:43,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:26:43,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:26:43,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 240 [2025-02-08 05:26:43,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 230 transitions, 567 flow. Second operand has 5 states, 5 states have (on average 214.4) internal successors, (1072), 5 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:43,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:43,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 240 [2025-02-08 05:26:43,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:43,268 INFO L124 PetriNetUnfolderBase]: 68/1866 cut-off events. [2025-02-08 05:26:43,268 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:26:43,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 1866 events. 68/1866 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15386 event pairs, 41 based on Foata normal form. 1/1578 useless extension candidates. Maximal degree in co-relation 2096. Up to 120 conditions per place. [2025-02-08 05:26:43,276 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 17 selfloop transitions, 0 changer transitions 4/233 dead transitions. [2025-02-08 05:26:43,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 233 transitions, 615 flow [2025-02-08 05:26:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:26:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:26:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1082 transitions. [2025-02-08 05:26:43,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9016666666666666 [2025-02-08 05:26:43,278 INFO L175 Difference]: Start difference. First operand has 223 places, 230 transitions, 567 flow. Second operand 5 states and 1082 transitions. [2025-02-08 05:26:43,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 233 transitions, 615 flow [2025-02-08 05:26:43,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 233 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:43,282 INFO L231 Difference]: Finished difference. Result has 228 places, 229 transitions, 543 flow [2025-02-08 05:26:43,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=543, PETRI_PLACES=228, PETRI_TRANSITIONS=229} [2025-02-08 05:26:43,283 INFO L279 CegarLoopForPetriNet]: 237 programPoint places, -9 predicate places. [2025-02-08 05:26:43,283 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 229 transitions, 543 flow [2025-02-08 05:26:43,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.4) internal successors, (1072), 5 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:43,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:43,283 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2025-02-08 05:26:43,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:26:43,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-02-08 05:26:43,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash -853840818, now seen corresponding path program 1 times [2025-02-08 05:26:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:43,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129794322] [2025-02-08 05:26:43,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:43,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:26:43,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:26:43,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:43,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:43,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:43,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 05:26:43,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 05:26:43,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:43,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:43,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:43,318 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-02-08 05:26:43,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-02-08 05:26:43,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-02-08 05:26:43,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:26:43,319 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:43,320 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:26:43,320 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:26:43,357 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:43,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 317 places, 321 transitions, 660 flow [2025-02-08 05:26:43,387 INFO L124 PetriNetUnfolderBase]: 11/352 cut-off events. [2025-02-08 05:26:43,388 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:26:43,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 352 events. 11/352 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1007 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 264. Up to 4 conditions per place. [2025-02-08 05:26:43,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 317 places, 321 transitions, 660 flow [2025-02-08 05:26:43,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 317 places, 321 transitions, 660 flow [2025-02-08 05:26:43,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:43,396 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;@36e969f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:43,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-02-08 05:26:43,398 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:43,398 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:26:43,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:43,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:43,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:43,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:26:43,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1833494962, now seen corresponding path program 1 times [2025-02-08 05:26:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:43,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065249853] [2025-02-08 05:26:43,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:43,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:26:43,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:26:43,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:43,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065249853] [2025-02-08 05:26:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065249853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478678306] [2025-02-08 05:26:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:43,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:43,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:43,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:43,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:43,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 321 [2025-02-08 05:26:43,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 321 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:43,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:43,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 321 [2025-02-08 05:26:43,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:43,983 INFO L124 PetriNetUnfolderBase]: 697/5417 cut-off events. [2025-02-08 05:26:43,984 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-02-08 05:26:44,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 5417 events. 697/5417 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 57631 event pairs, 630 based on Foata normal form. 539/5025 useless extension candidates. Maximal degree in co-relation 5489. Up to 1033 conditions per place. [2025-02-08 05:26:44,089 INFO L140 encePairwiseOnDemand]: 310/321 looper letters, 24 selfloop transitions, 2 changer transitions 1/301 dead transitions. [2025-02-08 05:26:44,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 301 transitions, 672 flow [2025-02-08 05:26:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2025-02-08 05:26:44,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9148494288681205 [2025-02-08 05:26:44,092 INFO L175 Difference]: Start difference. First operand has 317 places, 321 transitions, 660 flow. Second operand 3 states and 881 transitions. [2025-02-08 05:26:44,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 301 transitions, 672 flow [2025-02-08 05:26:44,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 301 transitions, 670 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:26:44,096 INFO L231 Difference]: Finished difference. Result has 306 places, 300 transitions, 620 flow [2025-02-08 05:26:44,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=306, PETRI_TRANSITIONS=300} [2025-02-08 05:26:44,097 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, -11 predicate places. [2025-02-08 05:26:44,097 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 300 transitions, 620 flow [2025-02-08 05:26:44,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:44,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:44,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:44,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:26:44,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:26:44,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1861146935, now seen corresponding path program 1 times [2025-02-08 05:26:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166838858] [2025-02-08 05:26:44,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:44,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:26:44,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:26:44,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:44,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:44,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166838858] [2025-02-08 05:26:44,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166838858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:44,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:44,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:44,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93131172] [2025-02-08 05:26:44,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:44,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:44,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:44,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:44,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:44,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 321 [2025-02-08 05:26:44,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 300 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:44,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:44,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 321 [2025-02-08 05:26:44,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:44,351 INFO L124 PetriNetUnfolderBase]: 136/2124 cut-off events. [2025-02-08 05:26:44,351 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 05:26:44,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 2124 events. 136/2124 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 18162 event pairs, 108 based on Foata normal form. 0/1741 useless extension candidates. Maximal degree in co-relation 2359. Up to 199 conditions per place. [2025-02-08 05:26:44,365 INFO L140 encePairwiseOnDemand]: 318/321 looper letters, 18 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2025-02-08 05:26:44,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 299 transitions, 658 flow [2025-02-08 05:26:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2025-02-08 05:26:44,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2025-02-08 05:26:44,367 INFO L175 Difference]: Start difference. First operand has 306 places, 300 transitions, 620 flow. Second operand 3 states and 885 transitions. [2025-02-08 05:26:44,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 299 transitions, 658 flow [2025-02-08 05:26:44,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 299 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:44,371 INFO L231 Difference]: Finished difference. Result has 304 places, 299 transitions, 618 flow [2025-02-08 05:26:44,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=304, PETRI_TRANSITIONS=299} [2025-02-08 05:26:44,372 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, -13 predicate places. [2025-02-08 05:26:44,372 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 299 transitions, 618 flow [2025-02-08 05:26:44,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 289.3333333333333) internal successors, (868), 3 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:44,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:44,372 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] [2025-02-08 05:26:44,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:26:44,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:26:44,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1044636945, now seen corresponding path program 1 times [2025-02-08 05:26:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596532833] [2025-02-08 05:26:44,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:44,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:26:44,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:26:44,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:44,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596532833] [2025-02-08 05:26:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596532833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:44,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447100988] [2025-02-08 05:26:44,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:44,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:44,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:44,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:44,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 321 [2025-02-08 05:26:44,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 299 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:44,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:44,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 321 [2025-02-08 05:26:44,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:44,803 INFO L124 PetriNetUnfolderBase]: 273/3788 cut-off events. [2025-02-08 05:26:44,803 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-02-08 05:26:44,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4270 conditions, 3788 events. 273/3788 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 38946 event pairs, 220 based on Foata normal form. 0/3131 useless extension candidates. Maximal degree in co-relation 4227. Up to 381 conditions per place. [2025-02-08 05:26:44,838 INFO L140 encePairwiseOnDemand]: 314/321 looper letters, 21 selfloop transitions, 1 changer transitions 0/293 dead transitions. [2025-02-08 05:26:44,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 293 transitions, 650 flow [2025-02-08 05:26:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2025-02-08 05:26:44,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9075804776739356 [2025-02-08 05:26:44,840 INFO L175 Difference]: Start difference. First operand has 304 places, 299 transitions, 618 flow. Second operand 3 states and 874 transitions. [2025-02-08 05:26:44,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 293 transitions, 650 flow [2025-02-08 05:26:44,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 293 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:44,844 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 604 flow [2025-02-08 05:26:44,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2025-02-08 05:26:44,845 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, -19 predicate places. [2025-02-08 05:26:44,845 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 604 flow [2025-02-08 05:26:44,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:44,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:44,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:44,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:26:44,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:26:44,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:44,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2015047781, now seen corresponding path program 1 times [2025-02-08 05:26:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:44,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978614760] [2025-02-08 05:26:44,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:44,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:44,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:26:44,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:26:44,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:44,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978614760] [2025-02-08 05:26:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978614760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:44,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992831696] [2025-02-08 05:26:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:44,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 321 [2025-02-08 05:26:44,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:44,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:44,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 321 [2025-02-08 05:26:44,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:45,341 INFO L124 PetriNetUnfolderBase]: 442/4055 cut-off events. [2025-02-08 05:26:45,342 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-02-08 05:26:45,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4843 conditions, 4055 events. 442/4055 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 39105 event pairs, 390 based on Foata normal form. 0/3364 useless extension candidates. Maximal degree in co-relation 4800. Up to 652 conditions per place. [2025-02-08 05:26:45,366 INFO L140 encePairwiseOnDemand]: 318/321 looper letters, 21 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-02-08 05:26:45,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 292 transitions, 648 flow [2025-02-08 05:26:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2025-02-08 05:26:45,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9127725856697819 [2025-02-08 05:26:45,368 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 604 flow. Second operand 3 states and 879 transitions. [2025-02-08 05:26:45,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 292 transitions, 648 flow [2025-02-08 05:26:45,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 292 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:45,371 INFO L231 Difference]: Finished difference. Result has 298 places, 292 transitions, 605 flow [2025-02-08 05:26:45,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=298, PETRI_TRANSITIONS=292} [2025-02-08 05:26:45,372 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, -19 predicate places. [2025-02-08 05:26:45,372 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 292 transitions, 605 flow [2025-02-08 05:26:45,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:45,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:45,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:45,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:26:45,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:26:45,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2106277684, now seen corresponding path program 1 times [2025-02-08 05:26:45,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:45,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429563874] [2025-02-08 05:26:45,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:45,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:26:45,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:26:45,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:45,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429563874] [2025-02-08 05:26:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429563874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:45,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041234987] [2025-02-08 05:26:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:45,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:45,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:45,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:45,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:45,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 321 [2025-02-08 05:26:45,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 292 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:45,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:45,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 321 [2025-02-08 05:26:45,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:47,863 INFO L124 PetriNetUnfolderBase]: 3742/29492 cut-off events. [2025-02-08 05:26:47,864 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-02-08 05:26:47,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35951 conditions, 29492 events. 3742/29492 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 437246 event pairs, 1667 based on Foata normal form. 0/24692 useless extension candidates. Maximal degree in co-relation 35908. Up to 4132 conditions per place. [2025-02-08 05:26:48,048 INFO L140 encePairwiseOnDemand]: 291/321 looper letters, 48 selfloop transitions, 21 changer transitions 0/321 dead transitions. [2025-02-08 05:26:48,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 321 transitions, 811 flow [2025-02-08 05:26:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2025-02-08 05:26:48,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9221183800623053 [2025-02-08 05:26:48,051 INFO L175 Difference]: Start difference. First operand has 298 places, 292 transitions, 605 flow. Second operand 3 states and 888 transitions. [2025-02-08 05:26:48,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 321 transitions, 811 flow [2025-02-08 05:26:48,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 321 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:48,056 INFO L231 Difference]: Finished difference. Result has 300 places, 313 transitions, 787 flow [2025-02-08 05:26:48,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=300, PETRI_TRANSITIONS=313} [2025-02-08 05:26:48,057 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, -17 predicate places. [2025-02-08 05:26:48,058 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 313 transitions, 787 flow [2025-02-08 05:26:48,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:48,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:48,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:48,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:26:48,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:26:48,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1080702115, now seen corresponding path program 1 times [2025-02-08 05:26:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:48,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486225696] [2025-02-08 05:26:48,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:48,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:48,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:26:48,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:26:48,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:48,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:48,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486225696] [2025-02-08 05:26:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486225696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:48,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:48,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:26:48,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068141850] [2025-02-08 05:26:48,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:48,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:26:48,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:48,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:26:48,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:26:48,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 321 [2025-02-08 05:26:48,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 313 transitions, 787 flow. Second operand has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:48,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:48,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 321 [2025-02-08 05:26:48,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:49,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][152], [Black: 332#true, 337#true, 334#(= |#race~next~0| 0), 99#L1061-1true, 194#L1045true, 314#true, 85#L1043-7true, 316#true, 328#(= |#race~len~0| 0), 318#true, 68#L1045true]) [2025-02-08 05:26:49,017 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-02-08 05:26:49,017 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:26:49,017 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:26:49,017 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-02-08 05:26:49,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][154], [194#L1045true, 99#L1061-1true, 314#true, 332#true, 316#true, 135#L1045true, 328#(= |#race~len~0| 0), 318#true, 340#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 68#L1045true, Black: 334#(= |#race~next~0| 0)]) [2025-02-08 05:26:49,581 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-02-08 05:26:49,581 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-08 05:26:49,581 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-08 05:26:49,581 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-08 05:26:49,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][152], [337#true, 99#L1061-1true, 194#L1045true, 314#true, 332#true, 85#L1043-7true, 316#true, 328#(= |#race~len~0| 0), 318#true, 68#L1045true, Black: 334#(= |#race~next~0| 0)]) [2025-02-08 05:26:49,645 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-02-08 05:26:49,646 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-02-08 05:26:49,646 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-02-08 05:26:49,646 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-02-08 05:26:49,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][152], [337#true, 99#L1061-1true, 194#L1045true, 314#true, 332#true, 316#true, 328#(= |#race~len~0| 0), 254#L1043-4true, 318#true, 68#L1045true, Black: 334#(= |#race~next~0| 0)]) [2025-02-08 05:26:49,774 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2025-02-08 05:26:49,774 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:26:49,774 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:26:49,774 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-02-08 05:26:50,756 INFO L124 PetriNetUnfolderBase]: 2626/28777 cut-off events. [2025-02-08 05:26:50,756 INFO L125 PetriNetUnfolderBase]: For 856/864 co-relation queries the response was YES. [2025-02-08 05:26:50,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35305 conditions, 28777 events. 2626/28777 cut-off events. For 856/864 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 441600 event pairs, 1434 based on Foata normal form. 59/24444 useless extension candidates. Maximal degree in co-relation 35262. Up to 2767 conditions per place. [2025-02-08 05:26:50,976 INFO L140 encePairwiseOnDemand]: 317/321 looper letters, 26 selfloop transitions, 3 changer transitions 0/326 dead transitions. [2025-02-08 05:26:50,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 326 transitions, 891 flow [2025-02-08 05:26:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:26:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:26:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1206 transitions. [2025-02-08 05:26:50,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9392523364485982 [2025-02-08 05:26:50,979 INFO L175 Difference]: Start difference. First operand has 300 places, 313 transitions, 787 flow. Second operand 4 states and 1206 transitions. [2025-02-08 05:26:50,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 326 transitions, 891 flow [2025-02-08 05:26:51,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 326 transitions, 849 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:51,005 INFO L231 Difference]: Finished difference. Result has 302 places, 313 transitions, 755 flow [2025-02-08 05:26:51,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=755, PETRI_PLACES=302, PETRI_TRANSITIONS=313} [2025-02-08 05:26:51,006 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, -15 predicate places. [2025-02-08 05:26:51,006 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 313 transitions, 755 flow [2025-02-08 05:26:51,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:51,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:51,007 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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] [2025-02-08 05:26:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:26:51,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:26:51,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:51,007 INFO L85 PathProgramCache]: Analyzing trace with hash -505139567, now seen corresponding path program 1 times [2025-02-08 05:26:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147102232] [2025-02-08 05:26:51,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:51,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:51,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:26:51,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:26:51,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:51,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:51,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:51,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147102232] [2025-02-08 05:26:51,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147102232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:51,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:51,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:26:51,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154752907] [2025-02-08 05:26:51,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:51,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:26:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:51,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:26:51,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:26:51,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 321 [2025-02-08 05:26:51,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 313 transitions, 755 flow. Second operand has 5 states, 5 states have (on average 289.6) internal successors, (1448), 5 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:51,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:51,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 321 [2025-02-08 05:26:51,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:52,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([986] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][144], [Black: 332#true, 337#true, 99#L1061-1true, 194#L1045true, 314#true, Black: 340#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 316#true, 257#L1043true, 328#(= |#race~len~0| 0), 318#true, 68#L1045true, 342#true]) [2025-02-08 05:26:52,374 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-02-08 05:26:52,374 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-08 05:26:52,374 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-02-08 05:26:52,374 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-02-08 05:26:52,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1066] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][115], [99#L1061-1true, 194#L1045true, 314#true, 316#true, 135#L1045true, 328#(= |#race~len~0| 0), 318#true, 340#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 68#L1045true, Black: 334#(= |#race~next~0| 0), 342#true]) [2025-02-08 05:26:52,427 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-02-08 05:26:52,427 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-02-08 05:26:52,427 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-02-08 05:26:52,427 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-02-08 05:26:53,354 INFO L124 PetriNetUnfolderBase]: 1874/22652 cut-off events. [2025-02-08 05:26:53,355 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-02-08 05:26:53,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26697 conditions, 22652 events. 1874/22652 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 335209 event pairs, 1151 based on Foata normal form. 1/18991 useless extension candidates. Maximal degree in co-relation 26652. Up to 2300 conditions per place. [2025-02-08 05:26:53,463 INFO L140 encePairwiseOnDemand]: 317/321 looper letters, 20 selfloop transitions, 0 changer transitions 4/316 dead transitions. [2025-02-08 05:26:53,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 316 transitions, 809 flow [2025-02-08 05:26:53,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:26:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:26:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1460 transitions. [2025-02-08 05:26:53,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9096573208722741 [2025-02-08 05:26:53,465 INFO L175 Difference]: Start difference. First operand has 302 places, 313 transitions, 755 flow. Second operand 5 states and 1460 transitions. [2025-02-08 05:26:53,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 316 transitions, 809 flow [2025-02-08 05:26:53,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 316 transitions, 803 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:26:53,469 INFO L231 Difference]: Finished difference. Result has 306 places, 312 transitions, 753 flow [2025-02-08 05:26:53,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=753, PETRI_PLACES=306, PETRI_TRANSITIONS=312} [2025-02-08 05:26:53,470 INFO L279 CegarLoopForPetriNet]: 317 programPoint places, -11 predicate places. [2025-02-08 05:26:53,470 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 312 transitions, 753 flow [2025-02-08 05:26:53,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 289.6) internal successors, (1448), 5 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:53,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:53,470 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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] [2025-02-08 05:26:53,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:26:53,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:26:53,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash -255805555, now seen corresponding path program 1 times [2025-02-08 05:26:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019638040] [2025-02-08 05:26:53,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:53,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:53,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:26:53,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:26:53,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:53,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:53,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:53,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:26:53,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:26:53,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:53,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:53,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:53,496 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:53,496 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2025-02-08 05:26:53,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-02-08 05:26:53,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-02-08 05:26:53,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-02-08 05:26:53,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-02-08 05:26:53,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-02-08 05:26:53,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-02-08 05:26:53,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-02-08 05:26:53,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-02-08 05:26:53,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-02-08 05:26:53,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-02-08 05:26:53,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-02-08 05:26:53,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-02-08 05:26:53,499 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-02-08 05:26:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-02-08 05:26:53,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:26:53,500 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:53,500 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:26:53,500 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:26:53,540 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:26:53,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 402 transitions, 832 flow [2025-02-08 05:26:53,578 INFO L124 PetriNetUnfolderBase]: 14/444 cut-off events. [2025-02-08 05:26:53,578 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:26:53,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 444 events. 14/444 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1543 event pairs, 0 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 360. Up to 5 conditions per place. [2025-02-08 05:26:53,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 402 transitions, 832 flow [2025-02-08 05:26:53,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 402 transitions, 832 flow [2025-02-08 05:26:53,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:53,588 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;@36e969f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:53,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-02-08 05:26:53,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:53,590 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:26:53,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:53,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:53,590 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-02-08 05:26:53,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:26:53,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:53,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1159150816, now seen corresponding path program 1 times [2025-02-08 05:26:53,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:53,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360561360] [2025-02-08 05:26:53,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:53,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:53,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 05:26:53,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:26:53,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:53,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:53,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:53,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360561360] [2025-02-08 05:26:53,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360561360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:53,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:53,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:53,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364495132] [2025-02-08 05:26:53,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:53,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:53,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:53,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:53,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:53,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 402 [2025-02-08 05:26:53,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 402 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:53,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:53,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 402 [2025-02-08 05:26:53,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:57,961 INFO L124 PetriNetUnfolderBase]: 7271/40002 cut-off events. [2025-02-08 05:26:57,962 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2025-02-08 05:26:58,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51551 conditions, 40002 events. 7271/40002 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 585845 event pairs, 6804 based on Foata normal form. 4054/37525 useless extension candidates. Maximal degree in co-relation 42489. Up to 9608 conditions per place. [2025-02-08 05:26:58,373 INFO L140 encePairwiseOnDemand]: 389/402 looper letters, 31 selfloop transitions, 2 changer transitions 1/378 dead transitions. [2025-02-08 05:26:58,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 378 transitions, 850 flow [2025-02-08 05:26:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-02-08 05:26:58,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145936981757877 [2025-02-08 05:26:58,375 INFO L175 Difference]: Start difference. First operand has 397 places, 402 transitions, 832 flow. Second operand 3 states and 1103 transitions. [2025-02-08 05:26:58,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 378 transitions, 850 flow [2025-02-08 05:26:58,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 378 transitions, 844 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:26:58,380 INFO L231 Difference]: Finished difference. Result has 384 places, 377 transitions, 780 flow [2025-02-08 05:26:58,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=384, PETRI_TRANSITIONS=377} [2025-02-08 05:26:58,381 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -13 predicate places. [2025-02-08 05:26:58,381 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 377 transitions, 780 flow [2025-02-08 05:26:58,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:58,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:58,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:58,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:26:58,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:26:58,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash -771326665, now seen corresponding path program 1 times [2025-02-08 05:26:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:58,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457096120] [2025-02-08 05:26:58,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:58,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:26:58,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:26:58,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:58,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:58,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:58,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457096120] [2025-02-08 05:26:58,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457096120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:58,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:58,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:58,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873905431] [2025-02-08 05:26:58,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:58,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:58,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:58,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:58,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 402 [2025-02-08 05:26:58,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 377 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:58,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:58,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 402 [2025-02-08 05:26:58,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:59,367 INFO L124 PetriNetUnfolderBase]: 797/8746 cut-off events. [2025-02-08 05:26:59,368 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-02-08 05:26:59,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10041 conditions, 8746 events. 797/8746 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 105704 event pairs, 684 based on Foata normal form. 0/7173 useless extension candidates. Maximal degree in co-relation 10005. Up to 1031 conditions per place. [2025-02-08 05:26:59,459 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 22 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-02-08 05:26:59,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 376 transitions, 826 flow [2025-02-08 05:26:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1111 transitions. [2025-02-08 05:26:59,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212271973466003 [2025-02-08 05:26:59,461 INFO L175 Difference]: Start difference. First operand has 384 places, 377 transitions, 780 flow. Second operand 3 states and 1111 transitions. [2025-02-08 05:26:59,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 376 transitions, 826 flow [2025-02-08 05:26:59,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 376 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:59,465 INFO L231 Difference]: Finished difference. Result has 382 places, 376 transitions, 778 flow [2025-02-08 05:26:59,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=382, PETRI_TRANSITIONS=376} [2025-02-08 05:26:59,466 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -15 predicate places. [2025-02-08 05:26:59,466 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 376 transitions, 778 flow [2025-02-08 05:26:59,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:59,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:59,467 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] [2025-02-08 05:26:59,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:26:59,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:26:59,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1168530833, now seen corresponding path program 1 times [2025-02-08 05:26:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:59,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654780297] [2025-02-08 05:26:59,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:59,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:26:59,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:26:59,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:59,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:59,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:59,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654780297] [2025-02-08 05:26:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654780297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:59,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:59,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:59,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573131385] [2025-02-08 05:26:59,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:59,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:59,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:59,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:59,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:59,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 402 [2025-02-08 05:26:59,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 376 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:59,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:59,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 402 [2025-02-08 05:26:59,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:01,760 INFO L124 PetriNetUnfolderBase]: 1991/19815 cut-off events. [2025-02-08 05:27:01,760 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2025-02-08 05:27:01,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22798 conditions, 19815 events. 1991/19815 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 282309 event pairs, 1720 based on Foata normal form. 0/16417 useless extension candidates. Maximal degree in co-relation 22754. Up to 2506 conditions per place. [2025-02-08 05:27:02,020 INFO L140 encePairwiseOnDemand]: 394/402 looper letters, 26 selfloop transitions, 1 changer transitions 0/369 dead transitions. [2025-02-08 05:27:02,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 369 transitions, 818 flow [2025-02-08 05:27:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2025-02-08 05:27:02,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9087893864013267 [2025-02-08 05:27:02,023 INFO L175 Difference]: Start difference. First operand has 382 places, 376 transitions, 778 flow. Second operand 3 states and 1096 transitions. [2025-02-08 05:27:02,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 369 transitions, 818 flow [2025-02-08 05:27:02,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 369 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:27:02,027 INFO L231 Difference]: Finished difference. Result has 375 places, 369 transitions, 762 flow [2025-02-08 05:27:02,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=375, PETRI_TRANSITIONS=369} [2025-02-08 05:27:02,028 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -22 predicate places. [2025-02-08 05:27:02,028 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 369 transitions, 762 flow [2025-02-08 05:27:02,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:02,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:02,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:02,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:27:02,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:27:02,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1123711717, now seen corresponding path program 1 times [2025-02-08 05:27:02,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:02,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628384953] [2025-02-08 05:27:02,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:02,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:02,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:27:02,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:27:02,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:02,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:02,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628384953] [2025-02-08 05:27:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628384953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:02,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:02,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247796212] [2025-02-08 05:27:02,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:02,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:02,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:02,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:02,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 402 [2025-02-08 05:27:02,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 369 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:02,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:02,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 402 [2025-02-08 05:27:02,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:27:05,016 INFO L124 PetriNetUnfolderBase]: 3941/25436 cut-off events. [2025-02-08 05:27:05,016 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2025-02-08 05:27:05,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31409 conditions, 25436 events. 3941/25436 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 343008 event pairs, 3630 based on Foata normal form. 0/21231 useless extension candidates. Maximal degree in co-relation 31365. Up to 5188 conditions per place. [2025-02-08 05:27:05,424 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 27 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-02-08 05:27:05,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 368 transitions, 818 flow [2025-02-08 05:27:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:27:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:27:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2025-02-08 05:27:05,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9129353233830846 [2025-02-08 05:27:05,426 INFO L175 Difference]: Start difference. First operand has 375 places, 369 transitions, 762 flow. Second operand 3 states and 1101 transitions. [2025-02-08 05:27:05,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 368 transitions, 818 flow [2025-02-08 05:27:05,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 368 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:27:05,431 INFO L231 Difference]: Finished difference. Result has 375 places, 368 transitions, 763 flow [2025-02-08 05:27:05,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=375, PETRI_TRANSITIONS=368} [2025-02-08 05:27:05,432 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -22 predicate places. [2025-02-08 05:27:05,432 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 368 transitions, 763 flow [2025-02-08 05:27:05,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:05,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:27:05,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:27:05,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:27:05,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-02-08 05:27:05,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:27:05,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1639946186, now seen corresponding path program 1 times [2025-02-08 05:27:05,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:27:05,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422611129] [2025-02-08 05:27:05,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:27:05,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:27:05,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:27:05,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:27:05,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:27:05,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:27:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:27:05,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:27:05,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422611129] [2025-02-08 05:27:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422611129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:27:05,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:27:05,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:27:05,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439281190] [2025-02-08 05:27:05,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:27:05,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:27:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:27:05,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:27:05,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:27:05,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 402 [2025-02-08 05:27:05,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 368 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:27:05,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:27:05,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 402 [2025-02-08 05:27:05,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand