./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3-extended.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/parallel-misc-3-extended.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 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:15,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:15,163 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:32:15,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:15,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:15,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:15,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:15,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:15,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:15,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:15,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:15,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:15,194 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:15,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:15,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:15,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:15,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:15,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:15,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:15,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:15,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:15,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:15,195 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:15,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:15,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:15,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:15,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:15,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:15,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:15,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:15,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:15,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:15,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:15,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:15,197 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 -> 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f [2025-01-09 21:32:15,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:15,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:15,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:15,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:15,456 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:15,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-01-09 21:32:16,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a04ca954/dc6907af436a4bdc9f3741aec148c5f3/FLAGa2993a532 [2025-01-09 21:32:16,936 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:16,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-01-09 21:32:16,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a04ca954/dc6907af436a4bdc9f3741aec148c5f3/FLAGa2993a532 [2025-01-09 21:32:16,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a04ca954/dc6907af436a4bdc9f3741aec148c5f3 [2025-01-09 21:32:16,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:16,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:16,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:16,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:16,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:16,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:16" (1/1) ... [2025-01-09 21:32:16,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a2fa8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:16, skipping insertion in model container [2025-01-09 21:32:16,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:16" (1/1) ... [2025-01-09 21:32:16,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:17,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:17,123 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:17,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:17,163 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:17,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17 WrapperNode [2025-01-09 21:32:17,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:17,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:17,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:17,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:17,169 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:32:17" (1/1) ... [2025-01-09 21:32:17,174 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:32:17" (1/1) ... [2025-01-09 21:32:17,188 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2025-01-09 21:32:17,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:17,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:17,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:17,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:17,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:17,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:17,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:17,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:17,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (1/1) ... [2025-01-09 21:32:17,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:17,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:17,243 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:32:17,245 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:32:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:17,264 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:32:17,331 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:17,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:17,583 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:17,583 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:17,597 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:17,597 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:32:17,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:17 BoogieIcfgContainer [2025-01-09 21:32:17,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:17,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:17,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:17,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:17,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:16" (1/3) ... [2025-01-09 21:32:17,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7036a638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:17, skipping insertion in model container [2025-01-09 21:32:17,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:17" (2/3) ... [2025-01-09 21:32:17,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7036a638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:17, skipping insertion in model container [2025-01-09 21:32:17,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:17" (3/3) ... [2025-01-09 21:32:17,604 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-01-09 21:32:17,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:17,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 207 locations, 1 initial locations, 3 loop locations, and 24 error locations. [2025-01-09 21:32:17,618 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:17,708 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:32:17,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 222 transitions, 465 flow [2025-01-09 21:32:17,804 INFO L124 PetriNetUnfolderBase]: 16/219 cut-off events. [2025-01-09 21:32:17,807 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:32:17,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 219 events. 16/219 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 457 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 159. Up to 4 conditions per place. [2025-01-09 21:32:17,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 222 transitions, 465 flow [2025-01-09 21:32:17,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 202 transitions, 419 flow [2025-01-09 21:32:17,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:17,841 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;@53b542aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:17,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-01-09 21:32:17,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:17,847 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:32:17,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:17,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:17,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:17,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:17,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1619405273, now seen corresponding path program 1 times [2025-01-09 21:32:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:17,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956294516] [2025-01-09 21:32:17,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:17,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:32:17,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:32:17,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:17,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:17,992 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:32:17,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956294516] [2025-01-09 21:32:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956294516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034822041] [2025-01-09 21:32:17,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:18,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:18,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:18,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:18,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-01-09 21:32:18,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 202 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:32:18,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:18,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-01-09 21:32:18,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:18,191 INFO L124 PetriNetUnfolderBase]: 33/297 cut-off events. [2025-01-09 21:32:18,193 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:32:18,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 297 events. 33/297 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1082 event pairs, 12 based on Foata normal form. 29/270 useless extension candidates. Maximal degree in co-relation 299. Up to 42 conditions per place. [2025-01-09 21:32:18,201 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 14 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-01-09 21:32:18,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 198 transitions, 443 flow [2025-01-09 21:32:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-01-09 21:32:18,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-01-09 21:32:18,216 INFO L175 Difference]: Start difference. First operand has 197 places, 202 transitions, 419 flow. Second operand 3 states and 614 transitions. [2025-01-09 21:32:18,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 198 transitions, 443 flow [2025-01-09 21:32:18,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 198 transitions, 434 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:32:18,225 INFO L231 Difference]: Finished difference. Result has 193 places, 198 transitions, 406 flow [2025-01-09 21:32:18,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=193, PETRI_TRANSITIONS=198} [2025-01-09 21:32:18,232 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -4 predicate places. [2025-01-09 21:32:18,232 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 198 transitions, 406 flow [2025-01-09 21:32:18,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:32:18,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:18,232 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] [2025-01-09 21:32:18,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:18,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:18,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1447928909, now seen corresponding path program 1 times [2025-01-09 21:32:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863222356] [2025-01-09 21:32:18,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:18,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 21:32:18,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 21:32:18,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:18,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:18,283 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:32:18,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:18,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863222356] [2025-01-09 21:32:18,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863222356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:18,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:18,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:18,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840254659] [2025-01-09 21:32:18,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:18,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:18,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:18,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:18,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:18,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-01-09 21:32:18,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 198 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:32:18,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:18,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-01-09 21:32:18,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:18,390 INFO L124 PetriNetUnfolderBase]: 81/580 cut-off events. [2025-01-09 21:32:18,390 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:32:18,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 580 events. 81/580 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3263 event pairs, 36 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 675. Up to 84 conditions per place. [2025-01-09 21:32:18,395 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 14 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2025-01-09 21:32:18,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 197 transitions, 436 flow [2025-01-09 21:32:18,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2025-01-09 21:32:18,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9174174174174174 [2025-01-09 21:32:18,397 INFO L175 Difference]: Start difference. First operand has 193 places, 198 transitions, 406 flow. Second operand 3 states and 611 transitions. [2025-01-09 21:32:18,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 197 transitions, 436 flow [2025-01-09 21:32:18,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 197 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:18,402 INFO L231 Difference]: Finished difference. Result has 192 places, 197 transitions, 404 flow [2025-01-09 21:32:18,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=192, PETRI_TRANSITIONS=197} [2025-01-09 21:32:18,404 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -5 predicate places. [2025-01-09 21:32:18,404 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 197 transitions, 404 flow [2025-01-09 21:32:18,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:32:18,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:18,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:18,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:18,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:18,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 740214750, now seen corresponding path program 1 times [2025-01-09 21:32:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:18,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661170720] [2025-01-09 21:32:18,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:18,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:18,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:32:18,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:32:18,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:18,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:18,444 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:32:18,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:18,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661170720] [2025-01-09 21:32:18,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661170720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:18,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:18,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473775277] [2025-01-09 21:32:18,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:18,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:18,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:18,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:18,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:18,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-01-09 21:32:18,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 197 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:32:18,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:18,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-01-09 21:32:18,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:18,551 INFO L124 PetriNetUnfolderBase]: 48/406 cut-off events. [2025-01-09 21:32:18,551 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:32:18,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 406 events. 48/406 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1912 event pairs, 20 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 443. Up to 55 conditions per place. [2025-01-09 21:32:18,554 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 14 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2025-01-09 21:32:18,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 196 transitions, 434 flow [2025-01-09 21:32:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2025-01-09 21:32:18,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9174174174174174 [2025-01-09 21:32:18,556 INFO L175 Difference]: Start difference. First operand has 192 places, 197 transitions, 404 flow. Second operand 3 states and 611 transitions. [2025-01-09 21:32:18,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 196 transitions, 434 flow [2025-01-09 21:32:18,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 196 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:18,561 INFO L231 Difference]: Finished difference. Result has 191 places, 196 transitions, 402 flow [2025-01-09 21:32:18,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=191, PETRI_TRANSITIONS=196} [2025-01-09 21:32:18,562 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -6 predicate places. [2025-01-09 21:32:18,562 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 196 transitions, 402 flow [2025-01-09 21:32:18,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:32:18,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:18,563 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] [2025-01-09 21:32:18,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:18,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:18,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash -572941770, now seen corresponding path program 1 times [2025-01-09 21:32:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:18,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494373601] [2025-01-09 21:32:18,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:18,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:18,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:32:18,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:32:18,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:18,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:18,600 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:32:18,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:18,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494373601] [2025-01-09 21:32:18,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494373601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:18,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:18,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:18,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788792653] [2025-01-09 21:32:18,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:18,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:18,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:18,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:18,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:18,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-01-09 21:32:18,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 196 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:18,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:18,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-01-09 21:32:18,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:18,657 INFO L124 PetriNetUnfolderBase]: 28/289 cut-off events. [2025-01-09 21:32:18,658 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:32:18,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 289 events. 28/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1011 event pairs, 8 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 303. Up to 31 conditions per place. [2025-01-09 21:32:18,660 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 12 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2025-01-09 21:32:18,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 195 transitions, 428 flow [2025-01-09 21:32:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2025-01-09 21:32:18,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9234234234234234 [2025-01-09 21:32:18,662 INFO L175 Difference]: Start difference. First operand has 191 places, 196 transitions, 402 flow. Second operand 3 states and 615 transitions. [2025-01-09 21:32:18,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 195 transitions, 428 flow [2025-01-09 21:32:18,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 195 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:18,664 INFO L231 Difference]: Finished difference. Result has 190 places, 195 transitions, 400 flow [2025-01-09 21:32:18,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=190, PETRI_TRANSITIONS=195} [2025-01-09 21:32:18,665 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -7 predicate places. [2025-01-09 21:32:18,665 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 195 transitions, 400 flow [2025-01-09 21:32:18,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:18,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:18,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:18,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:18,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:18,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 561620857, now seen corresponding path program 1 times [2025-01-09 21:32:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418867059] [2025-01-09 21:32:18,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:18,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:32:18,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:32:18,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:18,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:18,714 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:32:18,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:18,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418867059] [2025-01-09 21:32:18,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418867059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:18,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:18,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378398085] [2025-01-09 21:32:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:18,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:18,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:18,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:18,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-01-09 21:32:18,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:18,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:18,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-01-09 21:32:18,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:18,822 INFO L124 PetriNetUnfolderBase]: 64/560 cut-off events. [2025-01-09 21:32:18,822 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:18,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 560 events. 64/560 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3042 event pairs, 20 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 597. Up to 53 conditions per place. [2025-01-09 21:32:18,829 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 12 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-01-09 21:32:18,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 194 transitions, 426 flow [2025-01-09 21:32:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2025-01-09 21:32:18,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9234234234234234 [2025-01-09 21:32:18,833 INFO L175 Difference]: Start difference. First operand has 190 places, 195 transitions, 400 flow. Second operand 3 states and 615 transitions. [2025-01-09 21:32:18,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 194 transitions, 426 flow [2025-01-09 21:32:18,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 194 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:18,837 INFO L231 Difference]: Finished difference. Result has 189 places, 194 transitions, 398 flow [2025-01-09 21:32:18,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=189, PETRI_TRANSITIONS=194} [2025-01-09 21:32:18,838 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -8 predicate places. [2025-01-09 21:32:18,838 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 194 transitions, 398 flow [2025-01-09 21:32:18,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:18,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:18,838 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] [2025-01-09 21:32:18,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:18,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:18,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:18,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1132760117, now seen corresponding path program 1 times [2025-01-09 21:32:18,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:18,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103384171] [2025-01-09 21:32:18,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:18,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:32:18,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:32:18,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:18,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:18,892 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:32:18,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103384171] [2025-01-09 21:32:18,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103384171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:18,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:18,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976961390] [2025-01-09 21:32:18,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:18,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:18,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:18,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:18,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:18,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-01-09 21:32:18,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 194 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:18,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:18,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-01-09 21:32:18,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:18,964 INFO L124 PetriNetUnfolderBase]: 45/431 cut-off events. [2025-01-09 21:32:18,964 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:32:18,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 431 events. 45/431 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1978 event pairs, 12 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 437. Up to 39 conditions per place. [2025-01-09 21:32:18,968 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 12 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-01-09 21:32:18,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 193 transitions, 424 flow [2025-01-09 21:32:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2025-01-09 21:32:18,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9234234234234234 [2025-01-09 21:32:18,969 INFO L175 Difference]: Start difference. First operand has 189 places, 194 transitions, 398 flow. Second operand 3 states and 615 transitions. [2025-01-09 21:32:18,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 193 transitions, 424 flow [2025-01-09 21:32:18,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 193 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:18,972 INFO L231 Difference]: Finished difference. Result has 188 places, 193 transitions, 396 flow [2025-01-09 21:32:18,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=188, PETRI_TRANSITIONS=193} [2025-01-09 21:32:18,973 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-01-09 21:32:18,973 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 193 transitions, 396 flow [2025-01-09 21:32:18,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:18,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:18,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:18,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:18,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:18,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1227421452, now seen corresponding path program 1 times [2025-01-09 21:32:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:18,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560734467] [2025-01-09 21:32:18,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:18,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:32:18,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:32:18,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:18,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:19,009 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:32:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560734467] [2025-01-09 21:32:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560734467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:19,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157658678] [2025-01-09 21:32:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:19,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:19,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:19,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:19,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:19,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 222 [2025-01-09 21:32:19,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 193 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 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:32:19,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:19,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 222 [2025-01-09 21:32:19,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:19,070 INFO L124 PetriNetUnfolderBase]: 42/418 cut-off events. [2025-01-09 21:32:19,070 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:32:19,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 418 events. 42/418 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1682 event pairs, 6 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 424. Up to 27 conditions per place. [2025-01-09 21:32:19,074 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 12 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2025-01-09 21:32:19,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 195 transitions, 431 flow [2025-01-09 21:32:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2025-01-09 21:32:19,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2025-01-09 21:32:19,076 INFO L175 Difference]: Start difference. First operand has 188 places, 193 transitions, 396 flow. Second operand 3 states and 627 transitions. [2025-01-09 21:32:19,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 195 transitions, 431 flow [2025-01-09 21:32:19,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:19,079 INFO L231 Difference]: Finished difference. Result has 188 places, 193 transitions, 400 flow [2025-01-09 21:32:19,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=188, PETRI_TRANSITIONS=193} [2025-01-09 21:32:19,079 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-01-09 21:32:19,079 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 193 transitions, 400 flow [2025-01-09 21:32:19,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 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:32:19,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:19,080 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] [2025-01-09 21:32:19,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:19,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:19,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1238536389, now seen corresponding path program 1 times [2025-01-09 21:32:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:19,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723125630] [2025-01-09 21:32:19,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:19,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:32:19,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:32:19,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:19,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:19,128 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:32:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:19,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723125630] [2025-01-09 21:32:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723125630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:19,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518427807] [2025-01-09 21:32:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:19,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:19,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:19,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:19,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-01-09 21:32:19,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 193 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:32:19,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:19,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-01-09 21:32:19,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:19,197 INFO L124 PetriNetUnfolderBase]: 38/297 cut-off events. [2025-01-09 21:32:19,197 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:32:19,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 297 events. 38/297 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1116 event pairs, 2 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 315. Up to 45 conditions per place. [2025-01-09 21:32:19,202 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 17 selfloop transitions, 3 changer transitions 0/195 dead transitions. [2025-01-09 21:32:19,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 195 transitions, 449 flow [2025-01-09 21:32:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2025-01-09 21:32:19,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9264264264264265 [2025-01-09 21:32:19,204 INFO L175 Difference]: Start difference. First operand has 188 places, 193 transitions, 400 flow. Second operand 3 states and 617 transitions. [2025-01-09 21:32:19,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 195 transitions, 449 flow [2025-01-09 21:32:19,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 195 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:19,206 INFO L231 Difference]: Finished difference. Result has 187 places, 191 transitions, 405 flow [2025-01-09 21:32:19,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=187, PETRI_TRANSITIONS=191} [2025-01-09 21:32:19,207 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -10 predicate places. [2025-01-09 21:32:19,207 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 191 transitions, 405 flow [2025-01-09 21:32:19,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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:32:19,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:19,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:19,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:19,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:19,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1012912199, now seen corresponding path program 1 times [2025-01-09 21:32:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451116974] [2025-01-09 21:32:19,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:19,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:32:19,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:32:19,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:19,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:19,249 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:32:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451116974] [2025-01-09 21:32:19,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451116974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:19,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:19,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064606577] [2025-01-09 21:32:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:19,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:19,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:19,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:19,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:19,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 222 [2025-01-09 21:32:19,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 191 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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:32:19,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:19,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 222 [2025-01-09 21:32:19,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:19,315 INFO L124 PetriNetUnfolderBase]: 91/740 cut-off events. [2025-01-09 21:32:19,315 INFO L125 PetriNetUnfolderBase]: For 11/22 co-relation queries the response was YES. [2025-01-09 21:32:19,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 740 events. 91/740 cut-off events. For 11/22 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4520 event pairs, 13 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 733. Up to 49 conditions per place. [2025-01-09 21:32:19,321 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 14 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2025-01-09 21:32:19,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 195 transitions, 448 flow [2025-01-09 21:32:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2025-01-09 21:32:19,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-01-09 21:32:19,323 INFO L175 Difference]: Start difference. First operand has 187 places, 191 transitions, 405 flow. Second operand 3 states and 629 transitions. [2025-01-09 21:32:19,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 195 transitions, 448 flow [2025-01-09 21:32:19,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:19,325 INFO L231 Difference]: Finished difference. Result has 188 places, 191 transitions, 410 flow [2025-01-09 21:32:19,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=188, PETRI_TRANSITIONS=191} [2025-01-09 21:32:19,326 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-01-09 21:32:19,326 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 191 transitions, 410 flow [2025-01-09 21:32:19,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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:32:19,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:19,326 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] [2025-01-09 21:32:19,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:19,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:19,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash -772312372, now seen corresponding path program 1 times [2025-01-09 21:32:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760231718] [2025-01-09 21:32:19,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:19,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:32:19,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:32:19,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:19,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:19,366 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:32:19,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:19,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760231718] [2025-01-09 21:32:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760231718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:19,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134454603] [2025-01-09 21:32:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:19,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:19,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:19,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:19,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:19,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-01-09 21:32:19,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 191 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 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:32:19,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:19,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-01-09 21:32:19,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:19,467 INFO L124 PetriNetUnfolderBase]: 115/652 cut-off events. [2025-01-09 21:32:19,467 INFO L125 PetriNetUnfolderBase]: For 26/32 co-relation queries the response was YES. [2025-01-09 21:32:19,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 652 events. 115/652 cut-off events. For 26/32 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3952 event pairs, 13 based on Foata normal form. 1/563 useless extension candidates. Maximal degree in co-relation 753. Up to 112 conditions per place. [2025-01-09 21:32:19,472 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 18 selfloop transitions, 3 changer transitions 0/194 dead transitions. [2025-01-09 21:32:19,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 194 transitions, 462 flow [2025-01-09 21:32:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-01-09 21:32:19,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279279279279279 [2025-01-09 21:32:19,473 INFO L175 Difference]: Start difference. First operand has 188 places, 191 transitions, 410 flow. Second operand 3 states and 618 transitions. [2025-01-09 21:32:19,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 194 transitions, 462 flow [2025-01-09 21:32:19,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 194 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:19,475 INFO L231 Difference]: Finished difference. Result has 187 places, 189 transitions, 415 flow [2025-01-09 21:32:19,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=187, PETRI_TRANSITIONS=189} [2025-01-09 21:32:19,476 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -10 predicate places. [2025-01-09 21:32:19,476 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 189 transitions, 415 flow [2025-01-09 21:32:19,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 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:32:19,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:19,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:19,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:19,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:19,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1128073334, now seen corresponding path program 1 times [2025-01-09 21:32:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:19,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677564161] [2025-01-09 21:32:19,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:19,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:19,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:32:19,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:32:19,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:19,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:19,514 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:32:19,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:19,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677564161] [2025-01-09 21:32:19,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677564161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:19,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:19,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:19,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770458537] [2025-01-09 21:32:19,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:19,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:19,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:19,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:19,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:19,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 222 [2025-01-09 21:32:19,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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:32:19,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:19,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 222 [2025-01-09 21:32:19,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:19,604 INFO L124 PetriNetUnfolderBase]: 80/663 cut-off events. [2025-01-09 21:32:19,604 INFO L125 PetriNetUnfolderBase]: For 24/30 co-relation queries the response was YES. [2025-01-09 21:32:19,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 663 events. 80/663 cut-off events. For 24/30 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3622 event pairs, 12 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 564. Up to 49 conditions per place. [2025-01-09 21:32:19,610 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 14 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2025-01-09 21:32:19,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 193 transitions, 457 flow [2025-01-09 21:32:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2025-01-09 21:32:19,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-01-09 21:32:19,612 INFO L175 Difference]: Start difference. First operand has 187 places, 189 transitions, 415 flow. Second operand 3 states and 629 transitions. [2025-01-09 21:32:19,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 193 transitions, 457 flow [2025-01-09 21:32:19,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 193 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:19,614 INFO L231 Difference]: Finished difference. Result has 188 places, 189 transitions, 420 flow [2025-01-09 21:32:19,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=188, PETRI_TRANSITIONS=189} [2025-01-09 21:32:19,615 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-01-09 21:32:19,615 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 189 transitions, 420 flow [2025-01-09 21:32:19,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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:32:19,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:19,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:19,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:32:19,616 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:19,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1275509482, now seen corresponding path program 1 times [2025-01-09 21:32:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:19,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479105031] [2025-01-09 21:32:19,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:19,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:19,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:32:19,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:32:19,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:19,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:19,651 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:32:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:19,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479105031] [2025-01-09 21:32:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479105031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:19,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:19,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:19,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134430013] [2025-01-09 21:32:19,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:19,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:19,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:19,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:19,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-01-09 21:32:19,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 189 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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:32:19,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:19,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-01-09 21:32:19,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:19,711 INFO L124 PetriNetUnfolderBase]: 38/300 cut-off events. [2025-01-09 21:32:19,711 INFO L125 PetriNetUnfolderBase]: For 10/30 co-relation queries the response was YES. [2025-01-09 21:32:19,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 300 events. 38/300 cut-off events. For 10/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1193 event pairs, 14 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 379. Up to 49 conditions per place. [2025-01-09 21:32:19,714 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 16 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-01-09 21:32:19,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 190 transitions, 461 flow [2025-01-09 21:32:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-01-09 21:32:19,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279279279279279 [2025-01-09 21:32:19,715 INFO L175 Difference]: Start difference. First operand has 188 places, 189 transitions, 420 flow. Second operand 3 states and 618 transitions. [2025-01-09 21:32:19,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 190 transitions, 461 flow [2025-01-09 21:32:19,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 190 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:19,719 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 420 flow [2025-01-09 21:32:19,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=188, PETRI_TRANSITIONS=188} [2025-01-09 21:32:19,720 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2025-01-09 21:32:19,720 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 420 flow [2025-01-09 21:32:19,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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:32:19,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:19,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:19,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:32:19,721 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:19,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1685767385, now seen corresponding path program 1 times [2025-01-09 21:32:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662715561] [2025-01-09 21:32:19,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:19,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:32:19,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:32:19,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:19,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:19,758 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:32:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:19,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662715561] [2025-01-09 21:32:19,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662715561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:19,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:19,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:19,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662451698] [2025-01-09 21:32:19,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:19,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:19,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:19,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:19,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:19,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 222 [2025-01-09 21:32:19,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 188 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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:32:19,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:19,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 222 [2025-01-09 21:32:19,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:19,852 INFO L124 PetriNetUnfolderBase]: 112/682 cut-off events. [2025-01-09 21:32:19,852 INFO L125 PetriNetUnfolderBase]: For 44/55 co-relation queries the response was YES. [2025-01-09 21:32:19,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 682 events. 112/682 cut-off events. For 44/55 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4058 event pairs, 12 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 677. Up to 111 conditions per place. [2025-01-09 21:32:19,857 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 17 selfloop transitions, 3 changer transitions 0/190 dead transitions. [2025-01-09 21:32:19,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 190 transitions, 466 flow [2025-01-09 21:32:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2025-01-09 21:32:19,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9264264264264265 [2025-01-09 21:32:19,859 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 420 flow. Second operand 3 states and 617 transitions. [2025-01-09 21:32:19,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 190 transitions, 466 flow [2025-01-09 21:32:19,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 190 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:19,861 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 423 flow [2025-01-09 21:32:19,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=423, PETRI_PLACES=186, PETRI_TRANSITIONS=186} [2025-01-09 21:32:19,862 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -11 predicate places. [2025-01-09 21:32:19,862 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 423 flow [2025-01-09 21:32:19,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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:32:19,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:19,863 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] [2025-01-09 21:32:19,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:32:19,863 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:19,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash -252703309, now seen corresponding path program 1 times [2025-01-09 21:32:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:19,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504288192] [2025-01-09 21:32:19,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:19,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 21:32:19,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 21:32:19,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:19,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:19,890 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:32:19,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:19,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504288192] [2025-01-09 21:32:19,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504288192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:19,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:19,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:19,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14409289] [2025-01-09 21:32:19,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:19,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:19,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:19,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:19,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-01-09 21:32:19,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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:32:19,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:19,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-01-09 21:32:19,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:19,966 INFO L124 PetriNetUnfolderBase]: 115/655 cut-off events. [2025-01-09 21:32:19,967 INFO L125 PetriNetUnfolderBase]: For 37/41 co-relation queries the response was YES. [2025-01-09 21:32:19,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 655 events. 115/655 cut-off events. For 37/41 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4010 event pairs, 49 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 810. Up to 114 conditions per place. [2025-01-09 21:32:19,972 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 18 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-01-09 21:32:19,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 472 flow [2025-01-09 21:32:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2025-01-09 21:32:19,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9309309309309309 [2025-01-09 21:32:19,974 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 423 flow. Second operand 3 states and 620 transitions. [2025-01-09 21:32:19,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 189 transitions, 472 flow [2025-01-09 21:32:19,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 189 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:32:19,977 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 422 flow [2025-01-09 21:32:19,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-01-09 21:32:19,977 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -11 predicate places. [2025-01-09 21:32:19,977 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 422 flow [2025-01-09 21:32:19,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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:32:19,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:19,978 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:32:19,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:32:19,978 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:19,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1854412782, now seen corresponding path program 1 times [2025-01-09 21:32:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:19,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750932293] [2025-01-09 21:32:19,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:19,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:19,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:32:19,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:32:19,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:19,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:20,010 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:32:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750932293] [2025-01-09 21:32:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750932293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:20,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931920887] [2025-01-09 21:32:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:20,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:20,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:20,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 222 [2025-01-09 21:32:20,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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:32:20,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:20,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 222 [2025-01-09 21:32:20,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:20,088 INFO L124 PetriNetUnfolderBase]: 108/654 cut-off events. [2025-01-09 21:32:20,088 INFO L125 PetriNetUnfolderBase]: For 65/87 co-relation queries the response was YES. [2025-01-09 21:32:20,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 654 events. 108/654 cut-off events. For 65/87 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3772 event pairs, 44 based on Foata normal form. 1/570 useless extension candidates. Maximal degree in co-relation 682. Up to 115 conditions per place. [2025-01-09 21:32:20,093 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 18 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-01-09 21:32:20,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 188 transitions, 470 flow [2025-01-09 21:32:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2025-01-09 21:32:20,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9309309309309309 [2025-01-09 21:32:20,095 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 422 flow. Second operand 3 states and 620 transitions. [2025-01-09 21:32:20,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 188 transitions, 470 flow [2025-01-09 21:32:20,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 188 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:20,097 INFO L231 Difference]: Finished difference. Result has 185 places, 184 transitions, 420 flow [2025-01-09 21:32:20,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=185, PETRI_TRANSITIONS=184} [2025-01-09 21:32:20,098 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -12 predicate places. [2025-01-09 21:32:20,098 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 184 transitions, 420 flow [2025-01-09 21:32:20,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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:32:20,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:20,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:20,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:32:20,098 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:20,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:20,099 INFO L85 PathProgramCache]: Analyzing trace with hash 896959294, now seen corresponding path program 1 times [2025-01-09 21:32:20,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:20,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979501761] [2025-01-09 21:32:20,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:20,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:32:20,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:32:20,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:20,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:20,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979501761] [2025-01-09 21:32:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979501761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:20,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861525634] [2025-01-09 21:32:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:20,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:20,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:20,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:20,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 222 [2025-01-09 21:32:20,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 184 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:32:20,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:20,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 222 [2025-01-09 21:32:20,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:20,183 INFO L124 PetriNetUnfolderBase]: 36/309 cut-off events. [2025-01-09 21:32:20,183 INFO L125 PetriNetUnfolderBase]: For 10/19 co-relation queries the response was YES. [2025-01-09 21:32:20,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 309 events. 36/309 cut-off events. For 10/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1225 event pairs, 12 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 397. Up to 44 conditions per place. [2025-01-09 21:32:20,185 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 14 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2025-01-09 21:32:20,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 457 flow [2025-01-09 21:32:20,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2025-01-09 21:32:20,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.933933933933934 [2025-01-09 21:32:20,187 INFO L175 Difference]: Start difference. First operand has 185 places, 184 transitions, 420 flow. Second operand 3 states and 622 transitions. [2025-01-09 21:32:20,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 457 flow [2025-01-09 21:32:20,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 185 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:20,189 INFO L231 Difference]: Finished difference. Result has 184 places, 183 transitions, 418 flow [2025-01-09 21:32:20,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2025-01-09 21:32:20,190 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -13 predicate places. [2025-01-09 21:32:20,190 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 418 flow [2025-01-09 21:32:20,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:32:20,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:20,190 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] [2025-01-09 21:32:20,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:32:20,190 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:20,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1871951835, now seen corresponding path program 1 times [2025-01-09 21:32:20,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:20,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806560206] [2025-01-09 21:32:20,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:20,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:20,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:32:20,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:32:20,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:20,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:20,215 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:32:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:20,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806560206] [2025-01-09 21:32:20,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806560206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:20,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:20,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:20,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100884078] [2025-01-09 21:32:20,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:20,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:20,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:20,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:20,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:20,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 222 [2025-01-09 21:32:20,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:32:20,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:20,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 222 [2025-01-09 21:32:20,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:20,301 INFO L124 PetriNetUnfolderBase]: 106/664 cut-off events. [2025-01-09 21:32:20,301 INFO L125 PetriNetUnfolderBase]: For 35/38 co-relation queries the response was YES. [2025-01-09 21:32:20,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 664 events. 106/664 cut-off events. For 35/38 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3973 event pairs, 40 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 930. Up to 97 conditions per place. [2025-01-09 21:32:20,305 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 16 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-01-09 21:32:20,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 186 transitions, 463 flow [2025-01-09 21:32:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2025-01-09 21:32:20,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2025-01-09 21:32:20,306 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 418 flow. Second operand 3 states and 624 transitions. [2025-01-09 21:32:20,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 186 transitions, 463 flow [2025-01-09 21:32:20,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:20,309 INFO L231 Difference]: Finished difference. Result has 183 places, 182 transitions, 416 flow [2025-01-09 21:32:20,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=183, PETRI_TRANSITIONS=182} [2025-01-09 21:32:20,309 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -14 predicate places. [2025-01-09 21:32:20,310 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 182 transitions, 416 flow [2025-01-09 21:32:20,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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:32:20,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:20,310 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] [2025-01-09 21:32:20,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:32:20,311 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-01-09 21:32:20,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2052501782, now seen corresponding path program 1 times [2025-01-09 21:32:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:20,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284602719] [2025-01-09 21:32:20,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:20,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:20,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:32:20,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:32:20,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:20,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:20,346 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:32:20,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:20,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284602719] [2025-01-09 21:32:20,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284602719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:20,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:20,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85496967] [2025-01-09 21:32:20,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:20,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:20,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:20,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:20,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:20,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 222 [2025-01-09 21:32:20,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 182 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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:32:20,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:20,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 222 [2025-01-09 21:32:20,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:20,420 INFO L124 PetriNetUnfolderBase]: 98/627 cut-off events. [2025-01-09 21:32:20,420 INFO L125 PetriNetUnfolderBase]: For 62/67 co-relation queries the response was YES. [2025-01-09 21:32:20,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 627 events. 98/627 cut-off events. For 62/67 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3543 event pairs, 36 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 846. Up to 98 conditions per place. [2025-01-09 21:32:20,424 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 0 selfloop transitions, 0 changer transitions 185/185 dead transitions. [2025-01-09 21:32:20,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 185 transitions, 460 flow [2025-01-09 21:32:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2025-01-09 21:32:20,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2025-01-09 21:32:20,425 INFO L175 Difference]: Start difference. First operand has 183 places, 182 transitions, 416 flow. Second operand 3 states and 624 transitions. [2025-01-09 21:32:20,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 185 transitions, 460 flow [2025-01-09 21:32:20,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 185 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:20,427 INFO L231 Difference]: Finished difference. Result has 182 places, 0 transitions, 0 flow [2025-01-09 21:32:20,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=182, PETRI_TRANSITIONS=0} [2025-01-09 21:32:20,428 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -15 predicate places. [2025-01-09 21:32:20,428 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 0 transitions, 0 flow [2025-01-09 21:32:20,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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:32:20,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 45 remaining) [2025-01-09 21:32:20,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-01-09 21:32:20,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-01-09 21:32:20,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-01-09 21:32:20,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-01-09 21:32:20,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-01-09 21:32:20,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 45 remaining) [2025-01-09 21:32:20,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-01-09 21:32:20,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-01-09 21:32:20,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-01-09 21:32:20,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:32:20,433 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:20,438 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:20,438 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:20,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:20 BasicIcfg [2025-01-09 21:32:20,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:20,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:20,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:20,445 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:20,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:17" (3/4) ... [2025-01-09 21:32:20,447 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:20,449 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:20,449 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:20,449 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:20,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:32:20,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:20,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:32:20,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:20,519 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:20,519 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:20,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:20,520 INFO L158 Benchmark]: Toolchain (without parser) took 3557.64ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.6MB in the beginning and 79.3MB in the end (delta: 32.3MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:20,520 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:20,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.23ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 99.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:20,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.76ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.5MB in the end (delta: 999.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:20,520 INFO L158 Benchmark]: Boogie Preprocessor took 20.99ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:20,521 INFO L158 Benchmark]: RCFGBuilder took 385.83ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 78.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:20,521 INFO L158 Benchmark]: TraceAbstraction took 2845.42ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 77.9MB in the beginning and 85.9MB in the end (delta: -8.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:20,521 INFO L158 Benchmark]: Witness Printer took 74.32ms. Allocated memory is still 176.2MB. Free memory was 85.9MB in the beginning and 79.3MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:20,522 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.30ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.23ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 99.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.76ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 98.5MB in the end (delta: 999.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.99ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 385.83ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 78.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2845.42ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 77.9MB in the beginning and 85.9MB in the end (delta: -8.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 74.32ms. Allocated memory is still 176.2MB. Free memory was 85.9MB in the beginning and 79.3MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: 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: 59]: 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: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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 7 procedures, 326 locations, 45 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: 2.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 631 IncrementalHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 18 mSDtfsCounter, 631 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=13, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1034 ConstructedInterpolants, 0 QuantifiedInterpolants, 1070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:20,533 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