./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/weaver/chl-chromosome-symm.wvr.c -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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:12,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:12,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:12,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:12,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:12,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:12,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:12,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:12,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:12,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:12,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:12,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:12,140 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:12,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:12,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:12,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:12,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:12,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:12,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:12,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:12,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:12,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:12,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:12,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:12,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:12,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:12,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:12,143 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:12,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:12,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:12,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:12,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:12,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:12,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:12,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:12,143 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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2025-01-09 21:30:12,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:12,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:12,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:12,366 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:12,367 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:12,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-01-09 21:30:13,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e851ba90/e0942632fdff47be963fbeb34bdb8f93/FLAGf98c78d29 [2025-01-09 21:30:13,788 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:13,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2025-01-09 21:30:13,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e851ba90/e0942632fdff47be963fbeb34bdb8f93/FLAGf98c78d29 [2025-01-09 21:30:13,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e851ba90/e0942632fdff47be963fbeb34bdb8f93 [2025-01-09 21:30:13,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:13,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:13,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:13,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:13,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:13,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cabcd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:13, skipping insertion in model container [2025-01-09 21:30:13,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:13" (1/1) ... [2025-01-09 21:30:13,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:13,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:13,988 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:14,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:14,032 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:14,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14 WrapperNode [2025-01-09 21:30:14,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:14,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:14,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:14,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:14,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,077 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 311 [2025-01-09 21:30:14,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:14,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:14,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:14,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:14,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:14,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:14,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:14,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:14,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (1/1) ... [2025-01-09 21:30:14,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:14,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:14,140 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-01-09 21:30:14,142 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-01-09 21:30:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:14,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:14,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:14,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:14,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:14,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:14,164 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:14,257 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:14,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:14,685 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:14,685 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:14,698 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:14,700 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:14,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:14 BoogieIcfgContainer [2025-01-09 21:30:14,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:14,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:14,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:14,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:14,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:13" (1/3) ... [2025-01-09 21:30:14,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a73294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:14, skipping insertion in model container [2025-01-09 21:30:14,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:14" (2/3) ... [2025-01-09 21:30:14,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a73294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:14, skipping insertion in model container [2025-01-09 21:30:14,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:14" (3/3) ... [2025-01-09 21:30:14,710 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2025-01-09 21:30:14,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:14,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-symm.wvr.c that has 3 procedures, 406 locations, 1 initial locations, 4 loop locations, and 34 error locations. [2025-01-09 21:30:14,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:14,848 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:30:14,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 412 places, 427 transitions, 868 flow [2025-01-09 21:30:15,037 INFO L124 PetriNetUnfolderBase]: 22/425 cut-off events. [2025-01-09 21:30:15,041 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:15,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 425 events. 22/425 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 676 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 254. Up to 2 conditions per place. [2025-01-09 21:30:15,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 412 places, 427 transitions, 868 flow [2025-01-09 21:30:15,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 405 transitions, 822 flow [2025-01-09 21:30:15,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:15,081 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;@2e266d72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:15,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-01-09 21:30:15,093 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:15,093 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2025-01-09 21:30:15,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:15,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:15,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:15,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:15,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1789403199, now seen corresponding path program 1 times [2025-01-09 21:30:15,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:15,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422446129] [2025-01-09 21:30:15,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:15,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:30:15,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:30:15,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:15,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422446129] [2025-01-09 21:30:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422446129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:15,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:15,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:15,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543630382] [2025-01-09 21:30:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:15,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:15,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:15,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:15,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:15,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-01-09 21:30:15,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 405 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-01-09 21:30:15,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:15,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-01-09 21:30:15,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:15,480 INFO L124 PetriNetUnfolderBase]: 13/499 cut-off events. [2025-01-09 21:30:15,480 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-01-09 21:30:15,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 499 events. 13/499 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1302 event pairs, 3 based on Foata normal form. 21/451 useless extension candidates. Maximal degree in co-relation 324. Up to 16 conditions per place. [2025-01-09 21:30:15,485 INFO L140 encePairwiseOnDemand]: 412/427 looper letters, 9 selfloop transitions, 2 changer transitions 6/392 dead transitions. [2025-01-09 21:30:15,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 392 transitions, 818 flow [2025-01-09 21:30:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2025-01-09 21:30:15,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.955503512880562 [2025-01-09 21:30:15,497 INFO L175 Difference]: Start difference. First operand has 392 places, 405 transitions, 822 flow. Second operand 3 states and 1224 transitions. [2025-01-09 21:30:15,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 392 transitions, 818 flow [2025-01-09 21:30:15,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 392 transitions, 810 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:30:15,514 INFO L231 Difference]: Finished difference. Result has 389 places, 386 transitions, 780 flow [2025-01-09 21:30:15,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=389, PETRI_TRANSITIONS=386} [2025-01-09 21:30:15,523 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -3 predicate places. [2025-01-09 21:30:15,526 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 386 transitions, 780 flow [2025-01-09 21:30:15,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-01-09 21:30:15,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:15,527 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] [2025-01-09 21:30:15,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:15,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:15,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:15,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1461860913, now seen corresponding path program 1 times [2025-01-09 21:30:15,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:15,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073411775] [2025-01-09 21:30:15,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:15,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:30:15,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:30:15,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:15,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:16,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:16,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073411775] [2025-01-09 21:30:16,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073411775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:16,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356144348] [2025-01-09 21:30:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:16,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:16,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:16,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:16,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:16,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 427 [2025-01-09 21:30:16,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 386 transitions, 780 flow. Second operand has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 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-01-09 21:30:16,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:16,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 427 [2025-01-09 21:30:16,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:16,611 INFO L124 PetriNetUnfolderBase]: 131/1609 cut-off events. [2025-01-09 21:30:16,611 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-01-09 21:30:16,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 1609 events. 131/1609 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10199 event pairs, 80 based on Foata normal form. 0/1374 useless extension candidates. Maximal degree in co-relation 1776. Up to 224 conditions per place. [2025-01-09 21:30:16,619 INFO L140 encePairwiseOnDemand]: 415/427 looper letters, 36 selfloop transitions, 10 changer transitions 0/384 dead transitions. [2025-01-09 21:30:16,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 384 transitions, 868 flow [2025-01-09 21:30:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2238 transitions. [2025-01-09 21:30:16,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8735362997658079 [2025-01-09 21:30:16,626 INFO L175 Difference]: Start difference. First operand has 389 places, 386 transitions, 780 flow. Second operand 6 states and 2238 transitions. [2025-01-09 21:30:16,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 384 transitions, 868 flow [2025-01-09 21:30:16,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 384 transitions, 864 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:16,633 INFO L231 Difference]: Finished difference. Result has 384 places, 384 transitions, 792 flow [2025-01-09 21:30:16,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=792, PETRI_PLACES=384, PETRI_TRANSITIONS=384} [2025-01-09 21:30:16,634 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -8 predicate places. [2025-01-09 21:30:16,634 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 384 transitions, 792 flow [2025-01-09 21:30:16,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 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-01-09 21:30:16,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:16,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:16,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:16,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:16,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash -389755292, now seen corresponding path program 1 times [2025-01-09 21:30:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610961525] [2025-01-09 21:30:16,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:16,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:30:16,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:30:16,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:16,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:16,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:16,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610961525] [2025-01-09 21:30:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610961525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38885909] [2025-01-09 21:30:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:16,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:16,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:16,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:16,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:16,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-01-09 21:30:16,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 384 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-01-09 21:30:16,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:16,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-01-09 21:30:16,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:16,776 INFO L124 PetriNetUnfolderBase]: 16/569 cut-off events. [2025-01-09 21:30:16,776 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:30:16,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 569 events. 16/569 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1495 event pairs, 3 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 571. Up to 18 conditions per place. [2025-01-09 21:30:16,781 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-01-09 21:30:16,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 383 transitions, 812 flow [2025-01-09 21:30:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-01-09 21:30:16,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-01-09 21:30:16,785 INFO L175 Difference]: Start difference. First operand has 384 places, 384 transitions, 792 flow. Second operand 3 states and 1212 transitions. [2025-01-09 21:30:16,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 383 transitions, 812 flow [2025-01-09 21:30:16,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 383 transitions, 792 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:16,791 INFO L231 Difference]: Finished difference. Result has 380 places, 383 transitions, 774 flow [2025-01-09 21:30:16,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=380, PETRI_TRANSITIONS=383} [2025-01-09 21:30:16,792 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2025-01-09 21:30:16,792 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 383 transitions, 774 flow [2025-01-09 21:30:16,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-01-09 21:30:16,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:16,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:16,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:16,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:16,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash 596790062, now seen corresponding path program 1 times [2025-01-09 21:30:16,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:16,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953567908] [2025-01-09 21:30:16,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:16,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:30:16,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:30:16,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:16,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:16,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953567908] [2025-01-09 21:30:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953567908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:16,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:16,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:16,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299126614] [2025-01-09 21:30:16,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:16,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:16,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:16,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:16,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-01-09 21:30:16,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 383 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-01-09 21:30:16,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:16,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-01-09 21:30:16,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:16,923 INFO L124 PetriNetUnfolderBase]: 15/584 cut-off events. [2025-01-09 21:30:16,923 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:16,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 584 events. 15/584 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1829 event pairs, 3 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 493. Up to 16 conditions per place. [2025-01-09 21:30:16,927 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-01-09 21:30:16,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 382 transitions, 794 flow [2025-01-09 21:30:16,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-01-09 21:30:16,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-01-09 21:30:16,929 INFO L175 Difference]: Start difference. First operand has 380 places, 383 transitions, 774 flow. Second operand 3 states and 1212 transitions. [2025-01-09 21:30:16,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 382 transitions, 794 flow [2025-01-09 21:30:16,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 382 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:16,933 INFO L231 Difference]: Finished difference. Result has 379 places, 382 transitions, 772 flow [2025-01-09 21:30:16,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=379, PETRI_TRANSITIONS=382} [2025-01-09 21:30:16,935 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2025-01-09 21:30:16,935 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 772 flow [2025-01-09 21:30:16,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-01-09 21:30:16,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:16,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:16,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:16,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:16,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1525647753, now seen corresponding path program 1 times [2025-01-09 21:30:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:16,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957628725] [2025-01-09 21:30:16,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:16,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:16,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:30:16,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:30:16,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:16,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957628725] [2025-01-09 21:30:16,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957628725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:16,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:16,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136210112] [2025-01-09 21:30:16,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:16,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:16,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:16,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:16,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 427 [2025-01-09 21:30:17,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-01-09 21:30:17,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:17,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 427 [2025-01-09 21:30:17,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:17,050 INFO L124 PetriNetUnfolderBase]: 15/586 cut-off events. [2025-01-09 21:30:17,051 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:30:17,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 586 events. 15/586 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1674 event pairs, 3 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 487. Up to 16 conditions per place. [2025-01-09 21:30:17,055 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 9 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-01-09 21:30:17,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 381 transitions, 792 flow [2025-01-09 21:30:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2025-01-09 21:30:17,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461358313817331 [2025-01-09 21:30:17,058 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 772 flow. Second operand 3 states and 1212 transitions. [2025-01-09 21:30:17,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 381 transitions, 792 flow [2025-01-09 21:30:17,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 381 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:17,062 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 770 flow [2025-01-09 21:30:17,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-01-09 21:30:17,064 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2025-01-09 21:30:17,064 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 770 flow [2025-01-09 21:30:17,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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-01-09 21:30:17,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:17,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:17,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:17,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:17,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1923203718, now seen corresponding path program 1 times [2025-01-09 21:30:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741342794] [2025-01-09 21:30:17,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:17,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:30:17,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:30:17,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:17,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741342794] [2025-01-09 21:30:17,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741342794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:17,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:17,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411171588] [2025-01-09 21:30:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:17,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:17,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:17,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:17,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:17,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-01-09 21:30:17,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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-01-09 21:30:17,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:17,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-01-09 21:30:17,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:17,213 INFO L124 PetriNetUnfolderBase]: 26/858 cut-off events. [2025-01-09 21:30:17,213 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:30:17,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 858 events. 26/858 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3678 event pairs, 5 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 760. Up to 22 conditions per place. [2025-01-09 21:30:17,216 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 10 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-01-09 21:30:17,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 382 transitions, 797 flow [2025-01-09 21:30:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-01-09 21:30:17,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:30:17,218 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 770 flow. Second operand 3 states and 1220 transitions. [2025-01-09 21:30:17,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 382 transitions, 797 flow [2025-01-09 21:30:17,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 382 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:17,226 INFO L231 Difference]: Finished difference. Result has 377 places, 381 transitions, 776 flow [2025-01-09 21:30:17,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=377, PETRI_TRANSITIONS=381} [2025-01-09 21:30:17,227 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2025-01-09 21:30:17,227 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 381 transitions, 776 flow [2025-01-09 21:30:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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-01-09 21:30:17,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:17,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:17,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:17,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:17,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash -987151810, now seen corresponding path program 1 times [2025-01-09 21:30:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:17,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695024150] [2025-01-09 21:30:17,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:17,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:17,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 21:30:17,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 21:30:17,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:17,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:17,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:17,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695024150] [2025-01-09 21:30:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695024150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:17,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:17,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:17,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696747195] [2025-01-09 21:30:17,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:17,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:17,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:17,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:17,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:17,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-01-09 21:30:17,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 381 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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-01-09 21:30:17,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:17,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-01-09 21:30:17,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:17,373 INFO L124 PetriNetUnfolderBase]: 27/835 cut-off events. [2025-01-09 21:30:17,373 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:30:17,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 835 events. 27/835 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3879 event pairs, 3 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 642. Up to 22 conditions per place. [2025-01-09 21:30:17,378 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 10 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-01-09 21:30:17,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 382 transitions, 803 flow [2025-01-09 21:30:17,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2025-01-09 21:30:17,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-01-09 21:30:17,380 INFO L175 Difference]: Start difference. First operand has 377 places, 381 transitions, 776 flow. Second operand 3 states and 1220 transitions. [2025-01-09 21:30:17,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 382 transitions, 803 flow [2025-01-09 21:30:17,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 382 transitions, 803 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:17,385 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 786 flow [2025-01-09 21:30:17,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-01-09 21:30:17,386 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2025-01-09 21:30:17,387 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 786 flow [2025-01-09 21:30:17,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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-01-09 21:30:17,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:17,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:17,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:17,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1771567637, now seen corresponding path program 1 times [2025-01-09 21:30:17,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:17,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119759416] [2025-01-09 21:30:17,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:17,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:30:17,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:30:17,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:17,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:17,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119759416] [2025-01-09 21:30:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119759416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:17,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921598932] [2025-01-09 21:30:17,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:17,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:17,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:17,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:17,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:17,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-01-09 21:30:17,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 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-01-09 21:30:17,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:17,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-01-09 21:30:17,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:17,517 INFO L124 PetriNetUnfolderBase]: 25/649 cut-off events. [2025-01-09 21:30:17,517 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:17,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 649 events. 25/649 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2507 event pairs, 6 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 484. Up to 33 conditions per place. [2025-01-09 21:30:17,520 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 14 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-01-09 21:30:17,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 381 transitions, 819 flow [2025-01-09 21:30:17,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2025-01-09 21:30:17,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430132708821234 [2025-01-09 21:30:17,523 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 786 flow. Second operand 3 states and 1208 transitions. [2025-01-09 21:30:17,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 381 transitions, 819 flow [2025-01-09 21:30:17,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 381 transitions, 819 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:17,528 INFO L231 Difference]: Finished difference. Result has 379 places, 380 transitions, 788 flow [2025-01-09 21:30:17,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=379, PETRI_TRANSITIONS=380} [2025-01-09 21:30:17,531 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2025-01-09 21:30:17,531 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 380 transitions, 788 flow [2025-01-09 21:30:17,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 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-01-09 21:30:17,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:17,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:17,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:17,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:17,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash -187574699, now seen corresponding path program 1 times [2025-01-09 21:30:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:17,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360323830] [2025-01-09 21:30:17,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:17,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:17,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:30:17,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:30:17,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:17,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:17,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:17,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360323830] [2025-01-09 21:30:17,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360323830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:17,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:17,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391281495] [2025-01-09 21:30:17,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:17,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:17,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:17,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:17,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-01-09 21:30:17,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 380 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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-01-09 21:30:17,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:17,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-01-09 21:30:17,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:17,690 INFO L124 PetriNetUnfolderBase]: 43/1091 cut-off events. [2025-01-09 21:30:17,690 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-01-09 21:30:17,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 1091 events. 43/1091 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5140 event pairs, 2 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 898. Up to 41 conditions per place. [2025-01-09 21:30:17,696 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 12 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-01-09 21:30:17,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 383 transitions, 825 flow [2025-01-09 21:30:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2025-01-09 21:30:17,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539422326307572 [2025-01-09 21:30:17,698 INFO L175 Difference]: Start difference. First operand has 379 places, 380 transitions, 788 flow. Second operand 3 states and 1222 transitions. [2025-01-09 21:30:17,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 383 transitions, 825 flow [2025-01-09 21:30:17,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 383 transitions, 821 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:17,702 INFO L231 Difference]: Finished difference. Result has 378 places, 380 transitions, 794 flow [2025-01-09 21:30:17,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=378, PETRI_TRANSITIONS=380} [2025-01-09 21:30:17,703 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2025-01-09 21:30:17,703 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 380 transitions, 794 flow [2025-01-09 21:30:17,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 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-01-09 21:30:17,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:17,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:17,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:17,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:17,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:17,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1519879171, now seen corresponding path program 1 times [2025-01-09 21:30:17,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:17,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98197030] [2025-01-09 21:30:17,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:17,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:17,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:17,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:17,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:17,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:17,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:17,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98197030] [2025-01-09 21:30:17,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98197030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:17,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:17,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853806983] [2025-01-09 21:30:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:17,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:17,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:17,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:17,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-01-09 21:30:17,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 380 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 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-01-09 21:30:17,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:17,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-01-09 21:30:17,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:17,860 INFO L124 PetriNetUnfolderBase]: 45/1032 cut-off events. [2025-01-09 21:30:17,860 INFO L125 PetriNetUnfolderBase]: For 6/18 co-relation queries the response was YES. [2025-01-09 21:30:17,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 1032 events. 45/1032 cut-off events. For 6/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4370 event pairs, 5 based on Foata normal form. 2/919 useless extension candidates. Maximal degree in co-relation 888. Up to 36 conditions per place. [2025-01-09 21:30:17,867 INFO L140 encePairwiseOnDemand]: 417/427 looper letters, 16 selfloop transitions, 5 changer transitions 0/379 dead transitions. [2025-01-09 21:30:17,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 835 flow [2025-01-09 21:30:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2025-01-09 21:30:17,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9359875097580016 [2025-01-09 21:30:17,869 INFO L175 Difference]: Start difference. First operand has 378 places, 380 transitions, 794 flow. Second operand 3 states and 1199 transitions. [2025-01-09 21:30:17,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 835 flow [2025-01-09 21:30:17,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 379 transitions, 835 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:17,874 INFO L231 Difference]: Finished difference. Result has 377 places, 378 transitions, 816 flow [2025-01-09 21:30:17,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=377, PETRI_TRANSITIONS=378} [2025-01-09 21:30:17,875 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2025-01-09 21:30:17,875 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 378 transitions, 816 flow [2025-01-09 21:30:17,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 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-01-09 21:30:17,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:17,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:17,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:17,876 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:17,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1157371772, now seen corresponding path program 1 times [2025-01-09 21:30:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:17,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285948017] [2025-01-09 21:30:17,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:17,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:30:17,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:30:17,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:17,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:17,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:17,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285948017] [2025-01-09 21:30:17,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285948017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:17,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:17,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591934056] [2025-01-09 21:30:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:17,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:17,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:17,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:17,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-01-09 21:30:17,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 378 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-01-09 21:30:17,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:17,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-01-09 21:30:17,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,035 INFO L124 PetriNetUnfolderBase]: 50/1066 cut-off events. [2025-01-09 21:30:18,035 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2025-01-09 21:30:18,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 1066 events. 50/1066 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4816 event pairs, 11 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 939. Up to 65 conditions per place. [2025-01-09 21:30:18,041 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 14 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-01-09 21:30:18,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 378 transitions, 849 flow [2025-01-09 21:30:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2025-01-09 21:30:18,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430132708821234 [2025-01-09 21:30:18,044 INFO L175 Difference]: Start difference. First operand has 377 places, 378 transitions, 816 flow. Second operand 3 states and 1208 transitions. [2025-01-09 21:30:18,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 378 transitions, 849 flow [2025-01-09 21:30:18,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 378 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:18,049 INFO L231 Difference]: Finished difference. Result has 376 places, 377 transitions, 808 flow [2025-01-09 21:30:18,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=376, PETRI_TRANSITIONS=377} [2025-01-09 21:30:18,049 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2025-01-09 21:30:18,049 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 377 transitions, 808 flow [2025-01-09 21:30:18,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-01-09 21:30:18,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:18,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:18,050 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:18,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1144561383, now seen corresponding path program 1 times [2025-01-09 21:30:18,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260136927] [2025-01-09 21:30:18,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 21:30:18,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 21:30:18,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,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-01-09 21:30:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260136927] [2025-01-09 21:30:18,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260136927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:30:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116881682] [2025-01-09 21:30:18,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:30:18,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:30:18,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:30:18,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 427 [2025-01-09 21:30:18,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 377 transitions, 808 flow. Second operand has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 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-01-09 21:30:18,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 427 [2025-01-09 21:30:18,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,297 INFO L124 PetriNetUnfolderBase]: 46/1176 cut-off events. [2025-01-09 21:30:18,297 INFO L125 PetriNetUnfolderBase]: For 9/31 co-relation queries the response was YES. [2025-01-09 21:30:18,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 1176 events. 46/1176 cut-off events. For 9/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5453 event pairs, 7 based on Foata normal form. 3/1052 useless extension candidates. Maximal degree in co-relation 1065. Up to 34 conditions per place. [2025-01-09 21:30:18,302 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2025-01-09 21:30:18,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 388 transitions, 883 flow [2025-01-09 21:30:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2030 transitions. [2025-01-09 21:30:18,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508196721311475 [2025-01-09 21:30:18,306 INFO L175 Difference]: Start difference. First operand has 376 places, 377 transitions, 808 flow. Second operand 5 states and 2030 transitions. [2025-01-09 21:30:18,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 388 transitions, 883 flow [2025-01-09 21:30:18,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 388 transitions, 879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:18,311 INFO L231 Difference]: Finished difference. Result has 381 places, 379 transitions, 829 flow [2025-01-09 21:30:18,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=829, PETRI_PLACES=381, PETRI_TRANSITIONS=379} [2025-01-09 21:30:18,312 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2025-01-09 21:30:18,312 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 379 transitions, 829 flow [2025-01-09 21:30:18,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 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-01-09 21:30:18,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:18,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:18,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:18,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1328118014, now seen corresponding path program 1 times [2025-01-09 21:30:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302123255] [2025-01-09 21:30:18,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 21:30:18,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 21:30:18,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302123255] [2025-01-09 21:30:18,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302123255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764047261] [2025-01-09 21:30:18,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:30:18,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:30:18,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:30:18,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-01-09 21:30:18,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 379 transitions, 829 flow. Second operand has 5 states, 5 states have (on average 394.4) internal successors, (1972), 5 states have internal predecessors, (1972), 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-01-09 21:30:18,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-01-09 21:30:18,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,609 INFO L124 PetriNetUnfolderBase]: 28/1070 cut-off events. [2025-01-09 21:30:18,609 INFO L125 PetriNetUnfolderBase]: For 13/21 co-relation queries the response was YES. [2025-01-09 21:30:18,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 1070 events. 28/1070 cut-off events. For 13/21 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4339 event pairs, 1 based on Foata normal form. 2/966 useless extension candidates. Maximal degree in co-relation 985. Up to 17 conditions per place. [2025-01-09 21:30:18,615 INFO L140 encePairwiseOnDemand]: 413/427 looper letters, 12 selfloop transitions, 12 changer transitions 0/381 dead transitions. [2025-01-09 21:30:18,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 381 transitions, 881 flow [2025-01-09 21:30:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1981 transitions. [2025-01-09 21:30:18,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278688524590164 [2025-01-09 21:30:18,620 INFO L175 Difference]: Start difference. First operand has 381 places, 379 transitions, 829 flow. Second operand 5 states and 1981 transitions. [2025-01-09 21:30:18,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 381 transitions, 881 flow [2025-01-09 21:30:18,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 381 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:18,646 INFO L231 Difference]: Finished difference. Result has 386 places, 381 transitions, 869 flow [2025-01-09 21:30:18,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=869, PETRI_PLACES=386, PETRI_TRANSITIONS=381} [2025-01-09 21:30:18,648 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -6 predicate places. [2025-01-09 21:30:18,648 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 381 transitions, 869 flow [2025-01-09 21:30:18,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 394.4) internal successors, (1972), 5 states have internal predecessors, (1972), 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-01-09 21:30:18,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:18,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1488524735, now seen corresponding path program 1 times [2025-01-09 21:30:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285320621] [2025-01-09 21:30:18,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:30:18,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:30:18,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:18,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285320621] [2025-01-09 21:30:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285320621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:18,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:18,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:18,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295337396] [2025-01-09 21:30:18,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:18,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:18,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:18,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:18,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-01-09 21:30:18,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 381 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-01-09 21:30:18,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:18,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-01-09 21:30:18,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:18,855 INFO L124 PetriNetUnfolderBase]: 57/1151 cut-off events. [2025-01-09 21:30:18,855 INFO L125 PetriNetUnfolderBase]: For 36/69 co-relation queries the response was YES. [2025-01-09 21:30:18,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 1151 events. 57/1151 cut-off events. For 36/69 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5096 event pairs, 14 based on Foata normal form. 2/1048 useless extension candidates. Maximal degree in co-relation 1244. Up to 79 conditions per place. [2025-01-09 21:30:18,865 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 16 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-01-09 21:30:18,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 381 transitions, 906 flow [2025-01-09 21:30:18,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2025-01-09 21:30:18,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430132708821234 [2025-01-09 21:30:18,870 INFO L175 Difference]: Start difference. First operand has 386 places, 381 transitions, 869 flow. Second operand 3 states and 1208 transitions. [2025-01-09 21:30:18,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 381 transitions, 906 flow [2025-01-09 21:30:18,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 381 transitions, 886 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:30:18,875 INFO L231 Difference]: Finished difference. Result has 384 places, 380 transitions, 851 flow [2025-01-09 21:30:18,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=851, PETRI_PLACES=384, PETRI_TRANSITIONS=380} [2025-01-09 21:30:18,876 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -8 predicate places. [2025-01-09 21:30:18,876 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 380 transitions, 851 flow [2025-01-09 21:30:18,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-01-09 21:30:18,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:18,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:18,877 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1383524733, now seen corresponding path program 1 times [2025-01-09 21:30:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836101208] [2025-01-09 21:30:18,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:18,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:30:18,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:30:18,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:18,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836101208] [2025-01-09 21:30:19,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836101208] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:30:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473984603] [2025-01-09 21:30:19,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:19,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:19,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:19,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:30:19,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:30:19,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:30:19,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:30:19,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:19,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:19,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:30:19,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:30:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:19,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:30:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:19,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473984603] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:30:19,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:30:19,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-09 21:30:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238128522] [2025-01-09 21:30:19,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:30:19,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:30:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:19,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:30:19,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:30:19,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 427 [2025-01-09 21:30:19,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 380 transitions, 851 flow. Second operand has 15 states, 15 states have (on average 387.6666666666667) internal successors, (5815), 15 states have internal predecessors, (5815), 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-01-09 21:30:19,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:19,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 427 [2025-01-09 21:30:19,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:19,975 INFO L124 PetriNetUnfolderBase]: 28/1098 cut-off events. [2025-01-09 21:30:19,976 INFO L125 PetriNetUnfolderBase]: For 21/29 co-relation queries the response was YES. [2025-01-09 21:30:19,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 1098 events. 28/1098 cut-off events. For 21/29 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4245 event pairs, 1 based on Foata normal form. 4/1002 useless extension candidates. Maximal degree in co-relation 1053. Up to 17 conditions per place. [2025-01-09 21:30:19,983 INFO L140 encePairwiseOnDemand]: 407/427 looper letters, 20 selfloop transitions, 26 changer transitions 0/396 dead transitions. [2025-01-09 21:30:19,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 396 transitions, 979 flow [2025-01-09 21:30:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4285 transitions. [2025-01-09 21:30:19,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122844368746008 [2025-01-09 21:30:19,990 INFO L175 Difference]: Start difference. First operand has 384 places, 380 transitions, 851 flow. Second operand 11 states and 4285 transitions. [2025-01-09 21:30:19,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 396 transitions, 979 flow [2025-01-09 21:30:19,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 396 transitions, 975 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:19,994 INFO L231 Difference]: Finished difference. Result has 395 places, 392 transitions, 967 flow [2025-01-09 21:30:19,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=967, PETRI_PLACES=395, PETRI_TRANSITIONS=392} [2025-01-09 21:30:19,995 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 3 predicate places. [2025-01-09 21:30:19,995 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 392 transitions, 967 flow [2025-01-09 21:30:19,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 387.6666666666667) internal successors, (5815), 15 states have internal predecessors, (5815), 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-01-09 21:30:19,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:19,997 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:20,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:30:20,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 21:30:20,198 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:20,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2015126307, now seen corresponding path program 2 times [2025-01-09 21:30:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988094259] [2025-01-09 21:30:20,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:30:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:20,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 217 statements into 2 equivalence classes. [2025-01-09 21:30:20,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 127 of 217 statements. [2025-01-09 21:30:20,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:30:20,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:20,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:20,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988094259] [2025-01-09 21:30:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988094259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:20,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:20,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148934548] [2025-01-09 21:30:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:20,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:20,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:20,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:20,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-01-09 21:30:20,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 392 transitions, 967 flow. Second operand has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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-01-09 21:30:20,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:20,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-01-09 21:30:20,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:20,947 INFO L124 PetriNetUnfolderBase]: 43/1221 cut-off events. [2025-01-09 21:30:20,948 INFO L125 PetriNetUnfolderBase]: For 42/63 co-relation queries the response was YES. [2025-01-09 21:30:20,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 1221 events. 43/1221 cut-off events. For 42/63 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5302 event pairs, 3 based on Foata normal form. 4/1118 useless extension candidates. Maximal degree in co-relation 1280. Up to 52 conditions per place. [2025-01-09 21:30:20,955 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 20 selfloop transitions, 6 changer transitions 0/395 dead transitions. [2025-01-09 21:30:20,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 395 transitions, 1029 flow [2025-01-09 21:30:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2372 transitions. [2025-01-09 21:30:20,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9258391881342701 [2025-01-09 21:30:20,959 INFO L175 Difference]: Start difference. First operand has 395 places, 392 transitions, 967 flow. Second operand 6 states and 2372 transitions. [2025-01-09 21:30:20,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 395 transitions, 1029 flow [2025-01-09 21:30:20,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 395 transitions, 1005 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 21:30:20,965 INFO L231 Difference]: Finished difference. Result has 396 places, 391 transitions, 953 flow [2025-01-09 21:30:20,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=396, PETRI_TRANSITIONS=391} [2025-01-09 21:30:20,965 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 4 predicate places. [2025-01-09 21:30:20,966 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 391 transitions, 953 flow [2025-01-09 21:30:20,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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-01-09 21:30:20,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:20,967 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:20,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:20,967 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:20,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:20,968 INFO L85 PathProgramCache]: Analyzing trace with hash -605858286, now seen corresponding path program 1 times [2025-01-09 21:30:20,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:20,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054306120] [2025-01-09 21:30:20,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:20,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:20,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 21:30:21,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 21:30:21,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:21,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:21,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054306120] [2025-01-09 21:30:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054306120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:21,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732903338] [2025-01-09 21:30:21,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:21,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:21,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 427 [2025-01-09 21:30:21,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 391 transitions, 953 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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-01-09 21:30:21,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:21,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 427 [2025-01-09 21:30:21,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:21,292 INFO L124 PetriNetUnfolderBase]: 62/1648 cut-off events. [2025-01-09 21:30:21,292 INFO L125 PetriNetUnfolderBase]: For 47/54 co-relation queries the response was YES. [2025-01-09 21:30:21,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 1648 events. 62/1648 cut-off events. For 47/54 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9046 event pairs, 7 based on Foata normal form. 0/1512 useless extension candidates. Maximal degree in co-relation 1738. Up to 76 conditions per place. [2025-01-09 21:30:21,299 INFO L140 encePairwiseOnDemand]: 423/427 looper letters, 12 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2025-01-09 21:30:21,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 394 transitions, 990 flow [2025-01-09 21:30:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2025-01-09 21:30:21,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539422326307572 [2025-01-09 21:30:21,301 INFO L175 Difference]: Start difference. First operand has 396 places, 391 transitions, 953 flow. Second operand 3 states and 1222 transitions. [2025-01-09 21:30:21,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 394 transitions, 990 flow [2025-01-09 21:30:21,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 394 transitions, 978 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:21,306 INFO L231 Difference]: Finished difference. Result has 392 places, 391 transitions, 951 flow [2025-01-09 21:30:21,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=392, PETRI_TRANSITIONS=391} [2025-01-09 21:30:21,306 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 0 predicate places. [2025-01-09 21:30:21,306 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 391 transitions, 951 flow [2025-01-09 21:30:21,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 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-01-09 21:30:21,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:21,307 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:21,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:21,307 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:21,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1601768377, now seen corresponding path program 1 times [2025-01-09 21:30:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:21,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197413600] [2025-01-09 21:30:21,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:21,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 21:30:21,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 21:30:21,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:21,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:21,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197413600] [2025-01-09 21:30:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197413600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535920654] [2025-01-09 21:30:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:21,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:21,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:21,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-01-09 21:30:21,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 391 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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-01-09 21:30:21,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:21,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-01-09 21:30:21,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:21,622 INFO L124 PetriNetUnfolderBase]: 84/1913 cut-off events. [2025-01-09 21:30:21,622 INFO L125 PetriNetUnfolderBase]: For 58/61 co-relation queries the response was YES. [2025-01-09 21:30:21,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 1913 events. 84/1913 cut-off events. For 58/61 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10874 event pairs, 15 based on Foata normal form. 4/1762 useless extension candidates. Maximal degree in co-relation 2041. Up to 84 conditions per place. [2025-01-09 21:30:21,630 INFO L140 encePairwiseOnDemand]: 415/427 looper letters, 10 selfloop transitions, 4 changer transitions 38/392 dead transitions. [2025-01-09 21:30:21,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 392 transitions, 998 flow [2025-01-09 21:30:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2025-01-09 21:30:21,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.936768149882904 [2025-01-09 21:30:21,633 INFO L175 Difference]: Start difference. First operand has 392 places, 391 transitions, 951 flow. Second operand 3 states and 1200 transitions. [2025-01-09 21:30:21,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 392 transitions, 998 flow [2025-01-09 21:30:21,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 392 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:21,638 INFO L231 Difference]: Finished difference. Result has 391 places, 353 transitions, 894 flow [2025-01-09 21:30:21,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=391, PETRI_TRANSITIONS=353} [2025-01-09 21:30:21,638 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2025-01-09 21:30:21,638 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 353 transitions, 894 flow [2025-01-09 21:30:21,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 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-01-09 21:30:21,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:21,639 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:21,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:21,639 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:21,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1164370922, now seen corresponding path program 1 times [2025-01-09 21:30:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037259852] [2025-01-09 21:30:21,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:21,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:21,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:30:21,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:30:21,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:21,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:21,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037259852] [2025-01-09 21:30:21,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037259852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:21,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:21,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:30:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192557467] [2025-01-09 21:30:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:21,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:30:21,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:21,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:30:21,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:30:21,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 427 [2025-01-09 21:30:21,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 353 transitions, 894 flow. Second operand has 4 states, 4 states have (on average 402.5) internal successors, (1610), 4 states have internal predecessors, (1610), 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-01-09 21:30:21,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:21,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 427 [2025-01-09 21:30:21,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:21,982 INFO L124 PetriNetUnfolderBase]: 64/1697 cut-off events. [2025-01-09 21:30:21,982 INFO L125 PetriNetUnfolderBase]: For 99/102 co-relation queries the response was YES. [2025-01-09 21:30:21,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 1697 events. 64/1697 cut-off events. For 99/102 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9945 event pairs, 25 based on Foata normal form. 0/1555 useless extension candidates. Maximal degree in co-relation 1894. Up to 76 conditions per place. [2025-01-09 21:30:21,988 INFO L140 encePairwiseOnDemand]: 422/427 looper letters, 15 selfloop transitions, 4 changer transitions 0/360 dead transitions. [2025-01-09 21:30:21,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 360 transitions, 947 flow [2025-01-09 21:30:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2025 transitions. [2025-01-09 21:30:21,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9484777517564403 [2025-01-09 21:30:21,991 INFO L175 Difference]: Start difference. First operand has 391 places, 353 transitions, 894 flow. Second operand 5 states and 2025 transitions. [2025-01-09 21:30:21,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 360 transitions, 947 flow [2025-01-09 21:30:21,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 360 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:21,996 INFO L231 Difference]: Finished difference. Result has 362 places, 355 transitions, 911 flow [2025-01-09 21:30:21,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=911, PETRI_PLACES=362, PETRI_TRANSITIONS=355} [2025-01-09 21:30:21,996 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -30 predicate places. [2025-01-09 21:30:21,996 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 355 transitions, 911 flow [2025-01-09 21:30:21,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 402.5) internal successors, (1610), 4 states have internal predecessors, (1610), 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-01-09 21:30:21,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:21,997 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:21,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:21,998 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:21,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash -633976487, now seen corresponding path program 1 times [2025-01-09 21:30:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:21,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490116021] [2025-01-09 21:30:21,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:21,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:30:22,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:30:22,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-09 21:30:22,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490116021] [2025-01-09 21:30:22,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490116021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665001999] [2025-01-09 21:30:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:22,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:22,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:22,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:22,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-01-09 21:30:22,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 355 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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-01-09 21:30:22,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:22,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-01-09 21:30:22,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:22,280 INFO L124 PetriNetUnfolderBase]: 85/1728 cut-off events. [2025-01-09 21:30:22,280 INFO L125 PetriNetUnfolderBase]: For 133/136 co-relation queries the response was YES. [2025-01-09 21:30:22,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 1728 events. 85/1728 cut-off events. For 133/136 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 11014 event pairs, 46 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 2029. Up to 135 conditions per place. [2025-01-09 21:30:22,291 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 2 changer transitions 1/355 dead transitions. [2025-01-09 21:30:22,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 355 transitions, 940 flow [2025-01-09 21:30:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-01-09 21:30:22,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398907103825137 [2025-01-09 21:30:22,294 INFO L175 Difference]: Start difference. First operand has 362 places, 355 transitions, 911 flow. Second operand 3 states and 1204 transitions. [2025-01-09 21:30:22,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 355 transitions, 940 flow [2025-01-09 21:30:22,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 355 transitions, 940 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:22,300 INFO L231 Difference]: Finished difference. Result has 363 places, 354 transitions, 913 flow [2025-01-09 21:30:22,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=913, PETRI_PLACES=363, PETRI_TRANSITIONS=354} [2025-01-09 21:30:22,301 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -29 predicate places. [2025-01-09 21:30:22,301 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 354 transitions, 913 flow [2025-01-09 21:30:22,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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-01-09 21:30:22,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:22,302 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:22,302 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:22,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash -528976485, now seen corresponding path program 1 times [2025-01-09 21:30:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84934708] [2025-01-09 21:30:22,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:22,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:30:22,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:30:22,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 21:30:22,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:22,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84934708] [2025-01-09 21:30:22,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84934708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:30:22,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533191259] [2025-01-09 21:30:22,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:22,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:22,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:22,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:30:22,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:30:22,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:30:22,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:30:22,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:22,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:22,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 21:30:22,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:30:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 21:30:22,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:30:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 21:30:23,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533191259] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:30:23,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:30:23,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-01-09 21:30:23,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537571375] [2025-01-09 21:30:23,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:30:23,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 21:30:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:23,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 21:30:23,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-01-09 21:30:23,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 427 [2025-01-09 21:30:23,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 354 transitions, 913 flow. Second operand has 22 states, 22 states have (on average 387.59090909090907) internal successors, (8527), 22 states have internal predecessors, (8527), 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-01-09 21:30:23,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:23,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 427 [2025-01-09 21:30:23,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:24,087 INFO L124 PetriNetUnfolderBase]: 21/1438 cut-off events. [2025-01-09 21:30:24,088 INFO L125 PetriNetUnfolderBase]: For 68/71 co-relation queries the response was YES. [2025-01-09 21:30:24,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 1438 events. 21/1438 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5726 event pairs, 5 based on Foata normal form. 4/1367 useless extension candidates. Maximal degree in co-relation 1708. Up to 19 conditions per place. [2025-01-09 21:30:24,098 INFO L140 encePairwiseOnDemand]: 407/427 looper letters, 23 selfloop transitions, 38 changer transitions 0/374 dead transitions. [2025-01-09 21:30:24,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 374 transitions, 1131 flow [2025-01-09 21:30:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 21:30:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 21:30:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 6610 transitions. [2025-01-09 21:30:24,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105937456949993 [2025-01-09 21:30:24,106 INFO L175 Difference]: Start difference. First operand has 363 places, 354 transitions, 913 flow. Second operand 17 states and 6610 transitions. [2025-01-09 21:30:24,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 374 transitions, 1131 flow [2025-01-09 21:30:24,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 374 transitions, 1127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:24,113 INFO L231 Difference]: Finished difference. Result has 380 places, 368 transitions, 1093 flow [2025-01-09 21:30:24,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1093, PETRI_PLACES=380, PETRI_TRANSITIONS=368} [2025-01-09 21:30:24,114 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2025-01-09 21:30:24,114 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 368 transitions, 1093 flow [2025-01-09 21:30:24,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 387.59090909090907) internal successors, (8527), 22 states have internal predecessors, (8527), 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-01-09 21:30:24,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:24,117 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:24,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:30:24,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:30:24,318 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:24,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1958310459, now seen corresponding path program 2 times [2025-01-09 21:30:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468978730] [2025-01-09 21:30:24,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:30:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:24,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 283 statements into 2 equivalence classes. [2025-01-09 21:30:24,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 133 of 283 statements. [2025-01-09 21:30:24,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:30:24,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-01-09 21:30:24,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:24,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468978730] [2025-01-09 21:30:24,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468978730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:24,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:24,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:24,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729740443] [2025-01-09 21:30:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:24,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:24,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:24,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:24,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:24,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-01-09 21:30:24,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 368 transitions, 1093 flow. Second operand has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 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-01-09 21:30:24,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:24,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-01-09 21:30:24,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:25,236 INFO L124 PetriNetUnfolderBase]: 64/1911 cut-off events. [2025-01-09 21:30:25,237 INFO L125 PetriNetUnfolderBase]: For 147/150 co-relation queries the response was YES. [2025-01-09 21:30:25,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1911 events. 64/1911 cut-off events. For 147/150 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9986 event pairs, 13 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 2308. Up to 80 conditions per place. [2025-01-09 21:30:25,246 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 19 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2025-01-09 21:30:25,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 371 transitions, 1153 flow [2025-01-09 21:30:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2025-01-09 21:30:25,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254488680718189 [2025-01-09 21:30:25,249 INFO L175 Difference]: Start difference. First operand has 380 places, 368 transitions, 1093 flow. Second operand 6 states and 2371 transitions. [2025-01-09 21:30:25,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 371 transitions, 1153 flow [2025-01-09 21:30:25,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 371 transitions, 1101 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-01-09 21:30:25,255 INFO L231 Difference]: Finished difference. Result has 376 places, 367 transitions, 1051 flow [2025-01-09 21:30:25,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=376, PETRI_TRANSITIONS=367} [2025-01-09 21:30:25,256 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2025-01-09 21:30:25,256 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 367 transitions, 1051 flow [2025-01-09 21:30:25,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 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-01-09 21:30:25,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:25,256 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:25,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:25,257 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:25,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:25,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1341461642, now seen corresponding path program 1 times [2025-01-09 21:30:25,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:25,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959164949] [2025-01-09 21:30:25,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:25,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:25,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-09 21:30:25,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-09 21:30:25,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:25,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-01-09 21:30:25,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:25,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959164949] [2025-01-09 21:30:25,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959164949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:25,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:25,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631806408] [2025-01-09 21:30:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:25,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:25,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:25,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:25,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-01-09 21:30:25,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 367 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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-01-09 21:30:25,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:25,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-01-09 21:30:25,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:26,107 INFO L124 PetriNetUnfolderBase]: 36/1532 cut-off events. [2025-01-09 21:30:26,108 INFO L125 PetriNetUnfolderBase]: For 113/116 co-relation queries the response was YES. [2025-01-09 21:30:26,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 1532 events. 36/1532 cut-off events. For 113/116 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6506 event pairs, 7 based on Foata normal form. 0/1461 useless extension candidates. Maximal degree in co-relation 1932. Up to 70 conditions per place. [2025-01-09 21:30:26,116 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 19 selfloop transitions, 6 changer transitions 0/370 dead transitions. [2025-01-09 21:30:26,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 370 transitions, 1111 flow [2025-01-09 21:30:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2025-01-09 21:30:26,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254488680718189 [2025-01-09 21:30:26,119 INFO L175 Difference]: Start difference. First operand has 376 places, 367 transitions, 1051 flow. Second operand 6 states and 2371 transitions. [2025-01-09 21:30:26,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 370 transitions, 1111 flow [2025-01-09 21:30:26,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 370 transitions, 1099 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:26,125 INFO L231 Difference]: Finished difference. Result has 375 places, 366 transitions, 1049 flow [2025-01-09 21:30:26,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=375, PETRI_TRANSITIONS=366} [2025-01-09 21:30:26,126 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2025-01-09 21:30:26,126 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 366 transitions, 1049 flow [2025-01-09 21:30:26,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 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-01-09 21:30:26,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:26,127 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:26,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:26,128 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:26,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1973216638, now seen corresponding path program 1 times [2025-01-09 21:30:26,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:26,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172693441] [2025-01-09 21:30:26,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:26,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:26,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-09 21:30:26,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-09 21:30:26,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:26,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-01-09 21:30:26,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172693441] [2025-01-09 21:30:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172693441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:26,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:26,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204802775] [2025-01-09 21:30:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:26,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:26,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:26,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:26,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 427 [2025-01-09 21:30:26,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 366 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 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-01-09 21:30:26,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:26,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 427 [2025-01-09 21:30:26,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:27,060 INFO L124 PetriNetUnfolderBase]: 64/1857 cut-off events. [2025-01-09 21:30:27,060 INFO L125 PetriNetUnfolderBase]: For 163/166 co-relation queries the response was YES. [2025-01-09 21:30:27,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1857 events. 64/1857 cut-off events. For 163/166 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9839 event pairs, 13 based on Foata normal form. 0/1776 useless extension candidates. Maximal degree in co-relation 2279. Up to 80 conditions per place. [2025-01-09 21:30:27,070 INFO L140 encePairwiseOnDemand]: 421/427 looper letters, 19 selfloop transitions, 6 changer transitions 0/369 dead transitions. [2025-01-09 21:30:27,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 369 transitions, 1109 flow [2025-01-09 21:30:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2025-01-09 21:30:27,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254488680718189 [2025-01-09 21:30:27,072 INFO L175 Difference]: Start difference. First operand has 375 places, 366 transitions, 1049 flow. Second operand 6 states and 2371 transitions. [2025-01-09 21:30:27,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 369 transitions, 1109 flow [2025-01-09 21:30:27,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 369 transitions, 1097 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:27,077 INFO L231 Difference]: Finished difference. Result has 374 places, 365 transitions, 1047 flow [2025-01-09 21:30:27,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1047, PETRI_PLACES=374, PETRI_TRANSITIONS=365} [2025-01-09 21:30:27,077 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -18 predicate places. [2025-01-09 21:30:27,078 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 365 transitions, 1047 flow [2025-01-09 21:30:27,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 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-01-09 21:30:27,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:27,078 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:27,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:30:27,078 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:27,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1167324122, now seen corresponding path program 1 times [2025-01-09 21:30:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:27,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151906245] [2025-01-09 21:30:27,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:27,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:27,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 21:30:27,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 21:30:27,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:27,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-01-09 21:30:27,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151906245] [2025-01-09 21:30:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151906245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298794174] [2025-01-09 21:30:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:27,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:27,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-01-09 21:30:27,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 365 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-01-09 21:30:27,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:27,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-01-09 21:30:27,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:27,324 INFO L124 PetriNetUnfolderBase]: 42/1534 cut-off events. [2025-01-09 21:30:27,324 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-01-09 21:30:27,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 1534 events. 42/1534 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6630 event pairs, 17 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 1934. Up to 79 conditions per place. [2025-01-09 21:30:27,333 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 11 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-01-09 21:30:27,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 365 transitions, 1076 flow [2025-01-09 21:30:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-01-09 21:30:27,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398907103825137 [2025-01-09 21:30:27,334 INFO L175 Difference]: Start difference. First operand has 374 places, 365 transitions, 1047 flow. Second operand 3 states and 1204 transitions. [2025-01-09 21:30:27,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 365 transitions, 1076 flow [2025-01-09 21:30:27,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 365 transitions, 1064 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:27,339 INFO L231 Difference]: Finished difference. Result has 370 places, 364 transitions, 1039 flow [2025-01-09 21:30:27,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=370, PETRI_TRANSITIONS=364} [2025-01-09 21:30:27,339 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2025-01-09 21:30:27,339 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 364 transitions, 1039 flow [2025-01-09 21:30:27,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 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-01-09 21:30:27,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:27,340 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:30:27,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:30:27,340 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-01-09 21:30:27,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1539798222, now seen corresponding path program 1 times [2025-01-09 21:30:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:27,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57934943] [2025-01-09 21:30:27,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:27,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-09 21:30:27,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-09 21:30:27,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:27,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-01-09 21:30:27,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:27,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57934943] [2025-01-09 21:30:27,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57934943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:27,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:27,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636042957] [2025-01-09 21:30:27,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:27,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:27,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:27,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:27,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:27,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 427 [2025-01-09 21:30:27,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 364 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-01-09 21:30:27,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:27,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 427 [2025-01-09 21:30:27,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:27,670 INFO L124 PetriNetUnfolderBase]: 76/1736 cut-off events. [2025-01-09 21:30:27,670 INFO L125 PetriNetUnfolderBase]: For 171/174 co-relation queries the response was YES. [2025-01-09 21:30:27,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 1736 events. 76/1736 cut-off events. For 171/174 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10084 event pairs, 43 based on Foata normal form. 0/1663 useless extension candidates. Maximal degree in co-relation 2086. Up to 127 conditions per place. [2025-01-09 21:30:27,679 INFO L140 encePairwiseOnDemand]: 424/427 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2025-01-09 21:30:27,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 364 transitions, 1068 flow [2025-01-09 21:30:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2025-01-09 21:30:27,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398907103825137 [2025-01-09 21:30:27,681 INFO L175 Difference]: Start difference. First operand has 370 places, 364 transitions, 1039 flow. Second operand 3 states and 1204 transitions. [2025-01-09 21:30:27,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 364 transitions, 1068 flow [2025-01-09 21:30:27,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 364 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:27,685 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2025-01-09 21:30:27,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=427, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2025-01-09 21:30:27,685 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2025-01-09 21:30:27,686 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2025-01-09 21:30:27,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-01-09 21:30:27,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 58 remaining) [2025-01-09 21:30:27,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 58 remaining) [2025-01-09 21:30:27,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 58 remaining) [2025-01-09 21:30:27,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 58 remaining) [2025-01-09 21:30:27,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (53 of 58 remaining) [2025-01-09 21:30:27,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (52 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (51 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (50 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (46 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (45 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (44 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (42 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (41 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 58 remaining) [2025-01-09 21:30:27,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (38 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (37 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (34 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 58 remaining) [2025-01-09 21:30:27,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (17 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (16 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (14 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (13 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (12 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (11 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (5 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (2 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (1 of 58 remaining) [2025-01-09 21:30:27,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (0 of 58 remaining) [2025-01-09 21:30:27,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:30:27,692 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:27,695 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:27,696 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:27,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:27 BasicIcfg [2025-01-09 21:30:27,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:27,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:27,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:27,700 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:27,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:14" (3/4) ... [2025-01-09 21:30:27,701 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:27,703 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:27,703 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:27,707 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-01-09 21:30:27,708 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:27,708 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:27,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:27,779 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:27,779 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:27,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:27,780 INFO L158 Benchmark]: Toolchain (without parser) took 13970.41ms. Allocated memory was 201.3MB in the beginning and 645.9MB in the end (delta: 444.6MB). Free memory was 154.9MB in the beginning and 445.3MB in the end (delta: -290.4MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. [2025-01-09 21:30:27,781 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:27,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.67ms. Allocated memory is still 201.3MB. Free memory was 154.6MB in the beginning and 141.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:27,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.47ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 139.0MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:27,782 INFO L158 Benchmark]: Boogie Preprocessor took 29.98ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 137.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:27,782 INFO L158 Benchmark]: RCFGBuilder took 592.61ms. Allocated memory is still 201.3MB. Free memory was 136.7MB in the beginning and 105.8MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:30:27,783 INFO L158 Benchmark]: TraceAbstraction took 12996.75ms. Allocated memory was 201.3MB in the beginning and 645.9MB in the end (delta: 444.6MB). Free memory was 105.4MB in the beginning and 453.7MB in the end (delta: -348.3MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2025-01-09 21:30:27,783 INFO L158 Benchmark]: Witness Printer took 80.10ms. Allocated memory is still 645.9MB. Free memory was 453.7MB in the beginning and 445.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:27,783 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.67ms. Allocated memory is still 201.3MB. Free memory was 154.6MB in the beginning and 141.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.47ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 139.0MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.98ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 137.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 592.61ms. Allocated memory is still 201.3MB. Free memory was 136.7MB in the beginning and 105.8MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12996.75ms. Allocated memory was 201.3MB in the beginning and 645.9MB in the end (delta: 444.6MB). Free memory was 105.4MB in the beginning and 453.7MB in the end (delta: -348.3MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. * Witness Printer took 80.10ms. Allocated memory is still 645.9MB. Free memory was 453.7MB in the beginning and 445.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 606 locations, 58 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.8s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2620 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1721 mSDsluCounter, 1361 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 980 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4256 IncrementalHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 381 mSDtfsCounter, 4256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 768 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1093occurred in iteration=21, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 4795 NumberOfCodeBlocks, 4555 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 5145 ConstructedInterpolants, 0 QuantifiedInterpolants, 6954 SizeOfPredicates, 14 NumberOfNonLiveVariables, 856 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 2182/2329 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:27,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE